Finite differencing of logical formulas for static analysis

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

Volumn 2618, Issue , 2003, Pages 380-398

  Reps, Thomas ^a   Sagiv, Mooly ^b   Loginov, Alexey ^a  

^a University of Wisconsin Madison   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

FINITE DIFFERENCING; LOGICAL FORMULAS; PROGRAM ANALYSIS;

STATIC ANALYSIS;

EID: 35248890361     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36575-3_26     Document Type: Article

References (19)

1. TVLA system. Available at "http://www.math.tau.ac.il/~rumster/TVLA/".
2. S.B. Akers, Jr. On a theory of Boolean functions. J. Soc. Indust. Appl. Math., 7(4):487-498, December 1959.
3. T. Ball, R. Majumdar, T. Millstein, and S.K. Rajamani. Automatic predicate abstraction of C programs. In Conf. on Prog. Lang. Design and Impl., New York, NY, 2001. ACM Press.
4. 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.
5. S. Das, D.L. Dill, and S. Park. Experience with predicate abstraction. In Proc. Computer-aided Verif., pages 160-171. Springer-Verlag, July 1999.
6. G. Dong and J. Su. Incremental and decremental evaluation of transitive closure by first-order queries. Inf. and Comp., 120:101-106, 1995.
7. G. Dong and J. Su. Incremental maintenance of recursive views using relational calculus/SQL. SIGMOD Record, 29(1):44-51, 2000.
8. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In Proc. Computer-Aided Verif., pages 72-83, June 1997.
9. A. Gupta and I.S. Mumick, editors. Materialized Views: Techniques, Implementations, and Applications. The M.I.T. Press, Cambridge, MA, 1999.
10. T. Lev-Ami, T. Reps, M. Sagiv, and R. Wilhelm. Putting static analysis to work for verification: A case study. In Int. Symp. on Software Testing and Analysis, pages 26-38, 2000.
11. T. Lev-Ami and M. Sagiv. TVLA: A system for implementing static analyses. In Static Analysis Symp., pages 280-301, 2000.
12. Y.A. Liu, S.D. Stoller, and T. Teitelbaum. Discovering auxiliary information for incremental computation. In Symp. on Princ. of Prog. Lang., pages 157-170, January 1996.
13. Y.A. Liu and T. Teitelbaum. Systematic derivation of incremental programs. Sci .of Comp. Program., 24:1-39, 1995.
14. K.L. McMillan. Verification of infinite state systems by compositional model checking. In CHARME, pages 219-234, 1999.
15. A. Møller and M.I. Schwartzbach. The pointer assertion logic engine. In Conf. on Prog. Lang. Design and Impl., pages 221-231, 2001.
16. R. Paige and S. Koenig. Finite differencing of computable expressions. Trans. on Prog. Lang. and Syst., 4(3):402-454, July 1982.
17. S. Patnaik and N. Immerman. Dyn-FO: A parallel, dynamic complexity class. J. Comput. Syst. Sci., 55(2):199-209, October 1997.
18. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. Trans. on Prog. Lang. and Syst., 24(3):217-298, 2002.
19. M. Sharir. Some observations concerning formal differentiation of set theoretic expressions. Trans. on Prog. Lang. and Syst., 4(2): 196-225, April 1982.