Sciweavers

5084 search results - page 235 / 1017
» Proving Possibility Properties
Sort
View
COMPOS
1997
Springer
15 years 10 months ago
Compositional Refinement of Interactive Systems Modelled by Relations
We introduce a mathematical model of components that can be used for the description of both hardware and software units forming distributed interactive systems. As part of a distr...
Manfred Broy
ICICS
1997
Springer
15 years 10 months ago
A new and optimal chosen-message attack on RSA-type cryptosystems
Abstract. Chosen-message attack on RSA is usually considered as an inherent property of its homomorphic structure. In this paper, we show that nonhomomorphic RSA-type cryptosystems...
Daniel Bleichenbacher, Marc Joye, Jean-Jacques Qui...
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
15 years 10 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
ICCS
2007
Springer
15 years 10 months ago
Formal Verification of Analog and Mixed Signal Designs in Mathematica
In this paper, we show how symbolic algebra in Mathematica can be used to formally verify analog and mixed signal designs. The verification methodology is based on combining induct...
Mohamed H. Zaki, Ghiath Al Sammane, Sofiène...
CAV
2006
Springer
101views Hardware» more  CAV 2006»
15 years 10 months ago
Terminator: Beyond Safety
Previous symbolic software model checkers (i.e., program analysis tools based on predicate abstraction, pushdown model checkiterative counterexample-guided abstraction refinement, ...
Byron Cook, Andreas Podelski, Andrey Rybalchenko