Results 1  10
of
5,102
Machine Words in Isabelle/HOL
, 2011
"... A formalisation of generic, fixed size machine words in Isabelle/HOL. An earlier version of this formalisation is described in [1]. ..."
Abstract
 Add to MetaCart
A formalisation of generic, fixed size machine words in Isabelle/HOL. An earlier version of this formalisation is described in [1].
Nominal techniques in Isabelle/HOL
 Proceedings of the 20th International Conference on Automated Deduction (CADE20
, 2005
"... Abstract. In this paper we define an inductive set that is bijective with the ffequated lambdaterms. Unlike deBruijn indices, however, our inductive definition includes names and reasoning about this definition is very similar to informal reasoning on paper. For this we provide a structural induc ..."
Abstract

Cited by 102 (14 self)
 Add to MetaCart
induction principle that requires to prove the lambdacase for fresh binders only. The main technical novelty of this work is that it is compatible with the axiomofchoice (unlike earlier nominal logic work by Pitts et al); thus we were able to implement all results in Isabelle/HOL and use them
Integrating Isabelle/HOL with Specware
"... Abstract. Isabelle/HOL is integrated with Specware in order to discharge proof obligations arising during Specware’s specification and refinement process. Specware’s proof obligations arise from use of predicate subtypes, termination conditions, and correctness of refinements as well as any explicit ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Isabelle/HOL is integrated with Specware in order to discharge proof obligations arising during Specware’s specification and refinement process. Specware’s proof obligations arise from use of predicate subtypes, termination conditions, and correctness of refinements as well as any
Hoare Logics in Isabelle/HOL
 PROOF AND SYSTEMRELIABILITY
, 2002
"... This paper describes Hoare logics for a number of imperative language constructs, from whileloops via exceptions to mutually recursive procedures. Both partial and total correctness are treated. In particular a proof system for total correctness of recursive procedures in the presence of unbounded ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
of unbounded nondeterminism is presented. All systems are formalized and shown to be sound and complete in the theorem prover Isabelle/HOL.
Data Refinement in Isabelle/HOL
"... Abstract. The paper shows how the code generator of Isabelle/HOL supports data refinement, i.e., providing efficient code for operations on abstract types, e.g., sets or numbers. This allows all tools that employ code generation, e.g., Quickcheck or proof by evaluation, to compute with these abstrac ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. The paper shows how the code generator of Isabelle/HOL supports data refinement, i.e., providing efficient code for operations on abstract types, e.g., sets or numbers. This allows all tools that employ code generation, e.g., Quickcheck or proof by evaluation, to compute
On the Representation of Datatypes in Isabelle/HOL
 First Isabelle Users Workshop
, 1995
"... Representation of datatypes is a necessary prerequisite if one wants to proverather than postulate the characteristic theorems of datatypes. This paper introduces two notions of representation functions for types and shows how representations of composed types can be calculated from representations ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
of their constituents. Together with a representation of basic types due to Paulson [6], this provides a basis for the mechanization of datatypes in Isabelle/HOL. 0
Cardinals in Isabelle/HOL
"... Abstract. We report on a formalization of ordinals and cardinals in Isabelle/HOL. A main challenge we faced was the inability of higherorder logic to represent ordinals canonically, as transitive sets (as done in set theory). We resolved this into a “decentralized ” representation identifying ordin ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. We report on a formalization of ordinals and cardinals in Isabelle/HOL. A main challenge we faced was the inability of higherorder logic to represent ordinals canonically, as transitive sets (as done in set theory). We resolved this into a “decentralized ” representation identifying
Gries/Owicki in Isabelle/HOL
"... We present a formalization of the Gries/Owicki method for correctness proofs of concurrent imperative programs with shared variables in the theorem prover Isabelle/HOL. Syntax, semantics and proof rules are defined in higherorder logic. The correctness of the proof rules w.r.t. the semantics is pro ..."
Abstract
 Add to MetaCart
We present a formalization of the Gries/Owicki method for correctness proofs of concurrent imperative programs with shared variables in the theorem prover Isabelle/HOL. Syntax, semantics and proof rules are defined in higherorder logic. The correctness of the proof rules w.r.t. the semantics
Quotients Revisited for Isabelle/HOL
 the Proc. of the 26th ACM Symposium On Applied Computing
, 2011
"... HigherOrder Logic (HOL) is based on a small logic kernel, whose only mechanism for extension is the introduction of safe definitions and of nonempty types. Both extensions are often performed in quotient constructions. To ease the work involved with such quotient constructions, we reimplemented i ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
implemented in the Isabelle/HOL theorem prover the quotient package by Homeier. In doing so we extended his work in order to deal with compositions of quotients and also specified completely the procedure of lifting theorems from the raw level to the quotient level. The importance for theorem proving is that many formal
Results 1  10
of
5,102