Formalizing process algebraic verifications in the calculus of constructions-Reference-Cited by-同舟云学术

Formalizing process algebraic verifications in the calculus of constructions

Published:1997-01 Issue:1 Volume:9 Page:1-48
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Bezem Marc¹,Bol Roland²,Groote Jan Friso³

Affiliation:

1. Dept. of Philosophy, Utrecht University, Heidelberglaan 8, 3584, CS Utrecht, The Netherlands

2. Dept. of Computing Science, Uppsala University, Uppsala, Sweden

3. Dept. of Software Technology, CWI, Amsterdam, The Netherlands

Abstract

Abstract This paper reports on the first steps towards the formal verification of correctness proofs of real-life protocols in process algebra. We show that such proofs can be verified, and partly constructed, by a general purpose proof checker. The process algebra we use is μ CRL, ACP τ augmented with data, which is expressive enough for the specification of real-life protocols. The proof checker we use is Coq, which is based on the Calculus of Constructions, an extension of simply typed lambda calculus. The focus is on the translation of the proof theory of μ CRL and μ CRL-specifications to Coq. As a case study, we verified the Alternating Bit Protocol.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

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

Reference40 articles.

1. Barendregt H. P.: Lambda calculi with types. In S. Abramsky D. M. Gabbay and T. S. E. Maibaum editors Handbook of Logic in Computer Science pages 117–309. Oxford University Press 1992.

2. Baeten J. C. M. and Bergstra J. A.: Discrete time process algebra. In W. R. Cleaveland editor Proceedings Concur'92 LNCS 630 pages 401–20. Springer Verlag 1992.

3. Bezem M. and Groote J. F.: A formal verification of the alternation bit protocol in the calculus of constructions. Technical Report 88 Logic Group Preprint Series Utrecht University March 1993.

4. A Correctness Proof of a One-bit Sliding Window Protocol in CRL

5. Bezem M. and Groote J. F.: Invariants in process algebra with data. In B. Jonsson and J. Parrow editors Proceedings Concur'94 LNCS 836 pages 401–416. Springer Verlag 1994.

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

1. Computer Aided Formal Design of Swarm Robotics Algorithms;Lecture Notes in Computer Science;2021

2. Formal Methods for Mobile Robots;Distributed Computing by Mobile Entities;2019

3. Exploring Properties of a Telecommunication Protocol with Message Delay Using Interactive Theorem Prover;Software Engineering and Formal Methods;2018

4. Certified Impossibility Results for Byzantine-Tolerant Mobile Robots;Lecture Notes in Computer Science;2013

5. Dogfooding the Formal Semantics of mCRL2;2012 35th Annual IEEE Software Engineering Workshop;2012-10