Showing papers by "Jacques Fleuriot published in 2004"
Journal Article•
TL;DR: An efficient mechanism for rippling that can conjecture and prove needed lemmas automatically as well as present the resulting proof plans as Isar style proof scripts.
Abstract: We present an account of rippling with proof critics suitable for use in higher order logic in Isabelle/ISAPLANNER. We treat issues not previously examined, in particular regarding the existence of multiple annotations during rippling. This results in an efficient mechanism for rippling that can conjecture and prove needed lemmas automatically as well as present the resulting proof plans as Isar style proof scripts.
35 citations
14 Sep 2004
TL;DR: In this article, the authors present an account of rippling with proof critics suitable for use in higher order logic in Isabelle/IsaPlanner, and treat issues not previously examined, in particular regarding the existence of multiple annotations during Rippling.
Abstract: We present an account of rippling with proof critics suitable for use in higher order logic in Isabelle/IsaPlanner. We treat issues not previously examined, in particular regarding the existence of multiple annotations during rippling. This results in an efficient mechanism for rippling that can conjecture and prove needed lemmas automatically as well as present the resulting proof plans as Isar style proof scripts.
34 citations
16 Sep 2004
TL;DR: This paper outlines the current framework for reasoning about geometric algorithms in Isabelle and shows how Hoare logic can be used to prove the correctness of such algorithms.
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.
32 citations
01 Jan 2004
TL;DR: This work develops ANML2 as a rigourously formalized protocol language based on the same principles as ANML, and shows how to formulate termination and consistency properties for specific protocols within the AN ML2 framework and prove them in Isabelle.
Abstract: We make a case for more rigour in the development of agent protocol languages, by examining the implementation of the logic-based protocol language ANML in the theorem prover Isabelle. However, the problems encountered in the formalization process were found to be insurmountable. As an alternative, we develop ANML2 as a rigourously formalized protocol language based on the same principles as ANML. We show how to formulate termination and consistency properties for specific protocols within the ANML2 framework and prove them in Isabelle.
5 citations