Advertisement

Bounded Model Checking of Recursive Programs with Pointers in K

  • Irina Măriuca Asăvoae
  • Frank de Boer
  • Marcello M. Bonsangue
  • Dorel Lucanu
  • Jurriaan Rot
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7841)

Abstract

We present an adaptation of model-based verification, via model checking pushdown systems, to semantics-based verification. First we introduce the algebraic notion of pushdown system specifications (PSS) and adapt a model checking algorithm for this new notion. We instantiate pushdown system specifications in the \(\mathbb{K}\) framework by means of Shylock, a relevant PSS example. We show why \(\mathbb{K}\) is a suitable environment for the pushdown system specifications and we give a methodology for defining the PSS in \(\mathbb{K}\). Finally, we give a parametric \(\mathbb{K}\) specification for model checking pushdown system specifications based on the adapted model checking algorithm for PSS.

Keywords

pushdown systems model checking the \(\mathbb{K}\) framework 

References

  1. 1.
    Bouajjani, A., Esparza, J., Maler, O.: Reachability Analysis of Pushdown Automata: Application to Model Checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135–150. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  2. 2.
    Bouajjani, A., Fratani, S., Qadeer, S.: Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 207–220. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Bonsangue, M., Caltais, G., Goriac, E.-I., Lucanu, D., Rutten, J., Silva, A.: A Decision Procedure for Bisimilarity of Generalized Regular Expressions. In: Davies, J., Silva, L., da Silva Simão, A. (eds.) SBMF 2010. LNCS, vol. 6527, pp. 226–241. Springer, Heidelberg (2011)Google Scholar
  4. 4.
    Eker, S., Meseguer, J., Sridharanarayanan, A.: The Maude LTL Model Checker. Electr. Notes Theor. Comput. Sci. 71, 162–187 (2002)CrossRefGoogle Scholar
  5. 5.
    Ellison, C., Roşu, G.: An Executable Formal Semantics of C with Applications. In: Field, J., Hicks, M. (eds.) POPL 2012, pp. 533–544. ACM (2012)Google Scholar
  6. 6.
    Esparza, J., Schwoon, S.: A BDD-Based Model Checker for Recursive Programs. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 324–336. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  7. 7.
    Goguen, J., Lin, K., Roşu, G.: Circular Coinductive Rewriting. In: ASE 2000, pp. 123–132. IEEE (2000)Google Scholar
  8. 8.
    Kidd, N., Reps, T., Melski, D., Lal, A.: WPDS++: A C++ Library for Weighted Pushdown Systems (2005), http://www.cs.wisc.edu/wpis/wpds++
  9. 9.
    Kozen, D.: Kleene Algebra with Tests. ACM Trans. Program. Lang. Syst. 19, 427–443 (1997)CrossRefGoogle Scholar
  10. 10.
  11. 11.
    Meseguer, J., Palomino, M., Martí-Oliet, N.: Equational Abstractions. Theor. Comput. Sci. 403(2-3), 239–264 (2008)MATHCrossRefGoogle Scholar
  12. 12.
    Meseguer, J., Roşu, G.: The Rewriting Logics Semantics Project. Theor. Comput. Sci. 373(3), 213–237 (2007)MATHCrossRefGoogle Scholar
  13. 13.
    Rinetzky, N., Bauer, J., Reps, T.W., Sagiv, S., Wilhelm, R.: A Semantics for Procedure Local Heaps and its Abstractions. In: Palsberg, J., Abadi, M. (eds.) POPL 2005, pp. 296–309. ACM (2005)Google Scholar
  14. 14.
    Roşu, G., Şerbănuţă, T.F.: An Overview of the K Semantic Framework. J. Log. Algebr. Program. 79(6), 397–434 (2010)MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    Şerbănuţă, T.F., Roşu, G.: K-Maude: A Rewriting Based Tool for Semantics of Programming Languages. In: Ölveczky, P.C. (ed.) WRLA 2010. LNCS, vol. 6381, pp. 104–122. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  16. 16.
    Rot, J., Asavoae, I.M., de Boer, F., Bonsangue, M., Lucanu, D.: Interacting via the Heap in the Presence of Recursion. In: Carbone, M., Lanese, I., Silva, A., Sokolova, A. (eds.) ICE 2012. EPTCS, vol. 104, pp. 99–113 (2012)Google Scholar
  17. 17.
    Schwoon, S.: Model-Checking Pushdown Systems. PhD thesis, Technische Universität München (2002)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2013

Authors and Affiliations

  • Irina Măriuca Asăvoae
    • 1
  • Frank de Boer
    • 2
    • 3
  • Marcello M. Bonsangue
    • 3
    • 2
  • Dorel Lucanu
    • 1
  • Jurriaan Rot
    • 3
    • 2
  1. 1.Faculty of Computer ScienceAlexandru Ioan Cuza UniversityRomania
  2. 2.Centrum voor Wiskunde en InformaticaThe Netherlands
  3. 3.LIACS — Leiden UniversityThe Netherlands

Personalised recommendations