Automated Termination in Model Checking Modulo Theories

  • Alessandro Carioni
  • Silvio Ghilardi
  • Silvio Ranise
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6945)

Abstract

We use a declarative SMT-based approach to model-checking of infinite state systems to design a procedure for automatically establishing the termination of backward reachability by using well-quasi-orderings. Besides showing that our procedure succeeds in many instances of problems covered by general termination results, we argue that it could predict termination also on single problems outside the scope of applicability of such general results.

Keywords

Reachable State Local Clock Unsafe State Broadcast Protocol State Model Check 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)Google Scholar
  2. 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)CrossRefGoogle Scholar
  3. 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)Google Scholar
  4. 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)CrossRefGoogle Scholar
  5. 5.
    Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Information and Computation 127(2), 91–101 (1996)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Abdulla, P.A., Jonsson, B.: Model checking of systems with many identical timed processes. Theoretical Computer Science, 241–264 (2003)Google Scholar
  7. 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)CrossRefGoogle Scholar
  8. 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. 9.
    Carioni, A., Ghilardi, S., Ranise, S.: MCMT in the Land of Parametrized Timed Automata. In: Proc. of VERIFY 2010 (2010)Google Scholar
  10. 10.
    Chang, C.-C., Keisler, J.H.: Model Theory, 3rd edn. North-Holland, Amsterdam (1990)MATHGoogle Scholar
  11. 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)CrossRefGoogle Scholar
  12. 12.
    Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, New York (1972)MATHGoogle Scholar
  13. 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)Google Scholar
  14. 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)CrossRefGoogle Scholar
  15. 15.
    Ghilardi, S., Ranise, S.: A Note on the Stopping Failures Models, Unpublished Draft, mcmt web site (2009)Google Scholar
  16. 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)CrossRefGoogle Scholar
  17. 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)Google Scholar
  18. 18.
    Ghilardi, S., Ranise, S.: Backward reachability of array-based systems by SMT-solving: termination and invariant synthesis. LMCS 6(4) (2010)Google Scholar
  19. 19.
    Ghilardi, S., Ranise, S., Valsecchi, T.: Light-Weight SMT-based Model-Checking. In: Proc. of AVOCS 2007-2008, ENTCS (2008)Google Scholar
  20. 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)CrossRefGoogle Scholar
  21. 21.
    Philippe, S.: Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters 83(5), 251–261 (2002)MathSciNetCrossRefMATHGoogle Scholar
  22. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Alessandro Carioni
    • 1
  • Silvio Ghilardi
    • 1
  • Silvio Ranise
    • 2
  1. 1.Università degli Studi di MilanoMilanoItalia
  2. 2.FBK-IrstTrentoItalia

Personalised recommendations