Add to ORKGComparing provers on a formalization of the same problem is always a valuable exercise. In this paper, we present the formal proof of correctness of a non-trivial algorithm from graph theory that was carried out in three proof assistants: Why3, Coq, and Isabelle
National audienceNous présentons une preuve formelle de l'algorithme de Tarjan (1972) pour trouver l...
We illustrate the use of formal languages and relations in compact formal derivations of some graph ...
In this paper we describe a system for visualizing correctness proofs of graph algorithms. The syste...
International audienceComparing provers on a formalization of the same problem is always a valuable ...
Comparing provers on a formalization of the same problem is always a valuable exercise. In this pape...
Travail présenté à JFLA 2017National audienceNous présentons une preuve formelle de l'algorithme de ...
We present formal proofs for the two classical Tarjan-1972 and Kosaraju-1978 algorithms for finding ...
International audienceWe present a formal proof of the classical Tarjan-1972 algorithm for finding s...
Quite often formal proofs are not published in conferences or journal articles, because formal proof...
National audienceDespite their wide use and the maturity of their theory, only a few works have focu...
National audienceNous présentons une preuve formelle de l'algorithme de Tarjan (1972) pour trouver l...
We illustrate the use of formal languages and relations in compact formal derivations of some graph ...
In this paper we describe a system for visualizing correctness proofs of graph algorithms. The syste...
International audienceComparing provers on a formalization of the same problem is always a valuable ...
Comparing provers on a formalization of the same problem is always a valuable exercise. In this pape...
Travail présenté à JFLA 2017National audienceNous présentons une preuve formelle de l'algorithme de ...
We present formal proofs for the two classical Tarjan-1972 and Kosaraju-1978 algorithms for finding ...
International audienceWe present a formal proof of the classical Tarjan-1972 algorithm for finding s...
Quite often formal proofs are not published in conferences or journal articles, because formal proof...
National audienceDespite their wide use and the maturity of their theory, only a few works have focu...
National audienceNous présentons une preuve formelle de l'algorithme de Tarjan (1972) pour trouver l...
We illustrate the use of formal languages and relations in compact formal derivations of some graph ...
In this paper we describe a system for visualizing correctness proofs of graph algorithms. The syste...