Automated termination in model checking modulo theories

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

Volumn 6945 LNCS, Issue , 2011, Pages 110-124

  Carioni, Alessandro ^a   Ghilardi, Silvio ^a   Ranise, Silvio ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED TERMINATION; BACKWARD REACHABILITY; INFINITE STATE SYSTEMS; MODULO THEORIES;

MODEL CHECKING;

EID: 80053338991     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24288-5_11     Document Type: Conference Paper

References (22)

1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proc. of LICS, pp. 313-321 (1996)
2. Abdulla, P.A., Delzanno, G., Henda, N.B., Rezine, A.: Regular model checking without transducers. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 721-736. Springer, Heidelberg (2007)
3. Abdulla, P.A., Deneux, J., Mahata, P.: Multi-clock timed networks. In: Proc. of LICS 2004, the 18th IEEE Int. Symp. on Logic in Computer Science (2004)
4. Abdulla, P.A.: Forcing monotonicity in parameterized verification: From multisets to words. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol. 5901, pp. 1-15. Springer, Heidelberg (2010)
5. Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Information and Computation 127(2), 91-101 (1996)
6. Abdulla, P.A., Jonsson, B.: Model checking of systems with many identical timed processes. Theoretical Computer Science, 241-264 (2003)
7. Alberti, F., Ghilardi, S., Pagani, E., Ranise, S., Rossi, G.P.: Brief Announcement: Automated Support for the Design and Validation of Fault Tolerant Parameterized Systems-a case study. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 392-394. Springer, Heidelberg (2010)
8. Carioni, A., Ghilardi, S., Ranise, S.: Automated Termination in Model Checking Modulo Theories - extended version, http://homes.dsi.unimi.it/ ~ghilardi/allegati/CGR-RP11-extended.pdf
9. Carioni, A., Ghilardi, S., Ranise, S.: MCMT in the Land of Parametrized Timed Automata. In: Proc. of VERIFY 2010 (2010)
10. Chang, C.-C., Keisler, J.H.: Model Theory, 3rd edn. North-Holland, Amsterdam (1990)
11. Delzanno, G., Esparza, J., Podelski, A.: Constraint-based analysis of broadcast protocols. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 50-66. Springer, Heidelberg (1999)
12. Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, New York (1972)
13. Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: Proc. of LICS, pp. 352-359. IEEE Computer Society, Los Alamitos (1999)
14. Ghilardi, S., Nicolini, E., Ranise, S., Zucchelli, D.: Towards SMT Model-Checking of Array-based Systems. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 67-82. Springer, Heidelberg (2008)
15. Ghilardi, S., Ranise, S.: A Note on the Stopping Failures Models, Unpublished Draft, mcmt web site (2009)
16. Ghilardi, S., Ranise, S.: Goal Directed Invariant Synthesis for Model Checking Modulo Theories. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS, vol. 5607, pp. 173-188. Springer, Heidelberg (2009)
17. Ghilardi, S., Ranise, S.: Model Checking Modulo Theory at work: the integration of Yices in MCMT. In: AFM 2009 (co-located with CAV 2009) (2009)
18. Ghilardi, S., Ranise, S.: Backward reachability of array-based systems by SMT-solving: termination and invariant synthesis. LMCS 6(4) (2010)
19. Ghilardi, S., Ranise, S., Valsecchi, T.: Light-Weight SMT-based Model-Checking. In: Proc. of AVOCS 2007-2008, ENTCS (2008)
20. Ghilardi, S., Ranise, S.: MCMT: A Model Checker Modulo Theories. In: Giesl, J., Hähnle, R. (eds.) IJCAR 2010. LNCS, vol. 6173, pp. 22-29. Springer, Heidelberg (2010)
21. Philippe, S.: Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters 83(5), 251-261 (2002)
22. Ranise, S., Tinelli, C.: The SMT-LIB Standard: Version 1.2. Technical report, Dep. of Comp. Science, Iowa (2006), http://www.SMT-LIB.org/papers