The Pointer Assertion Logic engine

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2001, Pages 221-231

  Moller A ^a   Schwartzbach, M I ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; JAVA PROGRAMMING LANGUAGE; MANIPULATORS; MODULA (PROGRAMMING LANGUAGE);

POINTER ASSERTION LOGIC ENGINES;

DATA STRUCTURES;

EID: 0034833035     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (39)

1. Ten years of Hoare's logic: A survey - Part I
2. Bebop: A symbolic model checker for boolean programs
3. A decidable logic for describing linked data structures
4. Algorithms for guided tree automata
5. Inference rules for programming languages with side effects in expressions
6. Graph-based algorithms for boolean function manipulation
7. A static analyzer for finding dynamic programming errors
8. An assertion language for data structures
9. A language framework for expressing checkable properties of dynamic software
10. Formal models and semantics
11. Checking cleanness in linked lists
12. Compile-time debugging of C programs working on trees
13. Static detection of dynamic memory errors
14. Assigning meanings to programs
15. Static detection of pointer errors: An axiomatisation and a checking algorithm
16. Shape types
17. Model checking Java programs using Java PathFinder
18. Abstractions for recursive pointer data structures: Improving the analysis and transformation of imperative programs
19. An axiomatic basis for computer programming
20. Finding bugs with a constraint solver
21. Automatic verification of pointer programs using monadic second-order logic
22. Mona & Fido: The logic-automaton connection in practice
23. MONA implementation secrets
24. Graph types
25. Graphs and decidable transductions based on edge constraints
26. A domain-specific language for regular sets of strings and trees
27. Putting static analysis to work for verification: A case study
28. TVLA: A system for implementing static analyses
29. Weak monadic second-order theory of successor is not elementary recursive
30. A general axiom of assignment
31. Intuitionistic reasoning about shared mutable data structure
32. Parametric shape analysis via 3 valued logic
33. A comparison of Presburger engines for EFSM reachability