The pointer assertion logic engine

Møller, Anders; Schwartzbach, Michael I.

doi:10.1145/381694.378851

Cited by 72 publications

(74 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two other decidable logics have been successfully used to define properties of linked data structures: WS2S has been used in [3,10] to define properties of heap-allocated data structures, and to conduct Hoare-style verification using programmer-supplied loop invariants in the PALE system [10].…”

Section: Decidable Logics For Expressing Data-structure Propertiesmentioning

confidence: 99%

“…PALE [10] uses a hard-coded mapping of linked data-structures into WS2S, and uses MONA decision procedures. The simulation technique can be used to extend the applicability of WS2S to more general sets of stores than those handled in [10], for example, cyclic shared singly-linked lists, as described in Section 2.3, and also to simulate generalized trees and undirected graphs.…”

Section: Simulating Storesmentioning

confidence: 99%

See 1 more Smart Citation

Verification via Structure Simulation

Immerman¹,

Rabinovich

Reps³

et al. 2004

Computer Aided Verification

View full text Add to dashboard Cite

This paper shows how to harness decision procedures to automatically verify safety properties of imperative programs that perform dynamic storage allocation and destructive updating of structure fields. Decidable logics that can express reachability properties are used to state properties of linked data structures, while guaranteeing that the verification method always terminates. The main technical contribution is a method of structure simulation in which a set of original structures that we wish to model, e.g., doubly linked lists, nested linked lists, binary trees, etc., are mapped to a set of tractable structures that can be reasoned about using decidable logics. Decidable logics that can express reachability are rather limited in the data structures that they can directly model. For instance, our examples use the logic MSO-E, which can only model function graphs; however, the simulation technique provides an indirect way to model additional data structures.

show abstract

Section: Decidable Logics For Expressing Data-structure Propertiesmentioning

confidence: 99%

Section: Simulating Storesmentioning

confidence: 99%

Verification via Structure Simulation

Immerman¹,

Rabinovich

Reps³

et al. 2004

Computer Aided Verification

View full text Add to dashboard Cite

show abstract

“…Our partitioning of reference fields is inspired by the notion of a back-bone in certain data structures [19].…”

Section: Definition 2 For a Core Set C The Set Of Fields F − C Is Amentioning

confidence: 99%

“…Shape analyses [10,20,19,2] can handle structural constraints using abstract heap representations, predicate abstraction etc. However, shape analyses typically do not consider rich properties of data values in structures and mostly abstract away from the data.…”

Section: Static Analysesmentioning

confidence: 99%

See 1 more Smart Citation

Generating Representation Invariants of Structurally Complex Data

Malik

Pervaiz

Khurshid

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. Generating likely invariants using dynamic analyses is becoming an increasingly effective technique in software checking methodologies. This paper presents Deryaft, a novel algorithm for generating likely representation invariants of structurally complex data. Given a small set of concrete structures, Deryaft analyzes their key characteristics to formulate local and global properties that the structures exhibit. For effective formulation of structural invariants, Deryaft focuses on graph properties, including reachability, and views the program heap as an edge-labeled graph.Deryaft outputs a Java predicate that represents the invariants; the predicate takes an input structure and returns true if and only if it satisfies the invariants. The invariants generated by Deryaft directly enable automation of various existing frameworks, such as the Korat test generation framework and the Juzi data structure repair framework, which otherwise require the user to provide the invariants. Experimental results with the Deryaft prototype show that it feasibly generates invariants for a range of subject structures, including libraries as well as a stand-alone application.

show abstract

Data Structure Specifications via Local Equality Axioms

McPeak

Necula

2005

Computer Aided Verification

View full text Add to dashboard Cite

We describe a program verification methodology for specifying global shape properties of data structures by means of axioms involving predicates on scalar fields, pointer equalities, and pointer disequalities, in the neighborhood of a memory cell. We show that such local invariants are both natural and sufficient for describing a large class of data structures. We describe a complete decision procedure for axioms without disequalities, and practical heuristics for the full language. The procedure has the key advantage that it can be extended easily with reasoning for any decidable theory of scalar fields.

show abstract

The pointer assertion logic engine

Cited by 72 publications

References 38 publications

Verification via Structure Simulation

Verification via Structure Simulation

Generating Representation Invariants of Structurally Complex Data

Data Structure Specifications via Local Equality Axioms

Contact Info

Product

Resources

About