Article

Symbolic model checking of infinite-state systems using narrowing

Authors:

Santiago Escobar,

José MeseguerAuthors Info & Claims

RTA'07: Proceedings of the 18th international conference on Term rewriting and applications

Pages 153 - 168

Published: 26 June 2007 Publication History

Abstract

Rewriting is a general and expressive way of specifying concurrent systems, where concurrent transitions are axiomatized by rewrite rules. Narrowing is a complete symbolic method for model checking reachability properties. We show that this method can be reinterpreted as a lifting simulation relating the original system and the symbolic system associated to the narrowing transitions. Since the narrowing graph can be infinite, this lifting simulation only gives us a semi-decision procedure for the failure of invariants. However, we propose new methods for folding the narrowing tree that can in practice result in finite systems that symbolically simulate the original system and can be used to algorithmically verify its properties. We also show how both narrowing and folding can be used to symbolically model check systems which, in addition, have state predicates, and therefore correspond to Kripke structures on which ACTL* and LTL formulas can be algorithmically verified using such finite symbolic abstractions.

References

[1]

Alpuente, M., Falaschi, M., Vidal, G.: Partial Evaluation of Functional Logic Programs. ACM TOPLAS 20(4), 768-844 (1998).

Digital Library

[2]

Antoy, S., Ariola, Z.M.: Narrowing the narrowing space. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292, pp. 1-15. Springer, Heidelberg (1997).

Digital Library

[3]

Basu, S., Mukund, M., Ramakrishnan, C.R., Ramakrishnan, I.V., Verma, R.M.: Local and symbolic bisimulation using tabled constraint logic programming. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 166-180. Springer, Heidelberg (2001).

Digital Library

[4]

Bouajjani, A.: Languages, rewriting systems, and verification of infinite-state systems. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 24-39. Springer, Heidelberg (2001).

Digital Library

[5]

Bouajjani, A., Esparza, J.: Rewriting models of boolean programs. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 136-150. Springer, Heidelberg (2006).

Digital Library

[6]

Bouajjani, A., Mayr, R.: Model checking lossy vector addition systems. In: Meinel, C., Tison, S. (eds.) STACS 99. LNCS, vol. 1563, pp. 323-333. Springer, Heidelberg (1999).

Digital Library

[7]

Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification over Infinite States. In: Handbook of Process Algebra, pp. 545-623. Elsevier, Amsterdam (2001).

[8]

Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM TOPLAS 16(5), 1512-1542 (1994).

Digital Library

[9]

Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2001).

[10]

Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: All About Maude: A High-Performance Logical Framework. Springer, Heidelberg (To appear 2007).

Digital Library

[11]

Delzanno, G.: Constraint multiset rewriting. Technical report, DISI - Università di Genova (2002).

[12]

Delzanno, G., Podelski, A.: Constraint-based deductive model checking. STTT 3(3), 250-270 (2001).

[13]

Denker, G., Meseguer, J., Talcott, C.L.: Protocol specification and analysis in Maude. In: Proc. of Workshop on Formal Methods and Security Protocols (1998).

[14]

Emerson, A., Namjoshi, K.: On model checking for nondeterministic infinite state systems. In: LICS'98, pp. 70-80. IEEE Press, New York (1998).

Digital Library

[15]

Escobar, S., Meadows, C., Meseguer, J.: A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties. Theoretical Computer Science (Elsevier) 367(1-2), 162-202 (2006).

Digital Library

[16]

Escobar, S., Meseguer, J.: Symbolic model checking of infinite-state systems using narrowing. Technical Report No. 2814, Department of Computer Science, University of Illinois at Urbana-Champaign (2007).

[17]

Farzan, A., Meseguer, J.: State space reduction of rewrite theories using invisible transitions. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, pp. 142-157. Springer, Heidelberg (2006).

Digital Library

[18]

Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science 256(1), 63-92 (2001).

Digital Library

[19]

Genet, T., Viet Triem Tong, V.: Reachability analysis of term rewriting systems with Timbuk. In: ICLP'01. LNCS, vol. 2250, pp. 695-706. Springer, Heidelberg (2001).

Digital Library

[20]

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).

Digital Library

[21]

Kesten, Y., Pnueli, A.: Control and data abstraction: The cornerstones of practical formal verification. STTT 4(2), 328-342 (2000).

[22]

Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design 6, 1-36 (1995).

Digital Library

[23]

Martí-Oliet, N., Meseguer, J., Palomino, M.: Theoroidal maps as algebraic simulations. In: Fiadeiro, J.L., Mosses, P.D., Orejas, F. (eds.) WADT 2004. LNCS, vol. 3423, pp. 126-143. Springer, Heidelberg (2005).

Digital Library

[24]

Meseguer, J., Thati, P.: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. High-Order Symbolic Computation (To appear 2007).

Digital Library

[25]

Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96(1), 73-155 (1992).

Digital Library

[26]

Meseguer, J.: Multiparadigm logic programming. In: Kirchner, H., Levi, G. (eds.) ALP'92. LNCS, vol. 632, pp. 158-200. Springer, Heidelberg (1992).

Digital Library

[27]

Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18-61. Springer, Heidelberg (1998).

Digital Library

[28]

Meseguer, J.: The Temporal Logic of Rewriting. Technical Report No. 2815, Department of Computer Science, University of Illinois at Urbana-Champaign (2007).

[29]

Meseguer, J., Palomino, M., Martí-Oliet, N.: Equational abstractions. In: Baader, F. (ed.) Automated Deduction - CADE-19. LNCS (LNAI), vol. 2741, pp. 2-16. Springer, Heidelberg (2003).

[30]

