The pointer assertion logic engine

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 36, Issue 5, 2001, Pages 221-231

  Møller, Anders ^a   Schwartzbach, Michael I ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 18844435680     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/381694.378851     Document Type: Article

References (39)

1. Krzysztof R. Apt. Ten years of Hoare's logic: A survey - part I. ACM Transactions on Programming Languages, 3(4):431-483, 1981.
2. Thomas Ball and Sriram K. Rajamani. Bebop: A symbolic model checker for boolean programs. In Proceedings of the SPIN Software Model Checking Workshop, volume 1885 of LNCS, 2000.
3. Michael Benedikt, Thomas Reps, and Mooly Sagiv. A decidable logic for describing linked data structures. In European Symposium On Programming, ESOP'99, volume 1576 of LNCS, 1999.
4. Morten Biehl, Nils Klarlund, and Theis Rauhe. Algorithms for guided tree automata. In First International Workshop on Implementing Automata, WIA'96, volume 1260 of LNCS, 1997.
5. Paul E. Black and Phillip J. Windley. Inference rules for programming languages with side effects in expressions. In International Conference on Theorem Proving in Higher Order Logics, 1996.
6. Randal E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, Aug 1986.
7. William R. Bush, Jonathan D. Pincus, and David J. Sielaff. A static analyzer for finding dynamic programming errors. Software: Practice and Experience, 30(7), 2000.
8. Stephen A. Cook and Derek C. Oppen. An assertion language for data structures. In Principles of Programming Languages, POPL'75, pages 160-166, 1975.
9. C. Corbett, Matthew B. Dwyer, John Hatcliff, and Robby. A language framework for expressing checkable properties of dynamic software. In Proceedings of the SPIN Software Model Checking Workshop, volume 1885 of LNCS, 2000.
10. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press, 1990.
11. Patrick Cousot. Formal models and semantics. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 841-993. MIT Press/Elsevier, 1990.
12. David L. Detlefs, K. Rustan M. Leino, Greg Nelson, and James B. Saxe. Extended static checking. Research Report 159, Compaq Systems Research Center, December, 1998.
13. Nurit Dor, Michael Rodeh, and Mooly Sagiv. Checking cleanness in linked lists. In Seventh International Static Analysis Symposium, SAS'00, 2000.
14. Jacob Elgaard, Anders Møller, and Michael I. Schwartzbach. Compile-time debugging of C programs working on trees. In European Symposium on Programming Languages and Systems, ESOP'00, volume 1782 of LNCS, 2000.
15. David Evans. Static detection of dynamic memory errors. In Programming Language Design and Implementation, PLDI'96, 1996.
16. Robert W. Floyd, Assigning meanings to programs. Mathematical Aspects of Computer Science, American Math. Soc., 1967.
17. Pascal Fradet, Ronan Gaugne, and Daniel Le Métayer. Static detection of pointer errors: An axiomatisation and a checking algorithm. In European Symposium on Programming, ESOP'96, volume 1058 of LNCS, 1996.
18. Pascal Fradet and Daniel Le Métayer. Shape types. In Principles of Programming Languages, POPL'97. ACM, 1997.
19. David Gries. The Science of Programming. Springer-Verlag, 1981.
20. Klaus Havelund and Thomas Pressburger. Model checking Java programs using Java PathFinder. International Journal on Software Tools for Technology Transfer, 2(4), April 2000.
21. Laurie Hendren, Joseph Hummel, and Alexandru Nicolau. Abstractions for recursive pointer data structures: Improving the analysis and transformation of imperative programs. In Program Language Design and Implementation, PLDI'92, 1992.
22. C.A.R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-580, Oct 1969.
23. Daniel Jackson and Mandana Vaziri. Finding bugs with a constraint solver. In International Symposium on Software Testing and Analysis, ISSTA'00. ACM, 2000.
24. Jacob L. Jensen, Michael E. Jørgensen, Nils Klarlund, and Michael I. Schwartzbach. Automatic verification of pointer programs using monadic second-order logic. In Programming Language Design and Implementation, PLDI'97, 1997.
25. Nils Klarlund. Mona & Fido: The logic-automaton connection in practice. In Computer Science Logic, CSL'97, volume 1414 of LNCS, 1998.
26. Nils Klarlund and Anders Møller. MONA Version 1.4 User Manual BRICS Notes Series NS-01-1, Department of Computer Science, University of Aarhus, January 2001.
27. Nils Klarlund, Anders Møller, and Michael I. Schwartzbach. MONA implementation secrets. In Fifth International Conference on Implementation and Application of Automata, CIAA'00, LNCS, 2000.
28. Nils Klarlund and Michael I. Schwartzbach. Graph types. In Principles of Programming Languages, POPL'93. ACM, 1993.
29. Nils Klarlund and Michael I. Schwartzbach. Graphs and decidable transductions based on edge constraints. In Trees in Algebra and Programming, CAAP'94, volume 787 of LNCS, 1994.
30. Nils Klarlund and Michael I. Schwartzbach. A domain-specific language for regular sets of strings and trees. IEEE Transactions On Software Engineering 25(3):378-386, 1999.
31. Tal Lev-Ami, Thomas Reps, Mooly Sagiv, and Reinhard Wilhelm. Putting static analysis to work for verification: a case study. In International Symposium on Software Testing and Analysis, ISSTA'00. ACM, 2000.
32. Tal Lev-Ami and Mooly Sagiv. TVLA: A system for implementing static analyses. In Seventh International Static Analysis Symposium, SAS'00, 2000.
33. Albert R. Meyer. Weak monadic second-order theory of successor is not elementary recursive. In R. Parikh, editor, Logic Colloquium, (Proc. Symposium on Logic, Boston, 1972), volume 453 of LNCS, pages 132-154, 1975.
34. Anders Møller. MONA project home page. www.brics.dk/mona.
35. Anders Møller. PALE project home page. www.brics.dk/PALE.
36. Joseph M. Morris. A general axiom of assignment. In Theoretical Foundations of Programming Methodology, 1982.
37. John C. Reynolds. Intuitionistic reasoning about shared mutable data structure. In Millennial Perspectives in Computer Science, 2000.
38. Mooly Sagiv, Thomas Reps, and Reinhard Wilhelm. Parametric shape analysis via 3 valued logic. In Principles of Programming Languages, POPL'99, 1999.
39. Thomas R. Shiple, James H. Kukula, and Rajeev K. Ranjan. A comparison of Presburger engines for EFSM reachability. In Computer Aided Verification, CAV'98, volume 1427 of LNCS, 1998.