523 search results - page 6 / 105 » A General Model for Reachability Testing of Concurrent Progr... |
CAV
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In order to make multithreaded programming manageable, programmers often follow a design principle where they break the problem into tasks which are then solved asynchron...
123
Voted
CC
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we show how previous work on escape analysis can be adapted and extended to yield a static analysis that is efficient yet effective for reducing the number of inter...
102
Voted
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
108
Voted
FSTTCS
2003
Springer
15 years 6 months ago
2003
Springer
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
76
Voted
ACRI
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Cellular Automata are a powerful formal model for describing physical and computational processes. Qualitative analysis of Cellular Automata is in general a hard problem....