Parallel program design: a foundation
Parallel program design: a foundation
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Model checking
Equational rules for rewriting logic
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
Incremental Construction of Unification Algorithms in Equational Theories
Proceedings of the 10th Colloquium on Automata, Languages and Programming
A Technique for Invariant Generation
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
Theoretical Computer Science
Decision procedures for equationally based reasoning
Decision procedures for equationally based reasoning
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
Combining theorem proving and narrowing for rewriting-logic specifications
TAP'10 Proceedings of the 4th international conference on Tests and proofs
A Church-Rosser checker tool for conditional order-sorted equational Maude specifications
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
State space reduction of rewrite theories using invisible transitions
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Order-Sorted equality enrichments modulo axioms
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
State space c-reductions of concurrent systems in rewriting logic
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
| Hi-index | 0.00 |
Rewrite theories are a general and expressive formalism for specifying concurrent systems in which states are axiomatized by equations and transitions among states are axiomatized by rewrite rules. We present a deductive approach for verifying safety properties of rewrite theories in which all formal temporal reasoning about concurrent transitions is ultimately reduced to purely equational inductive reasoning. Narrowing modulo axioms is extensively used in our inference system to further simplify the equational proof obligations to which all proofs of safety formulas are ultimately reduced. In this way, existing equational reasoning techniques and tools can be directly applied to verify safety properties of concurrent systems. We report on the implementation of this deductive system in the Maude Invariant Analyzer tool, which provides a substantial degree of automation and can automatically discharge many proof obligations without user intervention.