Leaping loops in the presence of abstraction

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

Volumn 4590 LNCS, Issue , 2007, Pages 491-503

  Ball, Thomas ^a   Kupferman, Orna ^b   Sagiv, Mooly ^c  

^a MICROSOFT RESEARCH   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; ERROR DETECTION; STATE SPACE METHODS; THEOREM PROVING; VERIFICATION;

LOOP TERMINATION; PROGRAM ANALYSIS; REACHABILITY ANALYSIS;

COMPUTER PROGRAMMING;

EID: 38149091713     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73368-3_50     Document Type: Conference Paper

References (14)

1. Ball, T.: A theory of predicate-complete test coverage and generation. In: 3rd International Symposium on Formal Methods for Components and Objects (2004)
2. Ball, T., Bounimova, E., Cook, B., Levin, V., Lichtenberg, J., McGarvey, C., Ondrusek, B., Rajamani, S.K., Ustuner, A.: Thorough static analysis of device drivers. In: EuroSys (2006)
3. Ball, T., Kupferman, O.: Better under-approximation of programs by hiding of variables. In: Proc. 7th VMCAI (2006)
4. Berdine, J., Chawdhary, A., Cook, B., Distefano, D., O'Hearn, P.: Variance analyses from invariance analyses. In: Proc. 34th POPL (2007)
5. Bradley, A.R., Manna, Z., Sipma, H.: Linear Ranking with Reachability. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 491-504. Springer, Heidelberg (2005)
6. Cook, B., Podelski, A., Rybalchenko, A.: Termination proofs for systems code. In: Proc. ACM PLDI, pp. 415-426. ACM Press, New York (2006)
7. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for the static analysis of programs by construction or approximation of fixpoints. In: Proc. 4th POPL, pp. 238-252. ACM Press, New York (1977)
8. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)
9. Godefroid, P., Jagadeesan, R.: Automatic abstraction using generalized model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 137-150. Springer, Heidelberg (2002)
10. Kroening, D., Weissenbacher, G.: Counterexamples with loops for predicate abstraction. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 152-165. Springer, Heidelberg (2006)
11. Larsen, K.G., Thomsen, G.B.: A modal process logic. In: Proc. 3th LICS (1988)
12. Larsen, K.G., XinXin, L.: Equation solving using modal transition systems. In: Proc. 5th LICS, pp. 108-117 (1990)
13. Podelski, A., Rybalchenko, A.: Transition invariants. In: Proc. 19th LICS, pp. 32-41 (2004)
14. Shoham, S., Grumberg, O.: Monotonie abstraction-refinement for CTL. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 546-560. Springer, Heidelberg (2004)