Sciweavers

446 search results - page 55 / 90
» A Theorem Prover for a Computational Logic
Sort
View
LICS
2008
IEEE
15 years 4 months ago
Mechanizing the Metatheory of LF
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as p...
Christian Urban, James Cheney, Stefan Berghofer
ECAI
2006
Springer
15 years 1 months ago
Verification of Medical Guidelines Using Task Execution with Background Knowledge
Abstract. The use of a medical guideline can be seen as the execution of computational tasks, sequentially or in parallel, in the face of patient data. It has been shown that many ...
Arjen Hommersom, Perry Groot, Peter J. F. Lucas, M...
APLAS
2005
ACM
14 years 11 months ago
Loop Invariants on Demand
This paper describes a sound technique that combines the precision em proving with the loop-invariant inference of abstract interpretation. The loop-invariant computations are invo...
K. Rustan M. Leino, Francesco Logozzo
MICS
2010
81views more  MICS 2010»
14 years 8 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
POPL
2012
ACM
13 years 5 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...