Pict correctness revisited

  • Authors:
  • Philippe Bidinger;Adriana Compagnoni

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

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2009

Quantified Score

Hi-index 5.23

Visualization

Abstract

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.