Results 1  10
of
12
A modular formalisation of finite group theory
 In TPHOLs
, 2007
"... Abstract. In this paper, we present a formalisation of elementary group theory done in Coq. This work is the first milestone of a longterm effort to formalise FeitThompson theorem. As our further developments will heavily rely on this initial base, we took special care to articulate it in the most ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
Abstract. In this paper, we present a formalisation of elementary group theory done in Coq. This work is the first milestone of a longterm effort to formalise FeitThompson theorem. As our further developments will heavily rely on this initial base, we took special care to articulate it in the most compositional way. 1
Modular Reasoning in Isabelle
, 1999
"... The concept of locales for Isabelle enables local definition and assumption for interactive mechanical proofs. Furthermore, dependent types are constructed in Isabelle/HOL for first class representation of structure. These two concepts are introduced briefly. Although each of them has proved use ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
The concept of locales for Isabelle enables local definition and assumption for interactive mechanical proofs. Furthermore, dependent types are constructed in Isabelle/HOL for first class representation of structure. These two concepts are introduced briefly. Although each of them has proved useful in itself, their real power lies in combination. This paper illustrates by examples from abstract algebra how this combination works and argues that it enables modular reasoning.
Verification of the MillerRabin Probabilistic Primality Test
, 2003
"... Using the HOL theorem prover, we apply our formalization of probability theory to specify and verify the MillerRabin probabilistic primality test. The version of the test commonly found in algorithm textbooks implicitly accepts probabilistic termination, but our own verified implementation satisfie ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
Using the HOL theorem prover, we apply our formalization of probability theory to specify and verify the MillerRabin probabilistic primality test. The version of the test commonly found in algorithm textbooks implicitly accepts probabilistic termination, but our own verified implementation satisfies the stronger property of guaranteed termination. Completing the proof of correctness requires a significant body of group theory and computational number theory to be formalized in the theorem prover. Once verified, the primality test can either be executed in the logic (using rewriting) and used to prove the compositeness of numbers, or manually extracted to Standard ML and used to find highly probable primes.
Merging HOL with Set Theory  preliminary experiments
, 1994
"... Set theory is the standard foundation for mathematics, but the majority of general purpose mechanised proof assistants support versions of type theory (higher order logic). Examples include Alf, Automath, Coq, EHDM, HOL, IMPS, LAMBDA, LEGO, Nuprl, PVS and Veritas. For many applications type theory w ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Set theory is the standard foundation for mathematics, but the majority of general purpose mechanised proof assistants support versions of type theory (higher order logic). Examples include Alf, Automath, Coq, EHDM, HOL, IMPS, LAMBDA, LEGO, Nuprl, PVS and Veritas. For many applications type theory works well and provides, for specification, the benefits of typechecking that are wellknown in programming. However, there are areas where types get in the way or seem unmotivated. Furthermore, most people with a scientific or engineering background already know set theory, whereas type theory may appear inaccessable and so be an obstacle to the uptake of proof assistants based on it. This paper describes some experiments (using HOL) in combining set theory and type theory; the aim is to get the best of both worlds in a single system. Three approaches have been tried, all based on an axiomatically specified type V of ZFlike sets: (i) HOL is used without any additions besides V; (ii) an emb...
Formalizing Abstract Algebra in Type Theory with Dependent Records
 Universitat Freiburg
, 2003
"... algebra suitable for a general reasoning. One of the most common ways to formalize abstract algebra is to make use of a module system to specify an algebra as a theory. However, this approach suffers from the fact that modules are usually not firstclass objects in the formal system. In this paper, ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
algebra suitable for a general reasoning. One of the most common ways to formalize abstract algebra is to make use of a module system to specify an algebra as a theory. However, this approach suffers from the fact that modules are usually not firstclass objects in the formal system. In this paper, we develop a new approach based on the use of dependent record types. In our account, all algebraic structures are firstclass objects, with the natural subtyping properties due to record extension (for example, a group is a subtype of a monoid). Our formalization cleanly separates the axiomatization of the algebra from its typing properties, corresponding more closely to a textbook presentation. 1
A Formal Proof of Sylow's Theorem  An Experiment in Abstract Algebra with Isabelle HOL
 Journal of Automated Reasoning
