(Enter summary)
Abstract: We present a new framework for verifying partial specifications of programs in order to catch type and memory errors and check data structure invariants. Our technique can verify a large class of data structures, namely all those that can be expressed as graph types. Earlier versions were restricted to simple special cases such as lists or trees. Even so, our current implementation is as fast as the previous specialized tools. Programs are annotated with partial specifications expressed in... (Update)
Cited by: More
TestEra: Specification-based Testing of Java Programs Using SAT - Sarfraz Khurshid And (2004)
(Correct)
Unknown -
(Correct)
Symbolic Execution with Separation Logic - Berdine, Calcagno, O'Hearn (2005)
(Correct)
Similar documents (at the sentence level):
77.4%: The Pointer Assertion Logic Engine - Møller, Schwartzbach (2000)
(Correct)
Active bibliography (related documents): More All
1.3: Program Verification with Monadic Second-Order Logic & Languages.. - Møller (2002)
(Correct)
0.3: MONA Version 1.4 - User Manual - Klarlund, Møller (2001)
(Correct)
0.3: MONA Implementation Secrets - Klarlund, Møller, Schwatzbach (2000)
(Correct)
Similar documents based on text: More All
0.2: Precise Analysis of String Expressions - Christensen, Møller.. (2003)
(Correct)
0.2: The Design Space of Type Checkers for XML Transformation.. - Møller, Schwartzbach (2004)
(Correct)
0.1: Compile-Time Debugging of C Programs Working on Trees - Elgaard, Møller.. (2000)
(Correct)
Related documents from co-citation: More All
35: Parametric shape analysis via 3valued logic
- Sagiv, Reps et al. - 1999
22: and Martin Rinard (context) - Kuncak, Lam - 2002
22: Shape types
- Fradet, Le Metayer - 1997
BibTeX entry: (Update)
Anders Mller and Michael I. Schwartzbach. The Pointer Assertion Logic Engine, November 2000. Submitted for publication. http://citeseer.ist.psu.edu/mller01pointer.html More
@inproceedings{ moller00pointer,
author = {Anders M\o{}ller and Michael I. Schwartzbach},
title = {The Pointer Assertion Logic Engine},
booktitle = {Proc. ACM SIGPLAN Conference on Programming Language
Design and Implementation, PLDI~'01},
year = {2001},
month = {June},
pages = {221-231},
note = {Also in SIGPLAN Notices 36(5) (May 2001)},
url = {citeseer.ist.psu.edu/mller01pointer.html} }
Citations (may not include all citations):
3972
Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
650
An axiomatic basis for computer programming (context) - Hoare - 1969
150
Parametric shape analysis via 3 valued logic
- Sagiv, Reps et al. - 1999
141
Compaq Systems Research Center (context) - Detlefs, Rustan et al. - 1998
140
Model checking Java programs using Java PathFinder
- Havelund, Pressburger - 2000
135
Graph-based algorithms for boolean function manipulation
- Bryant - 1986
88
Intuitionistic reasoning about shared mutable data structure
- Reynolds - 2000
88
Static detection of dynamic memory errors
- Evans - 1996
79
Abstractions for recursive pointer data structures: Improvin..
- Hendren, Hummel et al. - 1992
72
Bebop: A symbolic model checker for boolean programs
- Ball, Rajamani - 2000
68
Ten years of Hoare's logic: A survey---part (context) - Apt - 1981
59
A static analyzer for finding dynamic programming errors
- Bush, Pincus et al. - 2000
48
Department of Computer Science (context) - Klarlund, Mller et al. - 2001
40
A decidable logic for describing linked data structures
- Benedikt, Reps et al. - 1999
37
Shape types
- Fradet, Le Metayer - 1997
36
Automatic verification of pointer programs using monadic sec..
- Jensen, Jrgensen et al. - 1997
36
Finding bugs with a constraint solver (context) - Jackson, Vaziri - 2000
35
MONA implementation secrets
- Klarlund, Mller et al. - 2000
33
Nils Klarlund and Michael (context) - Klarlund, Graph et al. - 1993
30
Fido: The logic-automaton connection in practice (context) - Klarlund - 1998
30
A comparison of Presburger engines for EFSM reachability
- Shiple, Kukula et al. - 1998
29
The Science of Programming (context) - Gries - 1981
29
Weak monadic second-order theory of successor is not element.. (context) - Meyer
25
Graphs and decidable transductions based on edge constraints
- Klarlund, Schwartzbach - 1994
22
Checking cleanness in linked lists
- Dor, Rodeh et al. - 2000
21
Compile-time debugging of C programs working on trees
- Elgaard, Mller et al. - 2000
20
Algorithms for guided tree automata (context) - Biehl, Klarlund et al. - 1997
19
A language framework for expressing checkable properties of ..
- Corbett, Dwyer et al. - 2000
18
Static detection of pointer errors: An axiomatisation and a ..
- Fradet, Gaugne et al. - 1996
15
Putting static analysis to work for verification: a case stu..
- Lev-Ami, Reps et al. - 2000
15
An assertion language for data structures (context) - Cook, Oppen - 1975
13
Mathematical Aspects of Computer Science (context) - Floyd, to - 1967
13
A domain-specific language for regular sets of strings and t..
- Klarlund, Schwartzbach - 1999
12
Inference rules for programming languages with side e#ects i..
- Black, Windley - 1996
10
A general axiom of assignment (context) - Morris - 1982
7
TVLA: A system for implementing static analyses
- Lev-Ami, Sagiv - 2000
4
Formal models and semantics (context) - Cousot - 1990
www.brics.dk/mona
www.brics.dk/PALE
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.daimi.au.dk/~amoeller/): More
MONA Implementation Secrets - Klarlund, Møller, Schwatzbach (2000)
(Correct)
MONA 1.x: New Techniques for WS1S and WS2S - Elgaard, Klarlund, Møller
(Correct)
Static Analysis of XML Transformations in Java - Kirkegaard, Møller.. (2003)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC