Sciweavers

1284 search results - page 27 / 257
» On Helping and Interactive Proof Systems
Sort
View
LICS
2010
IEEE
13 years 6 months ago
Breaking Paths in Atomic Flows for Classical Logic
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
Alessio Guglielmi, Tom Gundersen, Lutz Straß...
FROCOS
2009
Springer
14 years 2 months ago
Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
In an attempt to improve automation capabilities in the Coq proof assistant, we develop a tactic for the propositional fragment based on the DPLL procedure. Although formulas natur...
Stéphane Lescuyer, Sylvain Conchon
FLAIRS
2000
13 years 9 months ago
A Case Study in the Mechanical Verification of Fault Tolerance
To date, there is little evidence that modular reasoning about fault-tolerant systems can simplify the verification process in practice. We study this question using a prominent e...
Heiko Mantel, Felix C. Gärtner
ICSE
2009
IEEE-ACM
13 years 5 months ago
VCC: Contract-based modular verification of concurrent C
Most system level software is written in C and executed concurrently. Because such software is often critical for system reliability, it is an ideal target for formal verification...
Markus Dahlweid, Michal Moskal, Thomas Santen, Ste...
ECIR
2004
Springer
13 years 9 months ago
A Study of User Interaction with a Concept-Based Interactive Query Expansion Support Tool
A medium-scale user study was carried out to investigate the usability of a concept-based query expansion support tool. The tool was fully integrated into the interface of an IR sy...
Hideo Joho, Mark Sanderson, Micheline Beaulieu