Sciweavers

61 search results - page 7 / 13
» Testing, abstraction, theorem proving: better together!
Sort
View
ICCAD
2002
IEEE
142views Hardware» more  ICCAD 2002»
14 years 4 months ago
SAT and ATPG: Boolean engines for formal hardware verification
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
Armin Biere, Wolfgang Kunz
SIGECOM
2008
ACM
131views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
Truthful germs are contagious: a local to global characterization of truthfulness
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
Aaron Archer, Robert Kleinberg
FSTTCS
2003
Springer
14 years 21 days ago
A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol
We prove the Needham-Schroeder-Lowe public-key protocol secure under real, active cryptographic attacks including concurrent protocol runs. This proof is based on an abstract crypt...
Michael Backes, Birgit Pfitzmann
MKM
2007
Springer
14 years 1 months ago
A Rational Reconstruction of a System for Experimental Mathematics
Abstract. In previous papers we described the implementation of a system which combines mathematical object generation, transformation and filtering, conjecture generation, provin...
Jacques Carette, William M. Farmer, Volker Sorge
LPAR
2012
Springer
12 years 3 months ago
The TPTP Typed First-Order Form with Arithmetic
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Pe...