Results 1  10
of
798
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 13 (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
HWHume in Isabelle
"... Abstract. HWHume is the decidable Hume level oriented to direct implementation in hardware. As a first stage in the development of a verified compiler from HWHume to Java, we have implemented the semantics of HWHume in the Isabelle/HOL theorem prover, enabling the automatic proof of correctness o ..."
Abstract
 Add to MetaCart
Abstract. HWHume is the decidable Hume level oriented to direct implementation in hardware. As a first stage in the development of a verified compiler from HWHume to Java, we have implemented the semantics of HWHume in the Isabelle/HOL theorem prover, enabling the automatic proof of correctness
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (48 self)
 Add to MetaCart
Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized
A Mechanized Proof of Type Safety for the Polymorphic λCalculus with References∗
"... In this paper we study λ∀, ref, a Churchstyle typed lambda calculus with impredicative polymorphism and mutable references. We formalize the syntax, type system and callbyvalue operational semantics for λ∀, ref in the Isabelle/HOL theorem prover and prove the type safety of the language. 1 ..."
Abstract
 Add to MetaCart
In this paper we study λ∀, ref, a Churchstyle typed lambda calculus with impredicative polymorphism and mutable references. We formalize the syntax, type system and callbyvalue operational semantics for λ∀, ref in the Isabelle/HOL theorem prover and prove the type safety of the language. 1
A Formal Correctness Proof for Code Generation from SSA Form in Isabelle/HOL
 In Proc. 3. Arbeitstagung Programmiersprachen (ATPS),. LNI
, 2004
"... Optimizations in compilers are the most errorprone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is necessary to prove their correctness. We develop a formal semantics for static single assignment (SSA) intermediate representatio ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
representations and prove formally within the Isabelle /HOL theorem prover that a relatively simple form of code generation preserves the semantics of the transformed programs in SSA form. This formal correctness proof does not only verify the correctness of a certain class of code generation algorithms
Proof Pearl: A Probabilistic Proof for the GirthChromatic Number Theorem
"... Abstract. The GirthChromatic number theorem is a theorem from graph theory, stating that graphs with arbitrarily large girth and chromatic number exist. We formalize a probabilistic proof of this theorem in the Isabelle/HOL theorem prover, closely following a standard textbook proof and use this to ..."
Abstract
 Add to MetaCart
Abstract. The GirthChromatic number theorem is a theorem from graph theory, stating that graphs with arbitrarily large girth and chromatic number exist. We formalize a probabilistic proof of this theorem in the Isabelle/HOL theorem prover, closely following a standard textbook proof and use
Random testing in isabelle/hol
 Software Engineering and Formal Methods (SEFM 2004
, 2004
"... When developing nontrivial formalizations in a theorem prover, a considerable amount of time is devoted to “debugging ” specifications and conjectures by failed proof attempts. To detect such problems early in the proof and save development time, we have extended the Isabelle theorem prover with a ..."
Abstract

Cited by 49 (2 self)
 Add to MetaCart
When developing nontrivial formalizations in a theorem prover, a considerable amount of time is devoted to “debugging ” specifications and conjectures by failed proof attempts. To detect such problems early in the proof and save development time, we have extended the Isabelle theorem prover with a
General Bindings and AlphaEquivalence in Nominal Isabelle
"... Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi involving named bound variables (as opposed to deBruijn indices). In this paper we present an extension of Nominal Isabell ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi involving named bound variables (as opposed to deBruijn indices). In this paper we present an extension of Nominal
ProofChecking Protocols using Bisimulations
 IN PROC. CONCUR’99, LNCS 1664
, 1999
"... We report on our experience in using the Isabelle/HOL theorem prover to mechanize proofs of observation equivalence for systems with infinitely many states, and for parameterized systems. We follow the direct approach: An infinite relation containing the pair of systems to be shown equivalent is def ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We report on our experience in using the Isabelle/HOL theorem prover to mechanize proofs of observation equivalence for systems with infinitely many states, and for parameterized systems. We follow the direct approach: An infinite relation containing the pair of systems to be shown equivalent
Property specification of Sparkle and its extension possibilities (Technical Report) ∗
"... In this report we investigate the existing specification possibilities of properties in Sparkle and their basic extension possibilities for temporal properties. So we examine the Unity specification in Isabelle/HOL theorem prover and the CTL specification in NuSMV model checker. We present a case st ..."
Abstract
 Add to MetaCart
In this report we investigate the existing specification possibilities of properties in Sparkle and their basic extension possibilities for temporal properties. So we examine the Unity specification in Isabelle/HOL theorem prover and the CTL specification in NuSMV model checker. We present a case
Results 1  10
of
798