3521 search results - page 131 / 705 » Algorithmic Control in Concurrent Computations |
HPDC
2002
IEEE
15 years 5 months ago
2002
IEEE
Increasing complexity of distributed applications and commodity of resources through grids are making the tasks of deploying those applications harder. There is a clear need for s...
111
click to vote
ASM
2000
ASM
15 years 4 months ago
2000
ASM
We define the dynamic semantics of UML State Machines which integrate statecharts with the UML object model. The use of ASMs allows us (a) to rigorously model the event driven run...
TACAS
2005
Springer
15 years 6 months ago
2005
Springer
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
111
Voted
PPOPP
2012
ACM
13 years 8 months ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt h...