62 search results - page 3 / 13 » Quantitative Synthesis for Concurrent Programs |
134
click to vote
FOSSACS
2009
Springer
15 years 11 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...
138
click to vote
ITC
1999
IEEE
15 years 8 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...
153
click to vote
PLDI
2012
ACM
13 years 7 months 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...
171
Voted
PLDI
2006
ACM
15 years 10 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...
136
click to vote
APLAS
2000
ACM
15 years 9 months ago
2000
ACM
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explici...