Results 1  10
of
491
A MachineChecked Proof of the Odd Order Theorem
"... This paper reports on a sixyear collaborative effort that culminated in a complete formalization of a proof of the FeitThompson Odd Order Theorem in the Coq proof assistant. The formalized proof is constructive, and relies on nothing but the axioms and rules of the foundational framework impleme ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
This paper reports on a sixyear collaborative effort that culminated in a complete formalization of a proof of the FeitThompson Odd Order Theorem in the Coq proof assistant. The formalized proof is constructive, and relies on nothing but the axioms and rules of the foundational framework
A New Machinechecked Proof of Strong Normalisation for Display Logic
 Electronic Notes in Theoretical Computer Science
, 2002
"... We use a deep embedding of the display calculus for relation algebras #RA in the logical framework Isabelle/HOL to formalise a new, machinechecked, proof of strong normalisation and cutelimination for #RA which does not use measures on the size of derivations. Our formalisation generalises easily ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We use a deep embedding of the display calculus for relation algebras #RA in the logical framework Isabelle/HOL to formalise a new, machinechecked, proof of strong normalisation and cutelimination for #RA which does not use measures on the size of derivations. Our formalisation generalises easily
Abstract A New Machinechecked Proof of Strong Normalisation for Display Logic
"... We use a deep embedding of the display calculus for relation algebras δRA in the logical framework Isabelle/HOL to formalise a new, machinechecked, proof of strong normalisation and cutelimination for δRA which does not use measures on the size of derivations. Our formalisation generalises easily ..."
Abstract
 Add to MetaCart
We use a deep embedding of the display calculus for relation algebras δRA in the logical framework Isabelle/HOL to formalise a new, machinechecked, proof of strong normalisation and cutelimination for δRA which does not use measures on the size of derivations. Our formalisation generalises easily
A MachineChecked Proof of the Optimality of a RealTime Scheduling Policy
 In ComputerAided Verification – CAV’98
, 1998
"... . We describe a mechanicallychecked proof of the optimality of earliestdeadlinefirst (EDF) schedulers on periodic tasks accomplished using the Nqthm theorem prover. We present a formalization of the theorem and discuss why the machinechecked proof is both more complex and more reliable than a co ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
. We describe a mechanicallychecked proof of the optimality of earliestdeadlinefirst (EDF) schedulers on periodic tasks accomplished using the Nqthm theorem prover. We present a formalization of the theorem and discuss why the machinechecked proof is both more complex and more reliable than a
A machinechecked proof for a productline–aware type system
"... A software product line is a set of softwareintensive systems that share a common code base. Program variants are generated using a feature selection, where only the code for the selected features is generated. Since the number of program variants grows exponentially with the number of features, we ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
proof for Colored Featherweight Java in Coq. Furthermore, we present a simplified type system for Colored Featherweight Java and share our experiences with machinechecked proofs using the proof assistant Coq. Acknowledgements I would like to thank Christian Kästner for the perfect assistance throughout
A MachineChecked Proof of A StateSpace Construction Algorithm
"... This paper presents the correctness proof of Saturation, an algorithm for generating state spaces of concurrent systems, implemented in the SMART tool. Unlike the Breadth First Search exploration algorithm, which is easy to understand and formalise, Saturation is a complex algorithm, employing a mut ..."
Abstract
 Add to MetaCart
mutuallyrecursive pair of procedures that compute a series of nontrivial, nested local fixed points, corresponding to a chaotic fixed point strategy. A pencilandpaper proof of Saturation exists, but a machine checked proof had never been attempted. The key element of the proof is the characterisation
The Mondex Challenge: Machine Checked Proofs for an Electronic Purse
, 2006
"... The Mondex case study about the specification and refinement of an electronic purse as defined in [SCJ00] has recently been proposed as a challenge for formal systemsupported verification. This paper reports on the successful verification of the major part of the case study using the KIV specificat ..."
Abstract

Cited by 25 (9 self)
 Add to MetaCart
specification and verification system. We demonstrate that even though the handmade proofs were elaborated to an enormous level of detail we still could find small errors in the underlying data refinement theory as well as the formal proofs of the case study. We also provide an alternative formalisation
A MachineChecked Proof of the AverageCase Complexity of Quicksort in Coq
"... Abstract. As a casestudy in machinechecked reasoning about the complexity of algorithms in type theory, we describe a proof of the averagecase complexity of Quicksort in Coq. The proof attempts to follow a textbook development, at the heart of which lies a technical lemma about the behaviour of t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. As a casestudy in machinechecked reasoning about the complexity of algorithms in type theory, we describe a proof of the averagecase complexity of Quicksort in Coq. The proof attempts to follow a textbook development, at the heart of which lies a technical lemma about the behaviour
Results 1  10
of
491