Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Logical foundations of cafeOBJ
Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Chocolat/SMV: A Translator from CafeOBJ into SMV
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
A Lightweight Integration of Theorem Proving and Model Checking for System Verification
APSEC '05 Proceedings of the 12th Asia-Pacific Software Engineering Conference
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
Verifying Specifications with Proof Scores in CafeOBJ
ASE '06 Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering
A rewriting-based inference system for the NRL Protocol analyzer and its meta-logical properties
Theoretical Computer Science - Automated reasoning for security protocol analysis
The rewriting logic semantics project
Theoretical Computer Science
Higher-Order and Symbolic Computation
The Temporal Logic of Rewriting: A Gentle Introduction
Concurrency, Graphs and Models
State Machines as Inductive Types
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Variant Narrowing and Equational Unification
Electronic Notes in Theoretical Computer Science (ENTCS)
Unification and Narrowing in Maude 2.4
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Symbolic model checking of infinite-state systems using narrowing
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Proving safety properties of rewrite theories
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Embedding domain-specific modelling languages in Maude specifications
Software and Systems Modeling (SoSyM)
| Hi-index | 0.00 |
We present an approach for verifying dynamic systems specified in rewriting logic, a formal specification language implemented in the Maude system. Our approach is tailored for invariants, i.e., properties that hold on all states reachable from a given class of initial states. The approach consists in encoding invariance properties into inductive properties written in membership equational logic, a sublogic of rewriting logic also implemented in Maude. The invariants can then be verified using an inductive theorem prover available for membership equational logic, possibly in interaction with narrowing-based symbolic analysis tools for rewriting-logic specifications also available in the Maude environment. We show that it is possible, and useful, to automatically test invariants by symbolic analysis before interactively proving them.