Sciweavers

1411 search results - page 14 / 283
» Interactive Coding for Interactive Proofs
Sort
View
86
Voted
SAT
2010
Springer
125views Hardware» more  SAT 2010»
15 years 1 months ago
Two Techniques for Minimizing Resolution Proofs
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
Scott Cotton
ENTCS
2008
94views more  ENTCS 2008»
14 years 9 months ago
A Formal Model of Memory Peculiarities for the Verification of Low-Level Operating-System Code
This paper presents our solutions to some problems we encountered in an ongoing attempt to verify the micro-hypervisor currently developed within the Robin project. The problems t...
Hendrik Tews, Tjark Weber, Marcus Völp
APSEC
2005
IEEE
15 years 3 months ago
Tool Support for Invariant Based Programming
— Invariant based programming is an approach to program construction where we provide the program pre- and postconditions as well as loop invariants before we construct the code ...
Ralph-Johan Back, Magnus Myreen
CASSIS
2005
Springer
15 years 3 months ago
Modular Proof Principles for Parameterised Concretizations
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
David Pichardie
JAR
2008
95views more  JAR 2008»
14 years 9 months ago
On the Mechanization of the Proof of Hessenberg's Theorem in Coherent Logic
Abstract. We propose to combine interactive proof construction with proof automation for a fragment of first-order logic called Coherent Logic (CL). CL allows enough existential qu...
Marc Bezem, Dimitri Hendriks