Pict correctness revisited

@article{Bidinger2009PictCR,
  title={Pict correctness revisited},
  author={Philippe Bidinger and Adriana B. Compagnoni},
  journal={Theor. Comput. Sci.},
  year={2009},
  volume={410},
  pages={114-127}
}
The Pict programming language is an implementation of the @p-calculus in which executions of @p-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 @p-calculus, we show that Pict abstract machine executions implement fair @p-calculus executions. We also give new proofs of soundness and liveness for the Pict abstract machine. 

References

Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

The polymorphic π-calculus: Theory and implementation

D. Turner
  • Technical report,
  • 1996
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

The π-Calculus: A theory of mobile processes

  • Scalable Computing: Practice and Experience
  • 2008
VIEW 1 EXCERPT

Boxed Ambients for Global Computing

Pablo Garralda
  • PhD thesis, Stevens Institute of Technology, New Jersey,
  • 2007
VIEW 1 EXCERPT

Fairness in the pi-calculus

F. Corradini D.R. Cacciagrano
  • Technical report, Dipartimenti di Informatica, Università di L’Aquila, TR 005/2004,
  • 2004
VIEW 3 EXCERPTS