Towards SOS meta-theory for language-based security

M.R. Mousavi

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

SOS meta-theory has been very successful in defining meta-theorems using which one can prove useful properties about language constructs. These meta-theorems can save pages of standard proof thanks to their generic and language-independent formulation. Security properties of language constructs look like promising candidates to be turned into SOS meta-theorems and there has already been an attempt in this direction in the context of process calculi security. In this paper, we give an exploratory account of this issue in the context of language-based security. To do this, we give a superficial overview of information-flow security and in particular, non-interference as a central notion in this field. Then, we point out some interesting links between non-interference and our recent work on notions of bisimulation with data. Finally, some ideas regarding SOS meta-theorems for these notions are presented.
Original languageEnglish
Title of host publicationProceedings of the Workshop "Essays on Algebraic Process Calculi" (APC 25, Bertinoro, Italy, August 1-5, 2005)
EditorsL. Aceto, A.D. Gordon
Pages267-271
DOIs
Publication statusPublished - 2006

Publication series

NameElectronic Notes in Theoretical Computer Science
Volume162
ISSN (Print)1571-0061

Cite this