442 search results - page 29 / 89 » Proof Abstraction for Imperative Languages |
ESOP
2004
Springer
14 years 2 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
ESOP
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. A verified compiler is an integral part of every security infrastructure. Previous work has come up with formal semantics for sequential and concurrent variants of Java a...
ESOP
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. The hiding of internal invariants creates a mismatch between procedure specifications in an interface and proof obligations on the implementations of those procedures. T...
POPL
2004
ACM
14 years 9 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...