Accelerating interpolants

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

Volumn 7561 LNCS, Issue , 2012, Pages 187-202

  Hojjat, Hossein ^a   Iosif, Radu ^b   Konečný, Filip ^b,d   Kuncak, Viktor ^a   Rümmer, Philipp ^c  

^a EPFL   (Switzerland)

^b VERIMAG   (France)

^c UPPSALA UNIVERSITY   (Sweden)

^d BRNO UNIVERSITY OF TECHNOLOGY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTION REFINEMENT; ACCELERATION TECHNIQUE; CRAIG INTERPOLANTS; EXPERIMENTAL JUSTIFICATION; INFINITE-STATE; INTERPOLANTS; PREDICATE ABSTRACTIONS; TRANSITION SYSTEM; TRANSITIVE CLOSURE; UNDER-APPROXIMATION;

MODEL CHECKING;

INTERPOLATION;

EID: 84868227314     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33386-6_16     Document Type: Conference Paper

References (27)

1. Albert, E., Arenas, P., Genaim, S., Puebla, G.: Closed-Form Upper Bounds in Static Cost Analysis. Journal of Automated Reasoning 46(2) (February 2011)
2. Ball, T., Podelski, A., Rajamani, S.K.: Relative Completeness of Abstraction Refinement for Software Model Checking. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 158-172. Springer, Heidelberg (2002)
3. Bensalem, S., Lakhnech, Y.: Automatic generation of invariants. Form. Methods Syst. Des. 15(1), 75-92 (1999)
4. Beyer, D., Cimatti, A., Griggio, A., Keremoglu, M.E., Sebastiani, R.: Software model checking via large-block encoding. In: FMCAD, pp. 25-32 (2009)
5. Beyer, D., Henzinger, T.A., Majumdar, R., Rybalchenko, A.: Path invariants. In: PLDI, pp. 300-309 (2007)
6. Blanc, R., Henzinger, T.A., Hottelier, T., Kovács, L.: ABC: Algebraic Bound Computation for Loops. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16. LNCS, vol. 6355, pp. 103-118. Springer, Heidelberg (2010)
7. Boigelot, B.: Symbolic Methods for Exploring Infinite State Spaces, PhD Thesis, vol. 189. Collection des Publications de l'Université de Liège (1999)
8. Bouajjani, A., Bozga, M., Habermehl, P., Iosif, R., Moro, P., Vojnar, T.: Programs with Lists Are Counter Automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 517-531. Springer, Heidelberg (2006)
9. Bozga, M., Habermehl, P., Iosif, R.,Konečný, F., Vojnar, T.: Automatic Verification of Integer Array Programs. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 157-172. Springer, Heidelberg (2009)
10. Bozga, M., Iosif, R., Konečný, F.: Fast Acceleration of Ultimately Periodic Relations. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 227-242. Springer, Heidelberg (2010)
11. Brillout, A., Kroening, D., Rümmer, P., Wahl, T.: An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic. In: Giesl, J., Hähnle, R. (eds.) IJCAR 2010. LNCS, vol. 6173, pp. 384-399. Springer, Heidelberg (2010)
12. Caniart, N., Fleury, E., Leroux, J., Zeitoun, M.: Accelerating Interpolation-Based Model-Checking. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 428-442. Springer, Heidelberg (2008)
13. Craig, W.: Linear reasoning. A new form of the Herbrand-Gentzen theorem. The Journal of Symbolic Logic 22(3), 250-268 (1957)
14. Finkel, A., Leroux, J.: How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 145-156. Springer, Heidelberg (2002)
15. Ganty, P., Majumdar, R.: Algorithmic verification of asynchronous programs. CoRR, abs/1011.0551 (2010)
16. Ginsburg, S., Spanier, E.: Bounded algol-like languages. Trans. of the AMS 113(2), 333-368 (1964)
17. Graf, S., Saidi, H.: Construction of Abstract State Graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72-83. Springer, Heidelberg (1997)
18. Heizmann, M., Hoenicke, J., Podelski, A.: Refinement of Trace Abstraction. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol. 5673, pp. 69-85. Springer, Heidelberg (2009)
19. Henzinger, T.A., Jhala, R.,Majumdar, R.,McMillan, K.L.: Abstractions from proofs. In: 31st POPL (2004)
20. Hojjat, H., Konečný, F., Garnier, F., Iosif, R., Kuncak, V., Rümmer, P.: A verification toolkit for numerical transition systems (tool paper). In: FM (2012)
21. Jhala, R., McMillan, K.L.: A Practical and Complete Approach to Predicate Refinement. In: Hermanns, H. (ed.) TACAS 2006. LNCS, vol. 3920, pp. 459-473. Springer, Heidelberg (2006)
22. Kroening, D., Leroux, J., Rümmer, P.: Interpolating Quantifier-Free Presburger Arithmetic. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 489-503. Springer, Heidelberg (2010)
23. McMillan, K.L.: An interpolating theorem prover. Theor. Comput. Sci. 345(1) (2005)
24. Monniaux, D.: Personal Communication
25. Rümmer, P.: A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 274-289. Springer, Heidelberg (2008)
26. Rybalchenko, A., Sofronie-Stokkermans, V.: Constraint Solving for Interpolation. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 346-362. Springer, Heidelberg (2007)
27. Smrčka, A., Vojnar, T.: Verifying Parametrised Hardware Designs Via Counter Automata. In: Yorav, K. (ed.) HVC 2007. LNCS, vol. 4899, pp. 51-68. Springer, Heidelberg (2008)