56 search results - page 2 / 12 » Formalizing and verifying semantic type soundness of a simpl... |
POPL
2008
ACM
14 years 5 months ago
2008
ACM
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
ESOP
2007
Springer
13 years 8 months ago
2007
Springer
Non-interference is a semantical condition on programs that guarantees the absence of illicit information flow throughout their execution, and that can be enforced by appropriate i...
ENTCS
2000
13 years 4 months ago
2000
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...
ICFP
2006
ACM
14 years 4 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
POPL
2007
ACM
14 years 5 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...