Sciweavers

989 search results - page 79 / 198
» Pebbling and Proofs of Work
Sort
View
IFM
2005
Springer
100views Formal Methods» more  IFM 2005»
14 years 1 months ago
Embedding the Stable Failures Model of CSP in PVS
We present an embedding of the stable failures model of CSP in the PVS theorem prover. Our work, extending a previous embedding of the traces model of CSP in [6], provides a platfo...
Kun Wei, James Heather
ITRUST
2005
Springer
14 years 1 months ago
IWTrust: Improving User Trust in Answers from the Web
Abstract. Question answering systems users may find answers without any supporting information insufficient for determining trust levels. Once those question answering systems beg...
Ilya Zaihrayeu, Paulo Pinheiro da Silva, Deborah L...
IFM
2004
Springer
14 years 1 months ago
Verifying Controlled Components
Recent work on combining CSP and B has provided ways of describing systems comprised of components described in both B (to express requirements on state) and CSP (to express intera...
Steve Schneider, Helen Treharne
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
14 years 1 months ago
A new multilayered PCP and the hardness of hypergraph vertex cover
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
Irit Dinur, Venkatesan Guruswami, Subhash Khot, Od...
CAV
2000
Springer
97views Hardware» more  CAV 2000»
14 years 16 days ago
Detecting Errors Before Reaching Them
Abstract. Any formalmethodor tool is almostcertainlymoreoftenapplied in situationswheretheoutcomeis failure(acounterexample)rather than success (a correctness proof). We present a ...
Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. ...