Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Wiedijk, Freek"'
Autor:
van Eekelen, Marko, Frumin, Daniil, Geuvers, Herman, Gondelman, Léon, Krebbers, Robbert, Schoolderman, Marc, Smetsers, Sjaak, Verbeek, Freek, Viguier, Benoît, Wiedijk, Freek
We present twenty-five C programs, as a benchmark for C program verification using formal methods. This benchmark can be used for system demonstration, for comparison of verification effort between systems, and as a friendly competition. For this las
Externí odkaz:
http://arxiv.org/abs/1904.01009
We used computer proof-checking methods to verify the correctness of our proofs of the propositions in Euclid Book I. We used axioms as close as possible to those of Euclid, in a language closely related to that used in Tarski's formal geometry. We u
Externí odkaz:
http://arxiv.org/abs/1710.00787
Autor:
Wiedijk, Freek
Publikováno v:
Logical Methods in Computer Science, Volume 8, Issue 1 (March 28, 2012) lmcs:1046
We propose a synthesis of the two proof styles of interactive theorem proving: the procedural style (where proofs are scripts of commands, like in Coq) and the declarative style (where proofs are texts in a controlled natural language, like in Isabel
Externí odkaz:
http://arxiv.org/abs/1201.3601
Autor:
Wiedijk, Freek
Publikováno v:
EPTCS 53, 2011, pp. 47-61
We present a version of the HOL Light system that supports undoing definitions in such a way that this does not compromise the soundness of the logic. In our system the code that keeps track of the constants that have been defined thus far has been m
Externí odkaz:
http://arxiv.org/abs/1103.3322
Publikováno v:
EPTCS 34, 2010, pp. 53-67
We present an approach to type theory in which the typing judgments do not have explicit contexts. Instead of judgments of shape "Gamma |- A : B", our systems just have judgments of shape "A : B". A key feature is that we distinguish free and bound v
Externí odkaz:
http://arxiv.org/abs/1009.2792
To improve on existing models of interaction with a proof assistant (PA), in particular for storage and replay of proofs, we in- troduce three related concepts, those of: a proof movie, consisting of frames which record both user input and the corres
Externí odkaz:
http://arxiv.org/abs/1005.2672
Publikováno v:
SIAM Review, 2016 Mar 01. 58(1), 143-155.
Externí odkaz:
http://www.jstor.org/stable/24778847
Autor:
Barendregt, Henk, Wiedijk, Freek
Publikováno v:
Philosophical Transactions: Mathematical, Physical and Engineering Sciences, 2005 Oct . 363(1835), 2351-2375.
Externí odkaz:
https://www.jstor.org/stable/30039732
Autor:
Geuvers, Herman, Wiedijk, Freek
Publikováno v:
In Electronic Notes in Theoretical Computer Science 24 February 2008 199:33-47