Showing papers by "Jacques Fleuriot published in 2006"
TL;DR: It is shown that a combination of rippling and the use of meta-variables as a least-commitment device can provide novelty in induction rule construction techniques that can introduce novel recursive structures.
2,969 citations
TL;DR: An implementation that combines the Isar language, the Isabelle theorem prover and the IsaPlanner proof planner provides a flexible environment for the exploration, certification, and presentation of mathematical proof.
16 citations
Journal Article•
TL;DR: In this article, the authors present a framework for reasoning about geometric algorithms in Isabelle and show how Hoare logic can be used to prove the correctness of such algorithms, in particular for convex hull problems.
Abstract: Algorithms for solving geometric problems are widely used in many scientific disciplines. Applications range from computer vision and robotics to molecular biology and astrophysics. Proving the correctness of these algorithms is vital in order to boost confidence in them. By specifying the algorithms formally in a theorem prover such as Isabelle, it is hoped that rigorous proofs showing their correctness will be obtained. This paper outlines our current framework for reasoning about geometric algorithms in Isabelle. It focuses on our case study of the convex hull problem and shows how Hoare logic can be used to prove the correctness of such algorithms.
11 citations
01 Jan 2006
1 citations