Sciweavers

138 search results - page 22 / 28
» Logical Concurrency Control From Sequential Proofs
Sort
View
TSE
1998
176views more  TSE 1998»
13 years 9 months ago
Constructive Protocol Specification Using Cicero
—New protocols are often useful, but are hard to implement well. Protocol synthesis is a solution, but synthesized protocols can be slow. Implementing protocols will be even more...
Yen-Min Huang, Chinya V. Ravishankar
MICRO
2000
IEEE
107views Hardware» more  MICRO 2000»
14 years 1 months ago
Register integration: a simple and efficient implementation of squash reuse
Register integration (or simply integration) is a mechanism for incorporating speculative results directly into a sequential execution using data-dependence relationships. In this...
Amir Roth, Gurindar S. Sohi
DAC
2012
ACM
12 years 8 days ago
Equivalence checking for behaviorally synthesized pipelines
Loop pipelining is a critical transformation in behavioral synthesis. It is crucial to producing hardware designs with acceptable latency and throughput. However, it is a complex ...
Kecheng Hao, Sandip Ray, Fei Xie
TLCA
2005
Springer
14 years 3 months ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird
EMSOFT
2007
Springer
14 years 1 months ago
Verification of device drivers and intelligent controllers: a case study
The soundness of device drivers generally cannot be verified in isolation, but has to take into account the reactions of the hardware devices. In critical embedded systems, interf...
David Monniaux