, 1999
"... The theorem of Sylow is proved in Isabelle HOL. We follow the proof by Wielandt that is more general than the original and uses a nontrivial combinatorial identity. The mathematical proof is explained in some detail leading on to the mechanization of group theory and the necessary combinatorics in ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
The theorem of Sylow is proved in Isabelle HOL. We follow the proof by Wielandt that is more general than the original and uses a nontrivial combinatorial identity. The mathematical proof is explained in some detail leading on to the mechanization of group theory and the necessary combinatorics in Isabelle. We present the mechanization of the proof in detail giving reference to theorems contained in an appendix. Some weak points of the experiment with respect to a natural treatment of abstract algebraic reasoning give rise to a discussion of the use of module systems to represent abstract algebra in theorem provers. Drawing from that, we present tentative ideas for further research into a section concept for Isabelle.
Locales: a Module System for Mathematical Theories
"... Locales are a module system for managing theory hierarchies in a theorem prover through theory interpretation. They are available for the theorem prover Isabelle. In this paper, their semantics is defined in terms of local theories and morphisms. Locales aim at providing flexible means of extension ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Locales are a module system for managing theory hierarchies in a theorem prover through theory interpretation. They are available for the theorem prover Isabelle. In this paper, their semantics is defined in terms of local theories and morphisms. Locales aim at providing flexible means of extension and reuse. Theory modules (which are called locales) may be extended by definitions and theorems. Interpretation to Isabelle’s global theories and proof contexts is possible via morphisms. Even the locale hierarchy may be changed if declared relations between locales do not adequately reflect logical relations, which are implied by the locales’ specifications. By discussing their design and relating it to more commonly known structuring mechanisms of programming languages and provers, locales are made accessible to a wider audience beyond the users of Isabelle. The discussed mechanisms include MLstyle functors, type classes and mixins (the latter are found in modern objectoriented languages). 1
Formalizing Metarouting in PVS
"... ... metarouting theory to aid the development of complex routing protocol models based on metarouting, which is an algebraic framework for specifying routing protocols in a restricted fashion such that the protocol is guaranteed to converge. Our formalization of metarouting theory utilizes the theor ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
... metarouting theory to aid the development of complex routing protocol models based on metarouting, which is an algebraic framework for specifying routing protocols in a restricted fashion such that the protocol is guaranteed to converge. Our formalization of metarouting theory utilizes the theoryinterpretation extensions of PVS. Our use of a general purpose theorem prover provides a structured framework for a network designer to incrementally develop and refine their algebraic routing protocol model by starting from various base routing algebras, and composing them into complex algebra models with composition operators. In addition, one can leverage PVS’s type checking capability and builtin proof engine to ensure routing model consistency.
Some Mathematical Case Studies in ProofPowerHOL
, 2004
"... TPHOLs conference covers all aspects of theorem proving in higher order logics as well as related topics in theorem proving and verification. There were 42 papers submitted to TPHOLs 2004 in the full research category, each of which was refereed by at least 3 reviewers selected by the program commit ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
TPHOLs conference covers all aspects of theorem proving in higher order logics as well as related topics in theorem proving and verification. There were 42 papers submitted to TPHOLs 2004 in the full research category, each of which was refereed by at least 3 reviewers selected by the program committee. Of these submissions, 21 were accepted for presentation at the conference and publication in volume 3223 of Springer’s Lecture Notes in Computer Science series. In keeping with longstanding tradition, TPHOLs 2004 also offered a venue for the presentation of work in progress, where researchers invite discussion by means of a brief introductory talk and then discuss their work at a poster