293 search results - page 47 / 59 » Reasoning About States of Probabilistic Sequential Programs |
POPL
2009
ACM
14 years 8 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
FLOPS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Assertion-based contracts provide a powerful mechanism for stating invariants at module boundaries and for enforcing them uniformly. In 2002, Findler and Felleisen showed...
CCS
2011
ACM
12 years 7 months ago
2011
ACM
We develop a flexible information-flow type system for a range of encryption primitives, precisely reflecting their diverse functional and security features. Our rules enable e...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...
OOPSLA
2005
Springer
14 years 1 months ago
2005
Springer
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...