63 search results - page 6 / 13 » Synthesis of Fault-Tolerant Concurrent Programs |
FOSSACS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
ITC
1999
IEEE
15 years 1 months ago
1999
IEEE
A new synthesis technique for designing finite state machines with on-line parity checking is presented. The output logic and the next-state logic of the finite state machines are...
PLDI
2012
ACM
13 years 2 days ago
2012
ACM
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
103
click to vote
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such algorithms have been proposed, implemented, and deployed – and yet the relations...
167
click to vote
ASPLOS
2009
ACM
15 years 10 months ago
2009
ACM
Future processors are expected to observe increasing rates of hardware faults. Using Dual-Modular Redundancy (DMR), two cores of a multicore can be loosely coupled to redundantly ...