Automatic proofs by induction in theories without constructors
Information and Computation
Tools for proving inductive equalities, relative completeness, and &ohgr;-completeness
Information and Computation
On ground-confluence of term rewriting systems
Information and Computation
Sufficient-completeness, ground-reducibility and their complexity
Acta Informatica
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Testing for the ground (co-)reducibility property in term-rewriting systems
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Using induction and rewriting to verify and complete parameterized specifications
Theoretical Computer Science
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
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
Proving Ground Confluence and Inductive Validity in Constructor Based Equational Specifications
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A decidability result about sufficient-completeness of axiomatically specified abstract data types
Proceedings of the 6th GI-Conference on Theoretical Computer Science
An Effective Method for Handling Initial Algebras
Proceedings of the International Workshop on Algebraic and Logic Programming
Sufficient Completness, Term Rewriting Systems and "Anti-Unification"
Proceedings of the 8th International Conference on Automated Deduction
Ordered Rewriting and Confluence
Proceedings of the 10th International Conference on Automated Deduction
The specification and application to programming of abstract data types.
The specification and application to programming of abstract data types.
On using ground joinable equations in equational theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
Ground reducibility is EXPTIME-complete
Information and Computation
Computing constructor forms with non terminating rewrite programs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
Proofs by induction in equational theories with constructors
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Automated Induction with Constrained Tree Automata
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Simultaneous checking of completeness and ground confluence for algebraic specifications
ACM Transactions on Computational Logic (TOCL)
Decision procedures for equationally based reasoning
Decision procedures for equationally based reasoning
On the completeness of context-sensitive order-sorted specifications
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
A sufficient completeness reasoning tool for partial specifications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
RTA'06 Proceedings of the 17th international conference on Term Rewriting and 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
Hi-index | 0.00 |
Sufficient completeness has been throughly studied for equational specifications, where function symbols are classified into constructors and defined symbols. But what should sufficient completeness mean for a rewrite theory R = (Σ, E, R) with equations E and nonequational rules R describing concurrent transitions in a system? This work argues that a rewrite theory naturally has two notions of constructor: the usual one for its equations E, and a different one for its rules R. The sufficient completeness of constructors for the rules R turns out to be intimately related with deadlock freedom, i.e., R has no deadlocks outside the constructors for R. The relation between these two notions is studied in the setting of unconditional order-sorted rewrite theories. Sufficient conditions are given allowing the automatic checking of sufficient completeness, deadlock freedom, and other related properties, by propositional tree automata modulo equational axioms such as associativity, commutativity, and identity. They are used to extend the Maude Sufficient Completeness Checker from the checking of equational theories to that of both equational and rewrite theories. Finally, the usefulness of the proposed notion of constructors in proving inductive theorems about the reachability rewrite relation →R associated to a rewrite theory R (and also about the joinability relation ↓R) is both characterized and illustrated with an example.