TVLA: A system for implementing static analyses

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

Volumn 1824 LNCS, Issue , 2000, Pages 280-302

  Lev Ami, Tal ^a   Sagiv, Mooly ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; MANY VALUED LOGICS; SEMANTICS; JAVA PROGRAMMING LANGUAGE;

LOGICAL FORMULAS; MOBILE AMBIENTS; OPERATIONAL SEMANTICS; PARTIAL CORRECTNESS; SAFETY PROPERTY; SORTING PROGRAMS; STATIC-ANALYSIS ALGORITHM; THREE-VALUED LOGIC; LINKED DATA STRUCTURES;

STATIC ANALYSIS;

EID: 84906086021     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45099-3_15     Document Type: Conference Paper

References (19)

1. M. Alt and F. Martin. Generation of efficient interprocedural analyzers with PAG. In SAS'95, Static Analysis Symposium, LNCS 983, pages 33-50. Springer, September 1995. 297
2. U. Aß mann. Graph Grammar Handbook, chapter OPTIMIX, A Tool for Rewriting and Optimizing Programs. Chapman-Hall, 1998
3. R. E. Bryant. Symbolic boolean manipulation with ordered binary decision diagrams. Computing Surveys, 24(3):293-318, September 1992
4. D.R. Chase, M. Wegman, and F. Zadeck. Analysis of pointers and structures. In SIGPLAN Conf. on Prog. Lang. Design and Impl., pages 296-310, New York, NY, 1990. ACM Press
5. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Symp. on Princ. of Prog. Lang., pages 269-282, New York, NY, 1979. ACM Press
6. A. Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In SIGPLAN Conf. on Prog. Lang. Design and Impl., pages 230-241, New York, NY, 1994. ACM Press
7. N. Dor, M. Rodeh, and M. Sagiv. Checking cleanness in linked list s. In SAS'00, Static Analysis Symposium, 2000
8. D. Evans. Static detection of dynamic memory errors. In SIGPLAN Conf. on Prog. Lang. Design and Impl., 1996
9. J.L. Jensen, M.E. Joe rgensen, N.Klarlund, and M.I. Schwartzbach. Automatic verification of pointer programs using monadic second-order logic. In SIGPLAN Conf. on Prog. Lang. Design and Impl., 1997
10. T. Lev-Ami. TVLA: A framework for Kleene based static analysis. Master's thesis, Tel-Aviv University, 2000. Available at http://www.math.tau.ac.il/?tla
11. T. Lev-Ami, T. Reps, M. Sagiv, and R. Wilhelm. Putting static analysis to work for verification: A case study. In International Symposium on Software Testing and Analysis, 2000. Available at http://www.cs.wisc.edu/?reps
12. S.S. Muchnick. Adv anced Compiler Design and Implementation. Morgan & Kaufmann, third edition, 1999
13. F. Nielson, H.R. Nielson, and M. Sagiv. A kleene analysis of mobile ambients. In Proceedings of the 2000 European Symposium On Programming, March 2000
14. N. Rinetskey and M. Sagiv. Interprocedual shape analysis for recursive programs. Available at http://www.cs.technion.ac.il/?maon, 2000
15. M. Sagiv, T. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. Trans. on Prog. Lang. and Syst., 20(1):1-50, January 1998
16. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. In Symp. on Princ. of Prog. Lang., 1999
17. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. Tech. Rep. TR-1383, Comp. Sci. Dept., Univ. of Wisconsin, Madison, WI, March 2000. Submitted for publication. Available at "http://www.cs.wisc. edu/wpis/papers/tr1383.ps
18. S.W.K. Tjiang and J. Hennessy. Sharlit-A tool for building optimizers. In SIGPLAN Conf. on Prog. Lang. Design and Impl., pages 82-93, June 1992
19. J. D. Ullman. Principles of Data base and Knowledge-Base Systems, Volume II: The New Technologies. Comp. Sci. Press, Rockville, MD, 1989