Sciweavers

12774 search results - page 21 / 2555
» A Framework for Proof Systems
Sort
View
TCS
2008
15 years 5 months ago
Integration of a security type system into a program logic
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...
Reiner Hähnle, Jing Pan, Philipp Rümmer,...
TABLEAUX
1998
Springer
15 years 10 months ago
Deleting Redundancy in Proof Reconstruction
We present a framework for eliminating redundancies during the reconstruction of sequent proofs from matrix proofs. We show that search-free proof reconstruction requires knowledge...
Stephan Schmitt, Christoph Kreitz
TACAS
2000
Springer
149views Algorithms» more  TACAS 2000»
15 years 9 months ago
Proof General: A Generic Tool for Proof Development
This note describes Proof General, a tool for developing machine proofs with an interactive proof assistant. Interaction is based around a proof script, which is the target of a pr...
David Aspinall
AMAI
2005
Springer
15 years 5 months ago
Resolution cannot polynomially simulate compressed-BFS
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
DoRon B. Motter, Jarrod A. Roy, Igor L. Markov
IFM
2005
Springer
15 years 11 months ago
A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...
Héctor Ruíz Barradas, Didier Bert