The Maude LTL model checker and its implementation
From MaRDI portal
Recommendations
Cited in
(17)- Model checking parameterized by the semantics in Maude
- A complete semantics of \(\mathbb{K}\) and its translation to Isabelle
- Strategies, model checking and branching-time properties in Maude
- Proving VLRL action properties with the Maude model checker
- -calculus model checking in Maude
- The Maude LTL model checker
- Plan in Maude specifying an active network programming language
- Partial order reduction for rewriting semantics of programming languages
- Bringing LTL model checking to biologists
- Model checking reconfigurable Petri nets with Maude
- The Linear Temporal Logic of Rewriting Maude Model Checker
- A rewriting-based model checker for the linear temporal logic of rewriting
- Strategy-based proof calculus for membrane systems
- Backward trace slicing for rewriting logic theories
- Model checking TLR* guarantee formulas on infinite systems
- Towards an Efficient Implementation of Tree Automata Completion
- Strategies, Model Checking and Branching-Time Properties in Maude
This page was built for publication: The Maude LTL model checker and its implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4426386)