Abstract
A model checker typically supports two different levels of specification: (1) a system specification level, in which the concurrent system to be analyzed is formalized; and (2) a property specification level, in which the properties to be model checked—for example, temporal logic formulae—are specified. The Maude LTL model checker has been designed with the goal of combining a very expressive and general system specification language (Maude [1]) with an advanced on-the-fly explicit-state LTL model checking engine.
The first two authors’ work has been partially supported by DARPA through Air Force Research Laboratory Contract F30602-97-C-0312, NSF grants CCR-9900326 and CCR-9900334, ONR Contract N00012-99-C-0198, and DARPA through Air Force Research Laboratory Contract F30602-02-C-0130. The last two authors’ work is also supported in part by the ONR Grant N00014-02-1-0715.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Clavel and et al. Maude: specification and programming in rewriting logic. Theoretical Computer Science, 285:187–243, August 2002.
Manuel Clavel and et al. Building equational proving tools by reflection in rewriting logic. In CAFE: An Industrial-Strength Algebraic Formal Method. Elsevier, 2000.
Steven Eker and et al. Pathway logic: Executable models of biological networks. In Proc. WRLA’02, volume 71 of ENTCS. Elsevier, 2002.
Steven Eker, José Meseguer, and Ambarish Sridharanarayanan. The Maude LTL model checker. In Proc. WRLA’ 02, volume 71 of ENTCS. Elsevier, 2002.
Kousha Etessami and Gerard J. Holzmann. Optimizing Büchi automata. In CONCUR 2000, number 1877 in LNCS, pages 153–167. Springer-Verlag, 2000.
Paul Gastin and Denis Oddoux. Fast LTL to Büchi automata translation. In CAV’ 01, number 2102 in LNCS, pages 53–65. Springer-Verlag, 2001.
Rob Gerth and et al. Simple on-the-fly automatic verification of linear temporal logic. In Protocol Specification Testing and Verification, pages 3–18. Chapman & Hall, 1995.
G. J. Holzmann, D. Peled, and M. Yannakakis. On nested depth first search. Design: An International Journal, 13(3):289–307, nov 1998.
José Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73–155, 1992.
F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In CAV’ 00, number 1633 in LNCS, pages 247–263. Springer-Verlag, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eker, S., Meseguer, J., Sridharanarayanan, A. (2003). The Maude LTL Model Checker and Its Implementation. In: Ball, T., Rajamani, S.K. (eds) Model Checking Software. SPIN 2003. Lecture Notes in Computer Science, vol 2648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44829-2_16
Download citation
DOI: https://doi.org/10.1007/3-540-44829-2_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40117-9
Online ISBN: 978-3-540-44829-7
eBook Packages: Springer Book Archive