Proof by induction using test sets
Proc. of the 8th international conference on Automated deduction
Sufficient completeness, term rewriting systems and “anti-unification”
Proc. of the 8th international conference on Automated deduction
Automatic proofs by induction in theories without constructors
Information and Computation
Tools for proving inductive equalities, relative completeness, and &ohgr;-completeness
Information and Computation
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
A meta-environment for generating programming environments
ACM Transactions on Software Engineering and Methodology (TOSEM)
Using induction and rewriting to verify and complete parameterized specifications
Theoretical Computer Science
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Completeness in Data Type Specifications
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
A decidability result about sufficient-completeness of axiomatically specified abstract data types
Proceedings of the 6th GI-Conference on Theoretical Computer Science
Encompassment Properties and Automata with Constraints
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Ground Reducibility is EXPTIME-complete
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
A pattern matching compiler for multiple target languages
CC'03 Proceedings of the 12th international conference on Compiler construction
A proof of weak termination providing the right way to terminate
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Rewriting-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
Constructors, sufficient completeness, and deadlock freedom of rewrite theories
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
Modular access control via strategic rewriting
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
| Hi-index | 0.00 |
In the context of the study of rule-based programming, we focus in this paper on the property of C-reducibility, expressing that every term reduces to a constructor term on at least one of its rewriting derivations. This property implies completeness of function definitions, and enables to stop evaluations of a program on a constructor form, even if the program is not terminating. We propose an inductive procedure proving C-reducibility of rewriting. The rewriting relation on ground terms is simulated through an abstraction mechanism and narrowing. The induction hypothesis allows assuming that terms smaller than the starting terms rewrite into a constructor term. The existence of the induction ordering is checked during the proof process, by ensuring satisfiability of ordering constraints. The proof is constructive, in the sense that the branch leading to a constructor term can be computed from the proof trees establishing C-reducibility for every term