Sciweavers

3228 search results - page 122 / 646
» Computationally Sound Proofs
Sort
View
ASM
2008
ASM
14 years 2 days ago
On the Purpose of Event-B Proof Obligations
Event-B is a formal modelling method which is claimed to be suitable for diverse modelling domains, such as reactive systems and sequential program development. This claim hinges o...
Stefan Hallerstede
FOCS
2004
IEEE
14 years 1 months ago
Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem
In this work we look back into the proof of the PCP Theorem, with the goal of finding new proofs that are "more combinatorial" and arguably simpler. For that we introduc...
Irit Dinur, Omer Reingold
ENTCS
2006
169views more  ENTCS 2006»
13 years 10 months ago
Constructing Induction Rules for Deductive Synthesis Proofs
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques D. Fl...
HIP
2005
Springer
208views Cryptology» more  HIP 2005»
14 years 3 months ago
Phish and HIPs: Human Interactive Proofs to Detect Phishing Attacks
In this paper, we propose a new class of Human Interactive Proofs (HIPs) that allow a human to distinguish one computer from another. Unlike traditional HIPs, where the computer is...
Rachna Dhamija, J. D. Tygar
ENTCS
2006
153views more  ENTCS 2006»
13 years 10 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu