Formalising a Value-Passing Calculus in HOL-Reference-Cited by-同舟云学术

Formalising a Value-Passing Calculus in HOL

Published:1999-09 Issue:2 Volume:11 Page:160-199
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Nesi Monica¹

Affiliation:

1. Dipartimento di Matematica Pura ed Applicata, Università degli Studi di L'Aquila, L'Aquila, Italy, , , , , , IT

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s001650050046.pdf

Reference65 articles.

1. Mechanizing a π-calculus equivalence in HOL

2. ‘Algèbre de Processus et Synchronisation’;Austry D.;Journal of Theoretical Computer Science,1984

3. ‘Refinement Concepts Formalised in Higher Order Logic’;Back R. J. R.;Formal Aspects of Computing,1990

4. ‘Process Algebra for Synchronous Communication’;Bergstra J. A.;Information and Control,1984

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Unique solutions of contractions, CCS, and their HOL formalisation;Information and Computation;2020-12

2. Unique Solutions of Contractions, CCS, and their HOL Formalisation;Electronic Proceedings in Theoretical Computer Science;2018-08-24

3. Translating FSP into LOTOS and networks of automata;Formal Aspects of Computing;2010-11

4. On Process Equivalence = Equation Solving in CCS;Journal of Automated Reasoning;2009-03-20

5. Translating FSP into LOTOS and Networks of Automata;Lecture Notes in Computer Science;2007