Pict correctness revisited

  • Authors:
  • Philippe Bidinger;Adriana Compagnoni

  • Affiliations:
  • VERIMAG, Grenoble, France;Stevens Institute of Technology, Hoboken, NJ

  • Venue:
  • FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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 p-calculus executions. We also give new proofs of soundness and liveness for the Pict abstract machine.