Sciweavers

691 search results - page 134 / 139
» Equational Abstractions
Sort
View
FLOPS
2006
Springer
13 years 11 months ago
Contracts as Pairs of Projections
Abstract. Assertion-based contracts provide a powerful mechanism for stating invariants at module boundaries and for enforcing them uniformly. In 2002, Findler and Felleisen showed...
Robert Bruce Findler, Matthias Blume
ICCAD
1995
IEEE
134views Hardware» more  ICCAD 1995»
13 years 11 months ago
A delay model for logic synthesis of continuously-sized networks
ng certain electrical noise and power constraints.Abstract: We present a new delay model for use in logic synthesis. A traditional model treats the area of a library cell as consta...
Joel Grodstein, Eric Lehman, Heather Harkness, Bil...
LICS
1991
IEEE
13 years 11 months ago
The Fixed Point Property in Synthetic Domain Theory
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
Paul Taylor 0002
WSPI
2004
13 years 9 months ago
Knowledge Relativity
Abstract. I introduce the notion of knowledge relativity as a proposed conceptual link between different scientific disciplines. Examples from Informatics and Philosophy, particula...
Oliver Hoffmann
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 9 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...