Sciweavers

5084 search results - page 597 / 1017
» Proving Possibility Properties
Sort
View
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
15 years 11 months ago
EWA: exact wiring-sizing algorithm
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
Rony Kay, Gennady Bucheuv, Lawrence T. Pileggi
HYBRID
1997
Springer
15 years 11 months ago
Time-Deterministic Hybrid Transition Systems
Hybrid transition systems in their full generality describe continuous behaviour by a set of equations in each mode an algebraic or di erential equation for each state variable in ...
Simin Nadjm-Tehrani
SIGSOFT
1996
ACM
15 years 11 months ago
Abstracting Dependencies between Software Configuration Items
ing Dependencies between Software Configuration Items CARL A. GUNTER University of Pennsylvania icle studies an abstract model of dependencies between software configuration items ...
Carl A. Gunter
CADE
1994
Springer
15 years 11 months ago
Simple Termination Revisited
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...
Aart Middeldorp, Hans Zantema
FSE
1993
Springer
89views Cryptology» more  FSE 1993»
15 years 11 months ago
Parallel FFT-Hashing
Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a m...
Claus-Peter Schnorr, Serge Vaudenay