Sciweavers

2623 search results - page 25 / 525
» Hoare Logic in the Abstract
Sort
View
CADE
2007
Springer
14 years 7 months ago
Logical Interpretation: Static Program Analysis Using Theorem Proving
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...
Ashish Tiwari, Sumit Gulwani
SAS
2007
Springer
103views Formal Methods» more  SAS 2007»
14 years 1 months ago
Footprint Analysis: A Shape Analysis That Discovers Preconditions
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
APLAS
2004
ACM
14 years 25 days ago
A Relational Model for Object-Oriented Designs
This paper develops a mathematical characterisation of object-oriented concepts by defining an observation-oriented semantics for an object-oriented language (OOL) with a rich var...
Jifeng He, Zhiming Liu, Xiaoshan Li, Shengchao Qin
TYPES
1998
Springer
13 years 11 months ago
Metatheory of Verification Calculi in LEGO - To what Extent Does Syntax Matter?
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
Thomas Kleymann
JLP
2011
106views more  JLP 2011»
12 years 10 months ago
Concurrent Kleene Algebra and its Foundations
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
Tony Hoare, Bernhard Möller, Georg Struth, Ia...