23 search results - page 2 / 5 » Decidability and proof systems for language-based noninterfe... |
SEFM
2006
IEEE
14 years 4 months ago
2006
IEEE
We present an operational model for describing random reactive systems. Some models have already been proposed for this purpose, but they generally aim at performing global reason...
CSFW
2008
IEEE
14 years 5 months ago
2008
IEEE
Early work on security-typed languages required that legal information flows be defined statically. More recently, techniques have been introduced that relax these assumptions a...
RTA
1993
Springer
14 years 2 months ago
1993
Springer
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ ...
POPL
2010
ACM
14 years 8 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
JCT
2007
13 years 10 months ago
2007
We prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a p...