Sciweavers

557 search results - page 52 / 112
» Automatic Abstraction for Verification of Timed Circuits and...
Sort
View
EUROPKI
2009
Springer
14 years 7 months ago
Automatic Generation of Sigma-Protocols
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
Endre Bangerter, Thomas Briner, Wilko Henecka, Ste...
EDOC
2006
IEEE
15 years 3 months ago
Scheduling Real-Time Components Using Jitter-Constrained Streams
Abstract— Component-based applications require good middleware support. In particular, business logic should be separated from management code for guaranteeing nonfunctional prop...
Claude-Joachim Hamann, Steffen Zschaler
JLP
2008
98views more  JLP 2008»
14 years 9 months ago
Comparing disjunctive modal transition systems with an one-selecting variant
models, used for specification, analysis and verification, usually describe sets of implementations by means of a refinement relation. In the branching time setting, implementatio...
Harald Fecher, Heiko Schmidt
ICCAD
1997
IEEE
76views Hardware» more  ICCAD 1997»
15 years 2 months ago
Simulation methods for RF integrated circuits
Abstract — The principles employed in the development of modern RF simulators are introduced and the various techniques currently in use, or expected to be in use in the next few...
Kenneth S. Kundert
CHARME
2003
Springer
120views Hardware» more  CHARME 2003»
15 years 1 months ago
A Compositional Theory of Refinement for Branching Time
Abstract. I develop a compositional theory of refinement for the branching time framework based on stuttering simulation and prove that if one system refines another, then a refine...
Panagiotis Manolios