Proc. of the first international conference on Rewriting techniques and applications
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Handbook of logic in computer science (vol. 2)
On Fourier's algorithm for linear arithmetic constraints
Journal of Automated Reasoning
An overview of the Tecton proof system
Theoretical Computer Science - Special issue on formal methods in databases and software engineering
An Industrial Strength Theorem Prover for a Logic Based on Common Lisp
IEEE Transactions on Software Engineering
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Deciding Combinations of Theories
Journal of the ACM (JACM)
Maple's evaluation process as constraint contextual rewriting
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Handbook of Theoretical Computer Science
Handbook of Theoretical Computer Science
SoleX: A Domain-Independent Scheme for Constraint Solver Extension
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
On Shostak's Decision Procedure for Combinations of Theories
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A Practical Integration of First-Order Reasoning and Decision Procedures
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
System Description: RDL : Rewrite and Decision Procedure Laboratory
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems
Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems
STeP: The Stanford Temporal Prover
STeP: The Stanford Temporal Prover
Simplification by cooperating decision procedures
Simplification by cooperating decision procedures
Contextual Rewriting In Automated Reasoning
Fundamenta Informaticae
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
An Even Closer Integration of Linear Arithmetic into Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
A reconstruction and extension of Maple's assume facility via constraint contextual rewriting
Journal of Symbolic Computation
Small formulas for large programs: on-line constraint simplification in scalable static analysis
SAS'10 Proceedings of the 17th international conference on Static analysis
| Hi-index | 0.00 |
The effective integration of decision procedures in formula simplification is a fundamental problem in mechanical verification. In this paper we address the problem by proposing a general pattern of interaction between rewriting and decision procedures and by providing an account of such a pattern of interaction which is precise and concise at the same time. The first step amounts to a generalization of contextual rewriting which allows the available decision procedure to access and manipulate the rewriting context. We call this generalized form of contextual rewriting constraint contextual rewriting (CCR for short). The second step amounts to providing a rule-based presentation of CCR which is modular, declarative, and formal at the same time. This allows us to give a rigorous account of CCR and to formally state and prove its soundness and termination.