Skip to main content
Log in

Formalising a Value-Passing Calculus in HOL

  • Original Paper
  • Published:
Formal Aspects of Computing

Abstract.

Milner's value-passing calculus for describing and reasoning about communicating systems is formalised in the HOL proof assistant. Based on a previously defined mechanisation of pure CCS (no data communication, only synchronisation) in HOL, value-passing agents are given behavioural semantics by translating them into pure agents. An interactive proof environment is derived that supports both reasoning about the value-passing calculus and verification of value-passing specifications, which are defined over an infinite value domain.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received September 1997 / Accepted in revised form July 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nesi, M. Formalising a Value-Passing Calculus in HOL. Formal Aspects of Computing 11, 160–199 (1999). https://doi.org/10.1007/s001650050046

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001650050046

Navigation