Search
Now showing items 1-10 of 14
On Spatial Conjunction as Second-Order Logic
(2004-10-25)
Spatial conjunction is a powerful construct for reasoning about dynamically allocateddata structures, as well as concurrent, distributed and mobile computation. Whileresearchers have identified many uses of spatial ...
On Using First-Order Theorem Provers in the Jahob Data Structure Verification System
(2006-11-09)
This paper presents our integration of efficient resolution-based theorem provers into the Jahob data structure verification system. Our experimental results show that this approach enables Jahob to automatically ...
On Field Constraint Analysis
(2005-11-03)
We introduce field constraint analysis, a new technique for verifying data structure invariants. A field constraint for a field is a formula specifying a set of objects to which the field can point. Field constraints ...
On Modular Pluggable Analyses Using Set Interfaces
(2003-12-18)
We present a technique that enables the focused applicationof multiple analyses to different modules in the same program. Our researchhas two goals: 1) to address the scalability limitations of preciseanalyses by focusing ...
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
(2004-07-19)
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmetic operations (PA). BAPA can express the ...
On Algorithms and Complexity for Sets with Cardinality Constraints
(2005-08-03)
Typestate systems ensure many desirable properties of imperativeprograms, including initialization of object fields and correct use ofstateful library interfaces. Abstract sets with cardinalityconstraints naturally ...
On the Theory of Structural Subtyping
(2003-01)
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let Sigma be a language consisting of function symbols (representing type constructors) and C a decidable structure in the ...
On Role Logic
(2003-10-24)
We present role logic, a notation for describing propertiesof relational structures in shape analysis, databases, andknowledge bases. We construct role logic using the ideas ofde Bruijn's notation for lambda calculus, an ...
On Generalized Records and Spatial Conjunction in Role Logic
(2004-04-06)
We have previously introduced role logic as a notation fordescribing properties of relational structures in shapeanalysis, databases and knowledge bases. A natural fragmentof role logic corresponds to two-variable logic ...
On Decision Procedures for Set-Value Fields
(2004-11-30)
An important feature of object-oriented programming languages is the ability todynamically instantiate user-defined container data structures such as lists, trees,and hash tables. Programs implement such data structures ...