Coq formalisation of Consistent Consequence for Boolean Equation Systems

Datacite citation style:
Van Delft, M.E.C. (Myrthe); Geuvers, J.H. (Herman); Willemse, Tim (2017): Coq formalisation of Consistent Consequence for Boolean Equation Systems. Version 1. 4TU.ResearchData. dataset. https://doi.org/10.4121/uuid:a06e90c7-9ca1-45df-ad37-e99bdbf75b78
Other citation styles (APA, Harvard, MLA, Vancouver, Chicago, IEEE) available at Datacite

Dataset

Eindhoven University of Technology logo

Usage statistics

1121
views
2
citations
172
downloads

Categories

This data set contains a computer-checkable formal mathematical proof of the soundness and completeness of a proof system for the "consistent consequence" relation on Boolean equation systems, along with a formalisation of Boolean equation systems, the notion of solution and a formalisation of the relation between a solution of a Boolean equation system and a consistent consequence on such an equation system. The proofs can be machine-checked using the Coq proof assistant, version CoqIDE 8.5pl2; these proofs accompany the paper "A Formalisation of Consistent Consequence for Boolean Equation Systems" by Van Delft, Geuvers & Willemse that is part of the (forthcoming) proceedings of the 8th International Conference on Interactive Theorem Proving.

History

  • 2017-06-27 first online, published, posted

Publisher

TU Eindhoven

Format

media types: application/zip, text/plain, text/tab-separated-values

Organizations

TU Eindhoven, Department of Mathematics and Computer Science, Section Model Driven Software Engineering (MDSE)

DATA

Files (1)

  • 35,730 bytesMD5:6af22e16289c7a329bfd76c1ab54e0f7data.zip