Sciweavers

32 search results - page 4 / 7
» Proof Search and Proof Check for Equational and Inductive Th...
Sort
View
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
13 years 11 months ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
Ramesh Bharadwaj, Steve Sims
CL
2000
Springer
13 years 11 months ago
Certification of Compiler Optimizations Using Kleene Algebra with Tests
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...
Dexter Kozen, Maria-Christina Patron
MICS
2010
81views more  MICS 2010»
13 years 5 months ago
Tactics for Hierarchical Proof
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
David Aspinall, Ewen Denney, Christoph Lüth
29
Voted
IJCAI
1997
13 years 8 months ago
High Performance ATP Systems by Combining Several AI Methods
We present a design for an automated theorem prover that controls its search based on ideas from several areas of artificial intelligence (AI). The combination of case-based reaso...
Jörg Denzinger, Marc Fuchs, Matthias Fuchs
CSL
2005
Springer
14 years 1 months ago
Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
Frédéric Blanqui