43 search results - page 4 / 9 » concur 2008 |
CONCUR
2008
Springer
13 years 8 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
CONCUR
2008
Springer
13 years 8 months ago
2008
Springer
We present a framework that combines ideas from spatial logics and Igarashi and Kobayashi's behavioural type systems, drawing benefits from both. In our approach, type systems...
CONCUR
2008
Springer
13 years 8 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
CONCUR
2008
Springer
13 years 8 months ago
2008
Springer
Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the firs...
CONCUR
2008
Springer
13 years 8 months ago
2008
Springer
We present the tool Sycraft (SYmboliC synthesizeR and Adder of Fault-Tolerance). In Sycraft, a distributed fault-intolerant program is specified in terms of a set of processes and ...