On Automating Process Algebra Proofs (1996)
| Venue: | In Proc. Symp. on Computer and Information Sciences, ISCIS XI, volume II |
| Citations: | 6 - 0 self |
BibTeX
@INPROCEEDINGS{Korver96onautomating,
author = {Henri Korver and Alex Sellink},
title = {On Automating Process Algebra Proofs},
booktitle = {In Proc. Symp. on Computer and Information Sciences, ISCIS XI, volume II},
year = {1996},
pages = {815--826}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In [10] Groote and Springintveld incorporated several model-oriented techniques -- such as invariants, matching criteria, state mappings -- in the process-algebraic framework of ¯CRL for structuring and simplifying protocol verifications. In this paper, we formalise these extensions in Coq, which is a proof development tool based on type theory. In the updated framework, the length of proof constructions is reduced significantly. Moreover, the new approach allows for more automation (proof generation) than was possible in the past. The results are illustrated by an example in which we prove two queue representations equal. 1 Introduction In [10] the proof theory of ¯CRL [9] is extended with several model-oriented techniques such as invariants, matching criteria and state mappings. With the new theory many correctness proofs such as given in [4, 8] can be simplified and structured. The new approach can be considered as a refinement of classical process algebra verifications such as the...
