Formalising LPOs and Invariants in Coq
Abstract
In the setting of μCRL, the notions of 'linear process operator (LPO)' and 'invariant' are implemented in Coq, which is a proof development tool based on type theory. As a first experiment we have computer-checked a general property of a binary search program in the new frameworkSimilar works
Full text
Last time updated on 14/06/2016
This paper was published in Utrecht University Repository.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.