Sciweavers

9 search results - page 1 / 2
» Modelling deterministic concurrent I O
Sort
View
TACAS
1998
Springer
115views Algorithms» more  TACAS 1998»
13 years 9 months ago
MESA: Support for Scenario-Based Design of Concurrent Systems
The latest ITU-T standard syntax of Message Sequence Charts (MSCs) 16] o ers several operators to compose MSCs in a hierarchical, iterating, and nondeterministic way. However, curr...
Hanêne Ben-Abdallah, Stefan Leue
PPOPP
2012
ACM
12 years 7 days ago
Internally deterministic parallel algorithms can be fast
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 ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
ICALP
1994
Springer
13 years 8 months ago
Liveness in Timed and Untimed Systems
When provingthe correctness of algorithmsin distributed systems, one generally considers safety conditions and liveness conditions. The Input Output I O automaton model and its ti...
Rainer Gawlick, Roberto Segala, Jørgen F. S...
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
13 years 5 months ago
Searching for liveness property violations in concurrent systems with ACO
Liveness properties in concurrent systems are, informally, those properties that stipulate that something good eventually happens during execution. In order to prove that a given ...
Enrique Alba, J. Francisco Chicano
GECCO
2007
Springer
215views Optimization» more  GECCO 2007»
13 years 8 months ago
Finding safety errors with ACO
Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most model checke...
Enrique Alba, J. Francisco Chicano