491 search results - page 36 / 99 » An Interpolating Theorem Prover |
LPNMR
2005
Springer
14 years 2 months ago
2005
Springer
In this work we describe a system for determining strong equivalence of disjunctive non-ground datalog programs under the stable model semantics. The problem is tackled by reducing...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We describe an extension to the TLA+ specification language with constructs for writing proofs and a proof environment, called the Proof Manager (PM), to checks those proofs. The ...
ESORICS
2002
Springer
14 years 8 months ago
2002
Springer
We introduce the ISM approach, a framework for modeling and verifying reactive systems in a formal, even machine-checked, way. The framework has been developed for applications in ...
TPHOL
2000
IEEE
14 years 9 days ago
2000
IEEE
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
ITP
2010
14 years 19 days ago
2010
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...