Ohsaki, H., Seki, H., Takai, T.: Recognizing boolean closed A-tree languages with membership conditional mechanism. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 483-498. Springer, Heidelberg (2003).

Digital Library

[31]

Saïdi, H., Shankar, N.: Abstract and model check while you prove. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 443-454. Springer, Heidelberg (1999).

Digital Library

[32]

TeReSe, (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003).

[33]

Vardhan, A., Sen, K., Viswanathan, M., Agha, G.: Using language inference to verify omega-regular properties. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 45-60. Springer, Heidelberg (2005).

Digital Library

Cited By

Durán FEker SEscobar SMartí-Oliet NMeseguer JTalcott C(2016)Built-in Variant Generation and Unification, and Their Applications in Maude 2.7Proceedings of the 8th International Joint Conference on Automated Reasoning - Volume 970610.1007/978-3-319-40229-1_13(183-192)Online publication date: 27-Jun-2016
https://dl.acm.org/doi/10.1007/978-3-319-40229-1_13
Dandoush AAlouf SNain P(2014)Review ArticleComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2014.02.01564(243-260)Online publication date: 1-May-2014
https://dl.acm.org/doi/10.1016/j.comnet.2014.02.015
Nakaguro YDailey MMarukatat SMakhanov S(2013)Defeating line-noise CAPTCHAs with multiple quadratic snakesComputers and Security10.1016/j.cose.2013.05.00337(91-110)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.1016/j.cose.2013.05.003
Show More Cited By

Symbolic model checking of infinite-state systems using narrowing
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
  2. Software organization and properties
    1. Software functional properties
      1. Formal methods
2. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms
  2. Semantics and reasoning
    1. Program reasoning

Recommendations

Bounded model checking of infinite state systems

Bounded model checking (BMC) is an attractive alternative to symbolic model checking, since it often allows a more efficient verification. The idea of BMC is to reduce the model checking problem to a satisfiability problem of the underlying base logic, ...
Tabled resolution and constraints for model checking real-time systems and infinite-state systems
Bounded model checking of infinite state systems: exploiting the automata hierarchy
MEMOCODE '04: Proceedings of the Second ACM/IEEE International Conference on Formal Methods and Models for Co-Design

We present a new approach to bounded model checking that extends current methods in two ways: firstly, instead of a reduction to propositional logic, we choose a more powerful, yet decidable target logic, namely Presburger arithmetic. Secondly, instead ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

RTA'07: Proceedings of the 18th international conference on Term rewriting and applications

June 2007

419 pages

ISBN:3540734473

Editor:
Franz Baader
TU Dresden, Theoretical Computer Science, Dresden, Germany

Sponsors

ENSIEE: TheÉcole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise
CNAM: The Conservatoire des Arts et Métiers
The Region Île de France
CNRS: Centre National De La Rechercue Scientifique
The GDR Informatique Mathematique

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 26 June 2007

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
3
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Durán FEker SEscobar SMartí-Oliet NMeseguer JTalcott C(2016)Built-in Variant Generation and Unification, and Their Applications in Maude 2.7Proceedings of the 8th International Joint Conference on Automated Reasoning - Volume 970610.1007/978-3-319-40229-1_13(183-192)Online publication date: 27-Jun-2016
https://dl.acm.org/doi/10.1007/978-3-319-40229-1_13
Dandoush AAlouf SNain P(2014)Review ArticleComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2014.02.01564(243-260)Online publication date: 1-May-2014
https://dl.acm.org/doi/10.1016/j.comnet.2014.02.015
Nakaguro YDailey MMarukatat SMakhanov S(2013)Defeating line-noise CAPTCHAs with multiple quadratic snakesComputers and Security10.1016/j.cose.2013.05.00337(91-110)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.1016/j.cose.2013.05.003
Ciria JDomínguez EFrancés AQuintero A(2012)A plate-based definition of discrete surfacesPattern Recognition Letters10.1016/j.patrec.2011.11.01433:11(1485-1494)Online publication date: 1-Aug-2012
https://dl.acm.org/doi/10.1016/j.patrec.2011.11.014
Lagogiannis GLorentzos N(2012)Partially persistent B-trees with constant worst-case update timeComputers and Electrical Engineering10.1016/j.compeleceng.2011.12.00938:2(231-242)Online publication date: 1-Mar-2012
https://dl.acm.org/doi/10.1016/j.compeleceng.2011.12.009
Riesco A(2012)Using narrowing to test maude specificationsProceedings of the 9th international conference on Rewriting Logic and Its Applications10.1007/978-3-642-34005-5_11(201-220)Online publication date: 24-Mar-2012
https://dl.acm.org/doi/10.1007/978-3-642-34005-5_11
Héam PHugot VKouchnarenko O(2012)From linear temporal logic properties to rewrite propositionsProceedings of the 6th international joint conference on Automated Reasoning10.1007/978-3-642-31365-3_25(316-331)Online publication date: 26-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-31365-3_25
Meinke KNiu F(2011)Learning-based testing for reactive systems using term rewriting technologyProceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems10.5555/2075545.2075553(97-114)Online publication date: 7-Nov-2011
https://dl.acm.org/doi/10.5555/2075545.2075553
Rocha CMeseguer J(2011)Proving safety properties of rewrite theoriesProceedings of the 4th international conference on Algebra and coalgebra in computer science10.5555/2040096.2040120(314-328)Online publication date: 30-Aug-2011
https://dl.acm.org/doi/10.5555/2040096.2040120
Kasperski AZieliski P(2011)On the approximability of robust spanning tree problemsTheoretical Computer Science10.1016/j.tcs.2010.10.006412:4-5(365-374)Online publication date: 1-Feb-2011
https://dl.acm.org/doi/10.1016/j.tcs.2010.10.006
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten