Skip to main content
Article thumbnail
Location of Repository

On automating process algebra proofs

By H. Korver and A. Sellink


In [10] Groote and Springintveld incorporated several model-oriented techniques -\ud such as invariants, matching criteria, state mappings - in the process-algebraic framework of μCRL for structuring and simplifying protocol verifications.\ud In this paper, we\ud formalise these extensions in Coq, which is a proof development tool based on type\ud theory.\ud In the updated framework, the length of proof constructions is reduced significantly.\ud Moreover, the new approach allows for more automation (proof generation)\ud than was possible in the past.\ud The results are illustrated by an example in which we\ud prove two queue representations equal

Topics: Wijsbegeerte
Year: 1996
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.