Compile-time debugging of C programs working on trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1782, Issue , 2000, Pages 119-134

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

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; DATA STRUCTURES; ENCODING (SYMBOLS); FORESTRY; PROGRAM DEBUGGING; RECURSIVE FUNCTIONS; SIGNAL ENCODING; TREES (MATHEMATICS);

AUTOMATICALLY GENERATED; C PROGRAMS; COMPILE TIME; DATA TYPE; DECISION PROCEDURE; LIST STRUCTURES; LOOP FREE; RECURSIVE STRUCTURE;

C (PROGRAMMING LANGUAGE);

EID: 84947243031     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46425-5_8     Document Type: Conference Paper

References (21)

1. Abdelwaheb Ayari, David Basin, and Andreas Podelski. LISA: A specification language based on WS2S. In Proceedings of CSL'97. BRICS, 1997.
2. 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. Springer Verlag, 1996.
3. Rational Software Corporation. Purify. URL: http://www.rational.com/.
4. Niels Damgaard, Nils Klarlund, and Michael I. Schwartzbach. YakYak: Parsing with logical side constraints. In Proceedings of DLT'99, 1999.
5. David L. Detlefs, K. Rustan M. Leino, Greg Nelson, and James B. Saxe. Extended static checking. URL: http://www.research.digital.com/SRC/esc/Esc.html.
6. David Evans. LCLint user's guide. URL: http://www.sds.lcs.mit.edu/ lclint/guide/.
7. Rakesh Ghiya and Laurie J. Hendren. Putting pointer analysis to work. In Proceedings of POPL'98, 1998.
8. GrammaTech Inc. CodeSurfer user guide and reference manual. URL: http://www.grammatech.com/papers/.
9. C.A.R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-580, October 1969.
10. D. Jackson. Aspect: an economical bug-detector. In Proceedings of 13th International Conference on Software Engineering, 1994.
11. Jacob L. Jensen, Michael E. Jørgensen, Nils Klarlund, and Michael I. Schwartzbach. Automatic verification of pointer programs using monadic second-order logic. In PLDI '97, 1997.
12. Nils Klarlund. Mona & Fido: The logic-automaton connection in practice. In Computer Science Logic, CSL '97, LNCS, 1998.
13. Nils Klarlund and Anders Møller. MONA Version 1.3 User Manual. BRICS Notes Series NS-98-3 (2.revision), Department of Computer Science, University of Aarhus, October 1998. URL: http://www.brics.dk/mona/manual.html.
14. Nils Klarlund and Michael I. Schwartzbach. Graph types. In Proc. 20th Symp. on Princ. of Prog. Lang., pages 196-205. ACM, 1993.
15. Nils Klarlund and Michael I. Schwartzbach. Graphs and decidable transductions based on edge constraints. In Proc. CAAP' 94, LNCS 787, 1994.
16. Nils Klarlund and Michael I. Schwartzbach. A domain-specific language for regular sets of strings and trees. IEEE Transactions on Software Engineering, 25(3), 1997.
17. Adam Kolawa and Arthur Hicken. Insure++: A tool to support total quality software. URL: http://www.parasoft.com/products/insure/papers/tech.htm.
18. Anders Møller. MONA project homepage. URL: http://www.brics.dk/mona/.
19. Mooly Sagiv, Thomas Reps, and Reinhard Wilhelm. Solving shape-analysis problems in languages with destructive updating. Transactions on Programming Languages and Systems, 20(1):1-50, January 1998.
20. Wolfgang Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 133-191. MIT Press/Elsevier, 1990.
21. Frank Tip. A survey of program slicing techniques. Journal of Programming Languages, 3(3):121-189, September 1995.