13383 search results - page 31 / 2677 » Abstractions from proofs |
JFPLC
2004
13 years 11 months ago
2004
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
TLCA
1997
Springer
14 years 2 months ago
1997
Springer
S TECHNICAL REPORT ABSTRACTS
TABLEAUX
1995
Springer
14 years 1 months ago
1995
Springer
We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof...
FSTTCS
2010
Springer
13 years 8 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
PROVSEC
2007
Springer
14 years 4 months ago
2007
Springer
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...