Sciweavers

446 search results - page 33 / 90
» A Theorem Prover for a Computational Logic
Sort
View
ENTCS
2008
90views more  ENTCS 2008»
15 years 1 months ago
Ensuring the Correctness of Lightweight Tactics for JavaCard Dynamic Logic
The interactive theorem prover developed in the KeY project, which implements a sequent calculus for JavaCard Dynamic Logic (JavaCardDL) is based on taclets. Taclets are lightweig...
Richard Bubel, Andreas Roth, Philipp Rümmer
CADE
2007
Springer
16 years 1 months ago
Encoding First Order Proofs in SAT
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
Todd Deshane, Wenjin Hu, Patty Jablonski, Hai Lin,...
106
Voted
CADE
2005
Springer
16 years 1 months ago
Nominal Techniques in Isabelle/HOL
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
Christian Urban, Christine Tasson
SAC
2010
ACM
14 years 11 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...
82
Voted
JFP
2008
67views more  JFP 2008»
15 years 1 months ago
Efficient execution in an automated reasoning environment
We describe a method that permits the user of a mechanized mathematical logic to write elegant logical definitions while allowing sound and efficient execution. In particular, the...
David A. Greve, Matt Kaufmann, Panagiotis Manolios...