Sciweavers

1724 search results - page 117 / 345
» Models for Concurrency
Sort
View
ICCAD
1996
IEEE
127views Hardware» more  ICCAD 1996»
14 years 2 months ago
Comparing models of computation
We give a denotational framework (a "meta model") within which certain properties of models of computation can be understood and compared. It describes concurrent proces...
Edward A. Lee, Alberto L. Sangiovanni-Vincentelli
CRYPTO
2005
Springer
110views Cryptology» more  CRYPTO 2005»
14 years 3 months ago
Impossibility and Feasibility Results for Zero Knowledge with Public Keys
In this paper, we continue the study the round complexity of black-box zero knowledge in the bare public-key (BPK, for short) model previously started by Micali and Reyzin in [11]....
Joël Alwen, Giuseppe Persiano, Ivan Visconti
EDCC
2005
Springer
14 years 3 months ago
Efficient Single-Pattern Fault Simulation on Structurally Synthesized BDDs
Abstract. Current paper proposes an efficient alternative for traditional gatelevel fault simulation. The authors explain how Structurally Synthesized Binary Decision Diagrams (SSB...
Jaan Raik, Raimund Ubar, Sergei Devadze, Artur Jut...
SPIN
2000
Springer
14 years 1 months ago
Model Checking Based on Simultaneous Reachability Analysis
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
Bengi Karaçali, Kuo-Chung Tai
ICLP
1990
Springer
14 years 2 months ago
Kernel Andorra Prolog and its Computation Model
The logic programming language framework Kernel Andorra Prolog is de ned by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive langu...
Seif Haridi, Sverker Janson