Accelerating interpolation-based model-checking

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

Volumn 4963 LNCS, Issue , 2008, Pages 428-442

  Caniart, Nicolas ^a   Fleury, Emmanuel ^a   Leroux, Jérôme ^a   Zeitoun, Marc ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ACCELERATION; INTERPOLATION; POLYNOMIAL APPROXIMATION; REFINING; SET THEORY;

ACCELERATION TECHNIQUES; CONTROL FLOWS; EUROPEAN; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; INTERPOLANT; MODEL CHECKING (MC); REACH ABILITY; REACHABILITY SETS; UNDER-APPROXIMATION;

MODEL CHECKING;

EID: 47249102141     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78800-3_32     Document Type: Conference Paper

References (17)

1. Bardin, S., Finkel, A., Leroux, J., Schnoebelen, P.: Flat Acceleration in Symbolic Model-Checking. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 474-488. Springer, Heidelberg (2005)
2. Beyer, D., Henzinger, T.A., Majumdar, R., Rybalchenko, A.: Path Invariants. In: Proc. of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation (PLDI 2007), pp. 300-309. ACM Press, New York (2007)
3. Boigelot, B.: Symbolic Methods for Exploring Infinite State Spaces. PhD thesis, Faculté des Sciences Appliquées de l'Université de Liège (1999)
4. Boigelot, B.: On Iterating Linear Transformations Over Recognizable Sets of Integers. Theoret. Comput. Sci. 309(1-3), 413-468 (2003)
5. Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular Model-Checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 403-418. Springer, Heidelberg (2000)
6. Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: CounterExample-Guided Abstraction Refinement for Symbolic Model Checking. J. ACM 50(5), 752-794 (2003)
7. Esparza, J., Schwoon, S., Kiefer, S.: Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 489-503. Springer, Heidelberg (2006)
8. 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)
9. Ginsburg, S., Spanier, E.H.: Semigroups, Presburger Formulas and Languages. Pacific Journal of Mathematics 16(2), 285-296 (1966)
10. 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)
11. Gulavani, B., Henzinger, T.A., Kannan, Y., Nori, A., Rajamani, S.K.: Synergy: A New Algorithm for Property Checking. In: FSE 2006, pp. 117-127. ACM Press, New York (2006)
12. Henzinger, T.A., Jhala, R., Majumbar, R., Sutre, G.: Lazy Abstraction. In: Proc. of 29th Symp. on Principles of Programming Languages (POPL 2002), pp. 58-70 (2002)
13. Jhala, R., McMillan, K.L.: A Practical and Complete Approach to Predicate Refinement. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 459-473. Springer, Heidelberg (2006)
14. 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)
15. McMillan, K.L.: An Interpolating Theorem Prover. Journal of Theoritical Computer Science 345(1), 101-121 (2005)
16. McMillan, K.L.: Lazy Abstraction with Interpolants. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 123-136. Springer, Heidelberg (2006)
17. Presburger, M.: über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Comptes Rendus du 1er congrès de Mathématiciens des Pays Slaves, pp. 92-101 (1929)