Sciweavers

59 search results - page 7 / 12
» Proving Pointer Programs in Hoare Logic
Sort
View
POPL
2007
ACM
14 years 9 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
PLDI
2003
ACM
14 years 2 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
FASE
2008
Springer
13 years 10 months ago
A Generic Complete Dynamic Logic for Reasoning About Purity and Effects
For a number of programming languages, among them Eiffel, C, Java and Ruby, Hoare-style logics and dynamic logics have been developed. In these logics, pre- and postconditions are ...
Till Mossakowski, Lutz Schröder, Sergey Gonch...
ICLP
1999
Springer
14 years 1 months ago
Algebra of Logic Programming
A declarative programming language has two kinds of semantics. The tract helps in reasoning about speci cations and correctness, while an operational semantics determines the mann...
Silvija Seres, J. Michael Spivey, C. A. R. Hoare
FASE
2001
Springer
14 years 1 months ago
A Logic for the Java Modeling Language JML
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
Bart Jacobs, Erik Poll