Sciweavers

82 search results - page 6 / 17
» A Direct Construction of a Universal P System
Sort
View
ASPLOS
1989
ACM
13 years 11 months ago
Architecture and Compiler Tradeoffs for a Long Instruction Word Microprocessor
A very long instruction word (VLIW) processorexploits parallelism by controlling multiple operations in a single instruction word. This paper describes the architecture and compil...
Robert Cohn, Thomas R. Gross, Monica S. Lam, P. S....
CRYPTO
2003
Springer
187views Cryptology» more  CRYPTO 2003»
14 years 20 days ago
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
Salil P. Vadhan
TPHOL
2009
IEEE
14 years 2 months ago
The HOL-Omega Logic
A new logic is posited for the widely used HOL theorem prover, as an extension of the existing higher order logic of the HOL4 system. The logic is extended to three levels, adding ...
Peter V. Homeier
MSE
2005
IEEE
148views Hardware» more  MSE 2005»
14 years 1 months ago
Teaching System-Level Design Using SpecC and SystemC
System-level design of embedded computer systems is essential to manage complexity and enhance designer productivity. Viewing designs at t abstraction levels allows developers to ...
Robert D. Walstrom, Joseph Schneider, Diane T. Rov...
ICFP
2010
ACM
13 years 8 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones