207 search results - page 10 / 42 » Proof Systems and Transformation Games |
CSL
2007
Springer
15 years 3 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
CAV
2012
Springer
13 years 2 days ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
82
Voted
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
We provide in this article two characterisation results, describing exactly which terms verify the dinaturality diagram, in Church-style system F and in Curry-style system F. The ...
JAR
2006
14 years 9 months ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
110
click to vote
FOCS
1999
IEEE
15 years 1 months ago
1999
IEEE
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...