Sciweavers

608 search results - page 28 / 122
» Tests, Proofs and Refinements
Sort
View
CSFW
2007
IEEE
14 years 2 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
PROPERTYTESTING
2010
13 years 5 months ago
Short Locally Testable Codes and Proofs: A Survey in Two Parts
We survey known results regarding locally testable codes and locally testable proofs (known as PCPs), with emphasis on the length of these constructs. Local testability refers to a...
Oded Goldreich
LPAR
2005
Springer
14 years 1 months ago
Towards Automated Proof Support for Probabilistic Distributed Systems
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...
Annabelle McIver, Tjark Weber
COMGEO
2010
ACM
13 years 7 months ago
Approximate centerpoints with proofs
We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S Rd with running time subexponential in d. The alg...
Gary L. Miller, Donald Sheehy
DDECS
2009
IEEE
128views Hardware» more  DDECS 2009»
14 years 2 months ago
A fast untestability proof for SAT-based ATPG
—Automatic Test Pattern Generation (ATPG) based on Boolean satisfiability (SAT) has been shown to be a beneficial complement to traditional ATPG techniques. Boolean solvers wor...
Daniel Tille, Rolf Drechsler