Counterexamples with loops for predicate abstraction

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

Volumn 4144 LNCS, Issue , 2006, Pages 152-165

  Kroening, Daniel ^a   Weissenbacher, Georg ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER PROGRAMMING; COMPUTER SIMULATION; COMPUTER SOFTWARE; DATA ACQUISITION; ITERATIVE METHODS; MATHEMATICAL MODELS;

LOOP ITERATIONS; LOOPING COUNTEREXAMPLES; PREDICATE ABSTRACTION; VERIFICATION OF SOFTWARE;

ABSTRACTING;

EID: 33749870840     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_16     Document Type: Conference Paper

References (28)

1. Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press (1999)
2. Graf, S., Saïdi, H.: Construction of abstract state graphs with PVS. In: CAV, Springer (1997) 72-83
3. Ball, T., Rajamani, S.: Boolean programs: A model and process for software analysis. Technical Report 2000-14, Microsoft Research (2000)
4. Ball, T., Cook, B., Levin, V., Rajamani, S.K.: SLAM and Static Driver Verifier: Technology transfer of formal methods inside Microsoft. In: IFM, Springer (2004)
5. Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: CAV, Springer (2000) 154-169
6. Kurshan, R.: Computer-Aided Verification of Coordinating Processes. Princeton University Press (1995)
7. Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: POPL, ACM Press (2002) 58-70
8. Cook, B., Kroening, D., Sharygina, N.: Symbolic model checking for asynchronous Boolean programs. In: SPIN, Springer (2005) 75-90
9. Ball, T., Rajamani, S.: Generating Abstract Explanations of Spurious Counterexamples in C Programs. Technical Report MSR-TR-2002-09, Microsoft Research, Redmond (2002)
10. Jhala, R., Majumdar, R.: Path slicing. In: PLDI, ACM Press (2005) 38-47
11. Armando, A., Castellini, C., Mantovani, J.: Software model checking using linear constraints. In: IFCEM 2004: 6th Int. Conference on Formal Engineering Methods. (2004) 209-223
12. Armando, A., Benerecetti, M., Mantovani, J.: Model checking linear programs with arrays. In: SoftMC, Elsevier (2006) 79-94
13. Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: VMCAI, Springer (2004) 239-25
14. Cook, B., Podelski, A., Rybalchenko, A.: Abstraction-refinement for termination. In: SAS, Springer (2005) 87-101
15. Müler-Olm, M., Seidl, H.: Precise interprocedural analysis through linear algebra. In: POPL, ACM Press (2004) 330-341
16. Zhang, J.: A path-based approach to the detection of infinite looping. Tn: APAQS: Asia-pacific conference on quality software, IEEE Computer Society (2001) 88-96
17. van Engelen, R.A., Birch, J., Shou, Y., Walsh, B., Gallivan, K.A.: A unified framework for nonlinear dependence testing and symbolic analysis. In: ICS: International conference on Supercomputing. ACM Press (2004) 106-115
18. Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. In: POPL, ACM Press (1992) 343-354
19. Ball, T., Rajamani, S.K.: Bebop: A symbolic model checker for Boolean programs. In: SPIN, Springer (2000) 113-130
20. Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient algorithms for model checking pushdown systems. In: CAV, Springer (2000) 232-247
21. Andrews, T., Qadeer, S., Rajamani, S.K. Xie, Y.: Zing: Exploiting program structure for model checking concurrent software. In: CONCUR, Springer (2004) 1-15
22. Gries, D.: The Science of Programming. Springer (1987)
23. Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems 13 (1991) 451-490
24. Clarke, E., Kroening, D, Sharygina, N., Yorav, K.: Predicate abstraction of ANSI-C programs using SAT. FMSD 25 (2004) 105-127
25. Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from proofs. In: POPL, ACM Press (2004) 232-244
26. Aloul, F., Ramani, A., Markov, I., Sakallah, K.: PBS: A backtrack search pseudo-Boolean solver. In: Theory and Appl. of Satisfiability Testing. (2002) 346-353
27. Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: TACAS, Springer (2004) 168-176
28. Ball, T., Podelski, A., Rajamani, S.K.: Boolean and cartesian abstraction for model checking C programs. In: TACAS, London, UK, Springer-Verlag (2001) 268-283