CL
2002
Springer
13 years 11 months ago
2002
Springer
We introduce a typed variant of Safe Ambients, named Secure Safe Ambients (SSA), whose type system allows behavioral invariants of ambients to be expressed and verified. The most ...
CORR
2004
Springer
13 years 11 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
JLP
2007
13 years 11 months ago
2007
We propose a type system to enforce the security property of noninterference in a core reactive language, obtained by extending the imperative language of Volpano, Smith and Irvin...
JFP
2007
13 years 11 months ago
2007
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...
JCS
2007
13 years 11 months ago
2007
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have specified an information flow ty...
TCS
2008
13 years 11 months ago
2008
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...
TCS
2008
13 years 11 months ago
2008
Our society is increasingly moving towards richer forms of information exchange where mobility of processes and devices plays a prominent role. This tendency has prompted the acad...
TCS
2008
13 years 11 months ago
2008
Subtyping relations for the -calculus are usually defined in a syntactic way, by means of structural rules. We propose a semantic characterisation of channel types and use it to d...
ACTA
2005
13 years 11 months ago
2005
We propose a new type system for information flow analysis for the -calculus. As demonstrated by recent studies, information about whether each communication succeeds is important ...
NGC
2008
Springer
13 years 11 months ago
2008
Springer
A bytecode verifier for the Java virtual machine language (JVML) statically checks that bytecode does not cause any fatal error. However, the present verifier does not check correc...