Sciweavers

60 search results - page 2 / 12
» Compositional Proofs with Symbolic Execution
Sort
View
FASE
2012
Springer
12 years 3 months ago
Integration Testing of Software Product Lines Using Compositional Symbolic Execution
Software product lines are families of products defined by feature commonality and variability, with a well-managed asset base. Recent work in testing of software product lines ha...
Jiangfan Shi, Myra B. Cohen, Matthew B. Dwyer
CHARME
2001
Springer
162views Hardware» more  CHARME 2001»
13 years 11 months ago
Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system ba...
Kenneth L. McMillan
CAV
2001
Springer
87views Hardware» more  CAV 2001»
13 years 11 months ago
Microarchitecture Verification by Compositional Model Checking
Compositional model checking is used to verify a processor microarchitecture containing most of the features of a modern microprocessor, including branch prediction, speculative ex...
Ranjit Jhala, Kenneth L. McMillan
EUROCRYPT
1999
Springer
13 years 12 months ago
On the Concurrent Composition of Zero-Knowledge Proofs
We examine the concurrent composition of zero-knowledge proofs. By concurrent composition, we indicate a single prover that is involved in multiple, simultaneous zero-knowledge pro...
Ransom Richardson, Joe Kilian
ICNP
1998
IEEE
13 years 12 months ago
A Proof Technique for Liveness Properties of Multifunction Composite Protocols
In protocol composition techniques, component protocols are combined in various ways to obtain a complex protocol whose execution sequences consist of interleaved execution sequen...
J. Park, R. Miller