Sciweavers

55 search results - page 4 / 11
» Reasoning About Imperative Quantum Programs
Sort
View
ICFP
2008
ACM
14 years 5 months ago
Functional translation of a calculus of capabilities
Reasoning about imperative programs requires the ability to track aliasing and ownership properties. We present a type system that provides this ability, by using regions, capabil...
Arthur Charguéraud, François Pottier
ESOP
2006
Springer
13 years 9 months ago
Bisimulations for Untyped Imperative Objects
We present a sound and complete method for reasoning about contextual equivalence in the untyped, imperative object calculus of Abadi and Cardelli [1]. Our method is based on bisim...
Vasileios Koutavas, Mitchell Wand
ESOP
2003
Springer
13 years 11 months ago
Automatic Software Model Checking Using CLP
This paper proposes the use of constraint logic programming (CLP) to perform model checking of traditional, imperative programs. We present a semantics-preserving translation from ...
Cormac Flanagan
ACSD
2001
IEEE
134views Hardware» more  ACSD 2001»
13 years 9 months ago
Embedding Imperative Synchronous Languages in Interactive Theorem Provers
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
Klaus Schneider
LICS
2002
IEEE
13 years 10 months ago
Separation Logic: A Logic for Shared Mutable Data Structures
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level imperative pr...
John C. Reynolds