Abstract | ||
---|---|---|
The Pict programming language is an implementation of the -calculus in which executions of -calculus terms are specified via an ab- stract 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 the Pict abstract machine exe- cutions implement fair -calculus executions. We also give new proofs of soundness and liveness for the Pict abstract machine. |
Year | DOI | Venue |
---|---|---|
2007 | 10.1007/978-3-540-72952-5_13 | Formal Methods for Open Object-Based Distributed Systems |
Keywords | DocType | Volume |
concurrent programming language implementation,important property,defining fairness,fair p-calculus execution,calculus term,fair execution,Pict correctness revisited,abstract machine,Pict programming language,Pict abstract machine execution,Pict abstract machine | Conference | 4468 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.36 |
References | Authors | |
14 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Philippe Bidinger | 1 | 69 | 4.82 |
Adriana B. Compagnoni | 2 | 62 | 7.16 |