Sciweavers

506 search results - page 1 / 102
» Where Is the Value in a Program Verifier
Sort
View
ICFEM
2005
Springer
13 years 10 months ago
Using Three-Valued Logic to Specify and Verify Algorithms of Computational Geometry
Many safety-critical systems deal with geometric objects. Reasoning about the correctness of such systems is mandatory and requires the use of basic definitions of geometry for th...
Jens Brandt, Klaus Schneider
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 5 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
KBSE
2008
IEEE
13 years 11 months ago
Program Analysis with Dynamic Precision Adjustment
We present and evaluate a framework and tool for combining multiple program analyses which allows the dynamic (on-line) adjustment of the precision of each analysis depending on t...
Dirk Beyer, Thomas A. Henzinger, Grégory Th...