The maude LTL model checker

Electronic Notes in Theoretical Computer Science

Volumn 71, Issue , 2004, Pages 162-187

  Eker, Steven ^a   Meseguer, José ^b   Sridharanarayanan, Ambarish ^b  

^a SRI INTERNATIONAL   (United States)

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

Author keywords

Concurrent systems; Maude; Model checking

Indexed keywords

COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES; MATHEMATICAL MODELS; MOLECULAR BIOLOGY; NETWORK PROTOCOLS; SEMANTICS; THEOREM PROVING;

CONCURRENT SYSTEMS; MAUDE; MODEL CHECKING; REWRITING LOGIC MODELS;

COMPUTER SCIENCE;

EID: 19044397906     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82534-4     Document Type: Conference Paper

References (25)

1. Spin - Formal Verification. 2002.
2. Clarke E.M., Grumberg O., Peled D.A. Model Checking. 2001;MIT Press
3. Clavel M., Durán F., Eker S., Lincoln P., Martí-Oliet N., Meseguer J., Quesada J. Maude: specification and programming in rewriting logic. SRI International. January 1999;. http://maude.cs.uiuc.edu/
4. Cohn P.M. Universal Algebra. Harper & Row. 1965
5. Dolev D., Klawe M., Rodeh M. An O(n log n) unidirectional algorithm for extrema finding in a circle. Journal of Algorithms. 3:1982;245-260
6. Eker S., Knapp M., Laderoute K. Lincoln, P. Talcott, C.L. Pathway logic: Executable models of biological networks. This volume.
7. Eker S., Knapp M., Laderoute K., Lincoln P., Meseguer J., Sonmez K. Pathway logic: Symbolic analysis of biological signaling. Proceedings of the Pacific Symposium on Biocomputing. January 2002;400-412. http://www.csl.sri.com/ papers/lincoln-pathway-logic-psb-2002/.
8. Etessami K., Holzmann G.J. Optimizing Büchi automata. Eleventh International Conference on Concurrency Theory (CONCUR 2000), number 1877 in LNCS. 2000;153-167 Springer-Verlag
9. Gastin P., Oddoux D. Fast LTL to Büchi automata translation. Thirteenth Conference on Computer Aided Verification (CAV ′01), number 2102 in LNCS. 2001;53-65 Springer-Verlag
10. Gerth R. Concise Promela Reference. 1997.
11. Gerth R., Peled D., Vardi M., Wolper P. Simple on-the-fly automatic verification of linear temporal logic. Protocol Specification Testing and Verification. 1995;3-18 Chapman & Hall, Warsaw, Poland
12. Holzmann G.J., Peled D., Yannakakis M. On nested depth-first search. Proc. Second SPIN Workshop, August 1996, Vol. 32 of Dimacs Series in Discrete Mathematics and Theoretical Computer Science. 1997;81-89 American Mathematical Society, Rutgers, Piscataway, NJ
13. Yannakakis G, Holzmann J., Peled D.M. On nested depth first search. Design: An International Journal. 13:(3):1992;289-307. nov 1998
14. Manna Z. Pnueli A. The Temporal Logic of Reactive Systems. 1992 Springer-Verlag
15. Martí-Oliet N., Meseguer J. Rewriting logic as a logical and semantic framework. Technical Report SRI-CSL-93-05, SRI International, Computer Science Laboratory. Gabbay D. To appear in Handbook of Philosophical Logic. August 1993;Kluwer Academic Publishers.
16. Meseguer J., Talcott C. Semantic models for distributed object reflection. Proceedings of ECOOP′02, Málaga, Spain, June 2002. 2002;1-36. Springer LNCS 2374
17. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science. 96:(1):1992;73-155
18. Meseguer J. Membership algebra as a logical framework for equational specification. Parisi-Presicce F. Proc. WADT′97. 1998;18-61 Springer LNCS 1376
19. Meseguer J. Research directions in rewriting logic. Berger U., Schwichtenberg H. Computational Logic, NATO Advanced Study Institute, Marktoberdorf Germany, July 29 - August 6, 1997. 1999;347-398 Springer-Verlag
20. Orava F., Parrow J. An algebraic verification of a mobile network. Formal Aspects of Computing. 4:(6):1992;497-543
21. Peterson G.L. Myths about the mutual exclusion problem. Information Processing Letters. 12:(3):1981;115-116. jun
22. Shankar N. Symbolic analysis of transition systems. Gurevich Y., Kutter Ph.W., Odersky M., Thiele L. Abstract State Machines: Theory and Applications (ASM 2000), number 1912 in Lecture Notes in Computer Science. mar 2000;287-302 Monte Verita, Switzerland Springer-Verlag. http://www.csl.sri.com/papers/ asm2000/
23. Somenzi F.R., Bloem R. Efficient Büchi automata from LTL formulae. Twelfth Conference on Computer Aided Verification (CAV ′00), number 1633 in LNCS. 2000;247-263 Springer-Verlag
24. M.-O. Stehr and C. L. Talcott. Plan in Maude - specifying an active network programming language. This volume.
25. Viry P. Rewriting: An effective model of concurrency. Halatsis, et al. PARLE′94, Proc. Sixth Int. Conf. on Parallel Architectures and Languages Europe, Athens, Greece, July 1994, volume 817 of LNCS. 1994;648-660 Springer-Verlag