Sciweavers

21 search results - page 3 / 5
» Verifying Properties Using Sequential ATPG
Sort
View
SIGSOFT
2007
ACM
14 years 9 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
EUROCRYPT
2009
Springer
14 years 9 months ago
On the Portability of Generalized Schnorr Proofs
The notion of Zero Knowledge Proofs (of knowledge) [ZKP] is central to cryptography; it provides a set of security properties that proved indispensable in concrete protocol design...
Jan Camenisch, Aggelos Kiayias, Moti Yung
KBSE
1997
IEEE
14 years 1 months ago
Modular Flow Analysis for Concurrent Software
Modern software systems are designed and implemented in a modular fashion by composing individual components. Early validation of individual module designs and implementations off...
Matthew B. Dwyer
ENTCS
2007
85views more  ENTCS 2007»
13 years 9 months ago
Stochastic Modelling of Communication Protocols from Source Code
A major development in qualitative model checking was the jump to verifying properties of source code directly, rather than requiring a separately specified model. We describe an...
Michael J. A. Smith
ICFP
2005
ACM
14 years 9 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao