Sciweavers

1274 search results - page 25 / 255
» New Proofs for
Sort
View
80
Voted
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 5 months ago
Relativized NP Search Problems and Propositional Proof Systems
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
Josh Buresh-Oppenheim, Tsuyoshi Morioka
SIGSOFT
2003
ACM
16 years 1 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
106
Voted
ITS
2004
Springer
153views Multimedia» more  ITS 2004»
15 years 5 months ago
Modeling Students' Reasoning About Qualitative Physics: Heuristics for Abductive Proof Search
Abstract. We describe a theorem prover that is used in the Why2Atlas tutoring system for the purposes of evaluating the correctness of a student’s essay and for guiding feedback ...
Maxim Makatchev, Pamela W. Jordan, Kurt VanLehn
EUROCRYPT
2008
Springer
15 years 2 months ago
Isolated Proofs of Knowledge and Isolated Zero Knowledge
We introduce a new notion called -isolated proofs of knowledge ( -IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to bits of communication wi...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
TCC
2007
Springer
91views Cryptology» more  TCC 2007»
15 years 6 months ago
Lower Bounds for Non-interactive Zero-Knowledge
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
Hoeteck Wee