A sufficient completeness checker for linear order-sorted specifications modulo axioms

Authors:
Joe Hendrix;José Meseguer;Hitoshi Ohsaki
Affiliations:
University of Illinois at Urbana-Champaign;University of Illinois at Urbana-Champaign;National Institute of Advanced Industrial Science and Technology
Venue:
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Year:
2006

Citing 6
Cited 13

Sufficient-completeness, ground-reducibility and their complexity

Acta Informatica
Equational rules for rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Decidability and Closure Properties of Equational Tree Languages

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Ground reducibility is EXPTIME-complete

Information and Computation
A sufficient completeness reasoning tool for partial specifications

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications

Maude's module algebra

Science of Computer Programming
Equational abstractions

Theoretical Computer Science
Languages Modulo Normalization

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Combining Equational Tree Automata over AC and ACI Theories

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
A fold/unfold transformation framework for rewrite theories extended to CCT

Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
The maude formal tool environment

CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
On the completeness of context-sensitive order-sorted specifications

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Order-sorted parameterization and induction

Semantics and algebraic specification
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
Enhancing the debugging of Maude specifications

WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Incremental checking of well-founded recursive specifications modulo axioms

Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Towards a Maude formal environment

Formal modeling
Coverset induction with partiality and subsorts: a powerlist case study

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a tool for checking the sufficient completeness of left-linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this problem as an equational tree automata decision problem using the tree automata library CETA, which we also introduce in this paper. CETA implements a semi-algorithm for checking the emptiness of a class of tree automata that are closed under Boolean operations and an equational theory containing associativity, commutativity and identity axioms. Though sufficient completeness for this class of specifications is undecidable in general, our tool is a decision procedure for subcases known to be decidable, and has specialized techniques that are effective in practice for the general case.