| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437931 | Theoretical Computer Science | 2009 | 14 Pages |
Abstract
The Pict programming language is an implementation of the π-calculus in which executions of π-calculus terms are specified via an abstract machine. An important property of any concurrent programming language implementation is the fair execution of threads. After defining fairness for the π-calculus, we show that Pict abstract machine executions implement fair π-calculus executions. We also give new proofs of soundness and liveness for the Pict abstract machine.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
