Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A logical theory of concurrent objects and its realization in the Maude language
Research directions in concurrent object-oriented programming
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
Advanced topics in term rewriting
Advanced topics in term rewriting
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
On Conditional Rewrite Systems with Extra Variables and Deterministic Logic Programs
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
The Extensibility of Maude's Module Algebra
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Dependency Pairs for Equational Rewriting
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
Science of Computer Programming
MTT: The Maude Termination Tool (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
A Guide to Extending Full Maude Illustrated with the Implementation of Real-Time Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Variant Narrowing and Equational Unification
Electronic Notes in Theoretical Computer Science (ENTCS)
The maude formal tool environment
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Termination modulo combinations of equational theories
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
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
The finite variant property: how to get rid of some algebraic properties
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
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
Tool interoperability in the Maude formal environment
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Towards a Maude formal environment
Formal modeling
Backward trace slicing for conditional rewrite theories
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A rule-based framework for building superposition-based decision procedures
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
Asymmetric unification: a new unification paradigm for cryptographic protocol analysis
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Using conditional trace slicing for improving Maude programs
Science of Computer Programming
Hi-index | 0.02 |
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E modulo A. The correctness of many important formal verification tasks, including search, LTL model checking, and the development of abstractions, crucially depends on the theory being ground coherent. Furthermore, many specifications of interest are typed, have equations E and rules R that are both conditional, have axioms A involving various combinations of associativity, commutativity and identity, and may contain frozenness restrictions. This makes it essential to extend the known coherence checking methods from the untyped, unconditional, and AC or free case, to this much more general setting. We present the mathematical foundations of the Maude ChC 3 tool, which provide such a generalization to support coherence and ground coherence checking for order-sorted rewrite theories under these general assumptions. We also explain and illustrate the use of the ChC 3 tool with a nontrivial example.