Symbolic implementation of the best transformer

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

Volumn 2937, Issue , 2004, Pages 252-266

  Reps, Thomas ^a   Sagiv, Mooly ^b   Yorsh, Greta ^b  

^a University of Wisconsin Madison   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING;

ABSTRACT INTERPRETATIONS; DECISION PROCEDURE; LOGICAL FORMULAS; SUCCESSIVE APPROXIMATIONS;

MODEL CHECKING;

EID: 84944221600     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24622-0_21     Document Type: Conference Paper

References (20)

1. Stanford validity checker. “http://verify.stanford.edu/SVC/”, 1999.
2. T. Ball, R. Majumdar, T. Millstein, and S.K. Rajamani. Automatic predicate abstraction of C programs. In Prog. Lang. Design and Impl., NewYork, NY, 2001. ACM Press.
3. T. Ball and S.K. Rajamani. The SLAM toolkit. In Computer-Aided Verif., Lec. Notes in Comp. Sci., pages 260-264, 2001.
4. E. Clarke, A. Gupta, J. Kukula, and O. Strichman. SAT based abstraction-refinement using ILP and machine learning techniques. In Computer-Aided Verif., 2002.
5. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Computer-Aided Verif., pages 154-169, July 2000.
6. P. Cousot and R. Cousot. Abstract interpretation:A unified lattice model for static analysis of programs by construction of approximation of fixed points. In Princ. of Prog. Lang., 1977.
7. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Princ. of Prog. Lang., pages 269-282, NewYork, NY, 1979. ACM Press.
8. S. Das, D.L. Dill, and S. Park. Experience with predicate abstraction. In Computer-Aided Verif., pages 160-171. Springer-Verlag, July 1999.
9. D. Detlefs, G. Nelson, and J. Saxe. Simplify. Compaq Systems Research Center, Palo Alto, CA, 1999.
10. H.B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972.
11. S. Graf and H. Saїdi. Construction of abstract state graphs with PVS. In Computer-Aided Verif., pages 72-83, June 1997.
12. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Princ. of Prog. Lang., pages 58-70, NewYork, NY, January 2002. ACM Press.
13. ILOG. ILOG optimization suite: White paper. ILOG S.A., Gentilly, France, 2001.
14. G.A. Kildall. A unified approach to global program optimization. In Princ. of Prog. Lang., pages 194-206, NewYork, NY, 1973. ACM Press.
15. N. Klarlund and A. Møller. MONA Version 1.4 User Manual. BRICS Notes Series NS-01-1, Univ. of Aarhus, January 2001.
16. W. McCune. MACE User Manual and Guide. Argonne Nat. Lab., May 2001.
17. T.M. Mitchell. Machine Learning. WCB/McGraw-Hill, Boston, MA, 1997.
18. F. Nielson, H.R. Nielson, and C. Hankin. Principles of Program Analysis. Springer-Verlag, 1999.
19. J. Slaney. Finder - Finite Domain Enumerator, Version 3.0. Aust. Nat. Univ., July 1995.
20. J. Zhang and H. Zhang. Generating models by SEM. In Int. Conf. on Auto. Deduc., volume 1104 of Lec. Notes in Art. Intell., pages 308-312. Springer-Verlag, 1996.