Sciweavers

501 search results - page 19 / 101
» Using Abstraction to Verify Arbitrary Temporal Properties
Sort
View
EUROCRYPT
2007
Springer
14 years 1 months ago
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
Yi Deng, Dongdai Lin
ICCAD
2000
IEEE
124views Hardware» more  ICCAD 2000»
14 years 2 months ago
A Methodology for Verifying Memory Access Protocols in Behavioral Synthesis
— Memory is one of the most important components to be optimized in the several phases of the synthesis process. ioral synthesis, a memory is viewed as an abstract construct whic...
Gernot Koch, Taewhan Kim, Reiner Genevriere
FMCAD
2008
Springer
13 years 11 months ago
Verifying an Arbiter Circuit
Abstract--This paper presents the verification of an asynchronous arbiter modeled at the circuit level with non-linear ordinary differential equations. We use Brockett's annul...
Chao Yan, Mark R. Greenstreet
CSFW
2006
IEEE
14 years 3 months ago
Cryptographically Sound Theorem Proving
We describe a faithful embedding of the Dolev-Yao model of Backes, Pfitzmann, and Waidner (CCS 2003) in the theorem prover Isabelle/HOL. This model is cryptographically sound in ...
Christoph Sprenger, Michael Backes, David A. Basin...
TPHOL
2007
IEEE
14 years 4 months ago
Verifying Nonlinear Real Formulas Via Sums of Squares
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
John Harrison