Using counterexamples for improving the precision of reachability computation with polyhedra

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

Volumn 4590 LNCS, Issue , 2007, Pages 352-365

  Wang, Chao ^a   Yang, Zijiang ^b   Gupta, Aarti ^a   Ivančić, Franjo ^a  

^a NEC LABORATORIES AMERICA   (United States)

^b WESTERN MICHIGAN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; COMPUTER PROGRAMMING; HEURISTIC ALGORITHMS; ITERATIVE METHODS; VERIFICATION;

COUNTEREXAMPLES; POLYHEDRA; REACHABILITY COMPUTATION;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

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

References (32)

1. Bagnara, R., Hill, P.M., Ricci, E., Zaffanella, E.: Precise widening operators for convex polyhedra (LNCS 2694). In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 337-354. Springer, Heidelberg (2003)
2. Bagnara, R., Hill, P.M., Zaffanella, E.: Widening operators for powerset domains. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 135-148. Springer, Heidelberg (2004)
3. Ball, T., Majumdar, R., Millstein, T., Rajamani, S.K.: Automatic predicate abstraction of C programs. In: Programming Language Design and Implementation (2001)
4. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computer C-35(8), 677-691 (1986)
5. Bultan, T., Gerber, R., League, C.: Verifying systems with integer constraints and boolean predicates: A composite approach. In: Symposium on Software Testing and Analysis, pp. 113-123 (1998)
6. Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154-169. Springer, Heidelberg (2000)
7. Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logics of Programs. LNCS, vol. 131, pp. 52-71. Springer, Heidelberg (1982)
8. Coen-Porisini, A., Denaro, G., Ghezzi, C., Pezze, M.: Using symbolic execution for verifying safety-critical systems. In: European Software Engineering Conference/Foundations of Software Engineering, pp. 142-151 (2001)
9. Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: International Symposium on Programming, pp. 106-126 (1976)
10. Cousot, P., Cousot, R.: Comparing the galois connection and widening/narrowing approaches to abstract interpretation. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol. 631, pp. 269-295. Springer, Heidelberg (1992)
11. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Principles of Programming Languages, pp. 84-96 (1978)
12. Gopan, D., Reps, T.W.: Lookahead widening. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 452-466. Springer, Heidelberg (2006)
13. Graf, S., Saïdi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72-83. Springer, Heidelberg (1997)
14. Gulavani, B.S., Rajamani, S.K.: Counterexample driven refinement for abstract interpretation. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006 and ETAPS 2006. LNCS, vol. 3920, pp. 474-488. Springer, Heidelberg (2006)
15. Halbwachs, N.: Delay analysis in synchronous programs. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 333-346. Springer, Heidelberg (1993)
16. Halbwachs, N., Proy, Y.E., Roumanoff, P.: Verification of real-time systems using linear relation analysis. Formal Methods in Systems Design 11(2), 157-185 (1997)
17. Henzinger, T.A., Ho, P.-H.: A note on abstract interpretation strategies for hybrid automata. In: Hybrid Systems II. LNCS, vol. 999, pp. 252-264. Springer, Heidelberg (1995)
18. Ivančić, F., Shlyakhter, I., Gupta, A., Ganai, M.K., Kahlon, V., Wang, C., Yang, Z.: Model checking C program using F-Soft. In: IEEE International Conference on Computer Design, pp. 297-308 (2005)
19. Ivančić, F., Yang, Z., Shlyakhter, I., Ganai, M.K., Gupta, A., Ashar, P.: F-Soft: Software verification platform. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 301-306. Springer, Heidelberg (2005)
20. Jeannet, B., Halbwachs, N., Raymond, P.: Dynamic partitioning in analyses of numerical properties. In: Cortesi, A., Filé, G. (eds.) SAS 1999. LNCS, vol. 1694, pp. 39-50. Springer, Heidelberg (1999)
21. Kurshan, R.P.: Computer-Aided Verification of Coordinating Processes. Princeton University Press, Princeton, NJ (1994)
22. The Parma Polyhedra Library. University of Parma, Italy, http://www.cs.unipr.it/ppl/
23. McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Boston, MA (1994)
24. McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1-13. Springer, Heidelberg (2003)
25. The Omega Project. University of Maryland, http://www.cs.umd.edu/ projects/omega/
26. Pugh, W., Wonnacott, D.: Going beyond integer programming with the Omega test to eliminate false data dependences. IEEE Trans. on Parallel and Distributed Systems 6(2), 204-211 (1994)
27. Quielle, J.P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Symposium on Programming (1981)
28. Sankaranarayanan, S., Ivančić, F., Shlyakhter, I., Gupta, A.: Static analysis in disjunctive numerical domains. In: Symposium on Static Analysis (2006)
29. Shiple, T.R., Hojati, R., Sangiovanni-Vincentelli, A.L., Brayton, R.K.: Heuristic minimization of BDDs using don't cares. In: Design Automation Conference, pp. 225-231 (1994)
30. Somenzi, F.: CUDD: CU Decision Diagram Package. University of Colorado at Boulder, ftp://vlsi.colorado.edu/pub/
31. Wang, C., Yang, Z., Ivančić, F., Gupta, A.: Disjunctive image computation for embedded software verification. In: Design, Automation and Test in Europe, pp. 1205-1210 (2006)
32. Yang, Z., Wang, C., Ivančić, F., Gupta, A.: Mixed symbolic representations for model checking software programs. In: Formal Methods and Models for Codesign, pp. 17-24 (2006)