Stuck-Free Conformance

  • Cédric Fournet
  • Tony Hoare
  • Sriram K. Rajamani
  • Jakob Rehof
Conference paper

DOI: 10.1007/978-3-540-27813-9_19

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3114)
Cite this paper as:
Fournet C., Hoare T., Rajamani S.K., Rehof J. (2004) Stuck-Free Conformance. In: Alur R., Peled D.A. (eds) Computer Aided Verification. CAV 2004. Lecture Notes in Computer Science, vol 3114. Springer, Berlin, Heidelberg

Abstract

We present a novel refinement relation (stuck-free conformance) for CCS processes, which satisfies the substitutability property: If I conforms to S, and P is any environment such that P | S is stuck-free, then P | I is stuck-free. Stuck-freedom is related to the CSP notion of deadlock, but it is more discriminative by taking orphan messages in asynchronous systems into account. We prove that conformance is a precongruence on CCS processes, thereby supporting modular refinement. We distinguish conformance from the related preorders, stable failures refinement in CSP and refusal preorder in CCS. We have implemented conformance checking in a new software model checker, zing, and we report on how we used it to find errors in distributed programs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Cédric Fournet
    • 1
  • Tony Hoare
    • 1
  • Sriram K. Rajamani
    • 1
  • Jakob Rehof
    • 1
  1. 1.Microsoft Research 

Personalised recommendations