Sciweavers

1274 search results - page 27 / 255
» New Proofs for
Sort
View
RTA
2004
Springer
14 years 28 days ago
Automated Termination Proofs with AProVE
We describe the system AProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient al...
Jürgen Giesl, René Thiemann, Peter Sch...
AGP
2010
IEEE
14 years 20 days ago
Proof-Theoretic and Higher-Order Extensions of Logic Programming
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
Alberto Momigliano, Mario Ornaghi
QUESTA
2007
88views more  QUESTA 2007»
13 years 7 months ago
A simple proof for the constructions of optical priority queues
Constructions of optical queues by optical Switches and fiber Delay Lines (SDL) have received a lot of attention lately. In this short paper, we provide a simple proof for the co...
Hsien-Chen Chiu, Cheng-Shang Chang, Jay Cheng, Dua...
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
CSL
2005
Springer
14 years 1 months ago
A Propositional Proof System for Log Space
The proof system G∗ 0 of the quantified propositional calculus corresponds to NC1 , and G∗ 1 corresponds to P, but no formula-based proof system that corresponds log space rea...
Steven Perron