562 search results - page 94 / 113 » Concurrent Turing Machines |
103
Voted
PODC
2010
ACM
15 years 3 months ago
2010
ACM
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
In this paper we present an automated way of using spare CPU resources within a shared memory multi-processor or multi-core machine. Our approach is (i) to profile the execution o...
POPL
2010
ACM
15 years 9 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
127
click to vote
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
We present an expressiveness study of linearity and persistence of processes. We choose the π-calculus, one of the main representatives of process calculi, as a framework to cond...
101
click to vote
TACAS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...