Sciweavers

1536 search results - page 13 / 308
» The Underlying Logic of Hoare Logic
Sort
View
TPHOL
2009
IEEE
14 years 2 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk
TPHOL
2007
IEEE
14 years 1 months ago
Separation Logic for Small-Step cminor
Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor...
Andrew W. Appel, Sandrine Blazy
FASE
2008
Springer
13 years 9 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...
SAS
2009
Springer
171views Formal Methods» more  SAS 2009»
14 years 8 months ago
Bottom-Up Shape Analysis
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
Bhargav S. Gulavani, Supratik Chakraborty, Ganesan...
FCT
2007
Springer
14 years 1 months ago
Rewriting Systems with Data
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Miha...