TVLA: A system for generating abstract interpreters

IFIP Advances in Information and Communication Technology

Volumn 156, Issue , 2004, Pages 367-375

  Lev Ami, Tal ^a   Manevich, Roman ^a   Sagiv, Mooly ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; CONCURRENCY CONTROL; JAVA PROGRAMMING LANGUAGE; MANY VALUED LOGICS; SEMANTICS;

FIRST ORDER LOGIC; GENERIC TRANSITION; JAVA PROGRAM; OPERATIONAL SEMANTICS; THREE-VALUED LOGIC;

COMPUTER CIRCUITS;

EID: 84902459094     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4020-8157-6_28     Document Type: Conference Paper

References (19)

1. Bieber, R. (2001). Alexsa-algorithm explanation by shape analysis-extensions to the TVLA system. Diplomarbeit, Universitat des Saarlandes, Saarbrucken, Germany.
2. Cousot, P. (1997). Abstract interpretation based static analysis parameterized by semantics. In Static Analysis Symp., pages 388-394.
3. Cousot, P. and Cousot, R. (1979). Systematic design of program analysis frameworks. In Symp. on Princ. of Prog. Lang., pages 269-282, New York, NY. ACM Press.
4. Gopan, D., DiMaio, F., Dor, N., Reps, T., and Sagiv, M. (2004). Numeric domains with summarized dimensions. In Int. Conf. on Tools and Algs. for the Construction and Analysis of Systems, pages 512-529.
5. Lev-Ami, T. and Sagiv, M. (2000). TVLA: A system for implementing static analyses. In Static Analysis Symp., pages 280-301.
6. Loginov, A., Reps, T., and Sagiv, M. (2004). Abstraction refinement for 3-valued-logic analysis. Tech. Rep. 1504, Comp. Sci. Dept., Univ. of Wisconsin.
7. Manevich, R., Ramalingam, G., Field, J., Goyal, D., and Sagiv, M. (2002), Compactly representing first-order structures for static analysis. In Static Analysis Symp., pages 196-212.
8. Manevich, R., Sagiv, M., G. Ramalingam, and J. Field (2004). Partially disjunctive heap abstraction. In Static Analysis Symp. To appear.
9. Ramalingam, G., Warshavsky, A., Field, J., Goyal, D., and Sagiv, M. (2002). Deriving specialized program analyses for certifying component-client conformance. In SIGPLAN Conf. on Prog. Lang. Design and Impl., pages 83-94.
10. Reps, T., Sagiv, M., and Loginov, A. (2003). Finite differencing of logical formulas for static analysis. In European Symp. on Programming, pages 380-398.
11. Rinetzky, N. and Sagiv, M. (2001). Interprocedural shape analysis for recursive programs. In Wilhelm, R., editor, Proc. of CC 2001, volume 2027 of LNCS, pages 133-149. Springer.
12. Sagiv, M., Reps, T., and Wilhelm, R. (1998). Solving shape-analysis problems in languages with destructive updating. Trans. on Prog. Lang. and Syst., 20(1):1-50.
13. Sagiv, M., Reps, T., and Wilhelm, R. (2002). Parametric shape analysis via 3-valued logic. Trans. on Prog. Lang. and Syst.
14. Shaham, R., Yahav, E., Kolodner, E., and Sagiv, M. (2003). Establishing local temporal heap safety properties with applications to compile-time memory management. In Proc. of SAS'03, volume 2694 of LNCS, pages 483-503.
15. Yahav, E. (2001). Verifying safety properties of concurrent Java programs using 3-valued logic. In Symp. on Princ. of Prog. Lang., pages 27-40.
16. Yahav, E. and Ramalingam, G. (2004). Verifying safety properties using separation and heterogeneous abstractions. In SIGPLAN Conf. on Prog. Lang. Design and Impl. To appear.
17. Yahav, E., Reps, T., Sagiv, M., and Wilhelm, R. (2003). Verifying temporal heap properties specified via evolution logic. In European Symp. on Programming, volume 2618 of LNCS.
18. Yahav, E. and Sagiv, M. (2003). Automatically verifying concurrent queue algorithms. In Workshop on Software Model Checking.
19. Yorsh, G., Reps, T., and Sagiv, M. (2004). Symbolically computing most-precise abstract operations for shape analysis. In Int. Conf. on Tools and Algs. for the Construction and Analysis of Systems, pages 530-545.