Model checking TLR* guarantee formulas on infinite systems
From MaRDI portal
Recommendations
Cites work
- A rewriting-based model checker for the linear temporal logic of rewriting
- A survey of rewriting strategies in program transformation systems
- Abstract logical model checking of infinite-state systems using narrowing
- Algebraic laws for nondeterminism and concurrency
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Conditional rewriting logic as a unified model of concurrency
- ELAN from a rewriting logic point of view
- Equational abstractions
- Model checking LTLR formulas under localized fairness
- Semantic foundations for generalized rewrite theories
- Symbolic Model Checking of Infinite-State Systems Using Narrowing
- The Linear Temporal Logic of Rewriting Maude Model Checker
- Well-structured transition systems everywhere!
Cited in
(5)
This page was built for publication: Model checking TLR* guarantee formulas on infinite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403070)