Sciweavers

2623 search results - page 14 / 525
» Hoare Logic in the Abstract
Sort
View
AMAST
2008
Springer
13 years 9 months ago
Explaining Verification Conditions
The Hoare approach to program verification relies on the construction and discharge of verification conditions (VCs) but offers no support to trace, analyze, and understand the VCs...
Ewen Denney, Bernd Fischer 0002
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...
CSFW
2007
IEEE
13 years 11 months ago
Secure information flow and program logics
We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-l...
Lennart Beringer, Martin Hofmann
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...
LICS
2002
IEEE
14 years 9 days 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