Sciweavers

1186 search results - page 78 / 238
» State machine models of timing and circuit design
Sort
View
99
Voted
CORR
2006
Springer
112views Education» more  CORR 2006»
14 years 10 months ago
High-level synthesis under I/O Timing and Memory constraints
The design of complex Systems-on-Chips implies to take into account communication and memory access constraints for the integration of dedicated hardware accelerator. In this paper...
Philippe Coussy, Gwenolé Corre, Pierre Bome...
TABLEAUX
1998
Springer
15 years 2 months ago
Model Checking: Historical Perspective and Example (Extended Abstract)
ple (Extended Abstract) Edmund M. Clarke and Sergey Berezin Carnegie Mellon University -- USA Model checking is an automatic verification technique for finite state concurrent syst...
Edmund M. Clarke, Sergey Berezin
REPLICATION
2010
14 years 8 months ago
A History of the Virtual Synchrony Replication Model
In this chapter, we discuss a widely used fault-tolerant data replication model called virtual synchrony. The model responds to two kinds of needs. First, there is the practical qu...
Ken Birman
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 5 days ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
CASES
2006
ACM
15 years 1 months ago
Incremental elaboration for run-time reconfigurable hardware designs
We present a new technique for compiling run-time reconfigurable hardware designs. Run-time reconfigurable embedded systems can deliver promising benefits over implementations in ...
Arran Derbyshire, Tobias Becker, Wayne Luk