Download:
|
by Alessandro Armando, Silvio Ranise
http://www.mrg.dist.unige.it/~silvio/docs/ftp98.ps.gz
Add To MetaCart
Abstract:
We are interested in the problem of integrating decision procedures with rewriting as in many state-of-the-art verication systems. We dene Constraint Contextual Rewriting (CCR) as a generalization of contextual rewriting, whereby the rewriting context is processed by the available decision procedures. We show how CCR accounts for some of the most important integration schemas adopted in state-of-the-art veri cation systems. The rule-based presentation of CCR given in this paper contrasts the practice of describing the integration either by examples or in informal ways with high-level ideas intermixed with implementation details. Important properties (e.g. soundness) of the proposed integration schema can be formally stated and proved. Moreover, the approach is amenable of operationalization. This has allowed us to easily fast-prototype and validate the integration schemas described in this paper. 1
Citations
|
491
|
A Computational Logic
– Boyer, Moore
|
|
270
|
Simplification by cooperating decision procedures
– Nelson, Oppen
- 1979
|
|
133
|
Deciding combinations of theories
– Shostak
- 1984
|
|
104
|
Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic
– Boyer, Moore
- 1988
|
|
52
|
Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems
– Giunchiglia, Pecchiari, et al.
- 1994
|
|
52
|
PVS: A prototype veri system
– Owre, Rushby, et al.
- 1992
|
|
26
|
A proof theoretic view of constraint programming
– Apt
- 1998
|
|
18
|
Reasoning about numbers in Tecton
– Kapur, Nie
- 1994
|
|
14
|
An overview of the Tecton proof system
– Kapur, Musser, et al.
- 1994
|
|
9
|
SoleX: a Domain-Independent Scheme for Constraint Solver Extension
– Monfroy, Ringeissen
- 1998
|
|
9
|
Contextual rewriting in automated reasoning
– Zhang
- 1995
|
|
8
|
STeP: The Stanford Temporal Prover
– al
- 1994
|
|
4
|
Constraint solving in logic programming and in automated deduction: a comparison
– Armando, Melis, et al.
- 1998
|
|
4
|
A Logic Level Speci of the NQTHM Simpli Process
– Coglio, Giunchiglia, et al.
- 1997
|
|
2
|
Building Constraint Solvers Using Rewrite Rules and Strategies. Submitted for publication. Preliminar version available at http://www.loria.fr/- ~castro/PAPERS/publications.html
– Castro
- 1998
|
