Symbolic model checking of infinite-state systems using narrowing

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

Volumn 4533 LNCS, Issue , 2007, Pages 153-168

  Escobar, Santiago ^a   Meseguer, José ^b  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA STRUCTURES; MODEL CHECKING;

MODEL CHECK SYSTEMS; SYMBOLIC SYSTEM;

CODES (SYMBOLS);

EID: 38049123677     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73449-9_13     Document Type: Conference Paper

References (33)

1. Alpuente, M., Falaschi, M., Vidal, G.: Partial Evaluation of Functional Logic Programs. ACM TOPLAS 20(4), 768-844 (1998)
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)
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)
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)
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)
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)
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)
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., Marti-Oliet, N., Meseguer, J., Talcott, C.: All About Maude: A High-Performance Logical Framework. Springer, Heidelberg (To appear 2007)
11. Delzanno, G.: Constraint multiset rewriting. Technical report, DISI - Universita 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)
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)
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)
18. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science 256(1), 63-92 (2001)
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)
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)
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)
23. Marti-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)
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)
25. Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96(1), 73-155 (1992)
26. Meseguer, J.: Multiparadigm logic programming. In: Kirchner, H., Levi, G. (eds.) ALP'92. LNCS, vol. 632, pp. 158-200. Springer, Heidelberg (1992)
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)
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., Marti-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)
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)
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)