446 search results - page 11 / 90 » A Theorem Prover for a Computational Logic |
CADE
2001
Springer
15 years 10 months ago
2001
Springer
The STRIP system is a theorem prover for intuitionistic propositional logic with two main characteristics: it deals with the duplication of formulae during proof-search from a fine...
FMCAD
2007
Springer
15 years 3 months ago
2007
Springer
— Craig interpolants are often used to approximate inductive invariants of transition systems. Arithmetic relationships between numeric variables require word-level interpolants,...
TYPES
2004
Springer
15 years 2 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
111
click to vote
JAR
2008
14 years 9 months ago
2008
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...
CADE
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof ...