Name
Abstract | ||
|---|---|---|
We take a thread as the behavior of a sequential deterministic program under execution and multi-threading as the form of concurrency provided by contemporary programming languages such as Java and C#. We outline an algebraic theory about threads and multi-threading. In the case of multi-threading, some deterministic interleaving strategy determines how threads are interleaved. Interleaving operators for a number of plausible interleaving strategies are specified in a simple and concise way. By that, we show that it is essentially open-ended what counts as an interleaving strategy. We use deadlock freedom as an example to show that there are properties of multi-threaded programs that depend on the interleaving strategy used. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s00165-007-0024-9 | Formal Asp. Comput. |
Keywords | Field | DocType |
multi threading | Multithreading,Concurrency,Computer science,Parallel computing,Theoretical computer science,Algebraic theory,Process calculus,Thread algebra,Interleaving | Journal |
Volume | Issue | ISSN |
19 | 4 | 1433-299X |
Citations | PageRank | References |
48 | 2.09 | 20 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan A. Bergstra | 1 | 1445 | 140.42 |
| Cornelis A. Middelburg | 2 | 487 | 49.21 |