Results 11 - 20 of 111

A Formalised First-Order . . .

by René Vestergaard, James Brotherston , 2002
"... We present the titular proof development that has been verified in Isabelle/HOL. As a first, the proof is conducted exclusively by the primitive proof principles of the standard syntax and of the considered reduction relations: the naive way, so to speak. Curiously, the Barendregt Variable Conventio ..."
Abstract - Add to MetaCart
We present the titular proof development that has been verified in Isabelle/HOL. As a first, the proof is conducted exclusively by the primitive proof principles of the standard syntax and of the considered reduction relations: the naive way, so to speak. Curiously, the Barendregt Variable

Formalising Generalised Substitutions

by Jeremy E. Dawson
"... Abstract. We use the theorem prover Isabelle to formalise and machinecheck results of the theory of generalised substitutions given by Dunne and used in the B method. We describe the model of computation implicit in this theory and show how this is based on a compound monad, and we contrast this mod ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract. We use the theorem prover Isabelle to formalise and machinecheck results of the theory of generalised substitutions given by Dunne and used in the B method. We describe the model of computation implicit in this theory and show how this is based on a compound monad, and we contrast

Formalising a High-Performance Microkernel

by Kevin Elphinstone, Gerwin Klein, Rafal Kolanski - WORKSHOP ON VERIFIED SOFTWARE: THEORIES, TOOLS, AND EXPERIMENTS (VSTTE 06), MICROSOFT RESEARCH TECHNICAL REPORT MSR-TR2006-117 , 2006
"... This paper argues that a pragmatic approach is needed for integrating design and formalisation of complex systems. We report on our approach to designing the seL4 operating system microkernel API and its formalisation in Isabelle/HOL. The formalisation consists of the systematic translation of signi ..."
Abstract - Cited by 8 (4 self) - Add to MetaCart
This paper argues that a pragmatic approach is needed for integrating design and formalisation of complex systems. We report on our approach to designing the seL4 operating system microkernel API and its formalisation in Isabelle/HOL. The formalisation consists of the systematic translation

Formalised Cut Admissibility for Display Logic

by Jeremy E. Dawson, Rajeev Goré - In Proc. TPHOLS'02, LNCS 2410, 131--147 , 2002
"... We use a deep embedding of the display calculus for relation algebras RA in the logical framework Isabelle/HOL to formalise a machine-checked proof of cut-admissibility for RA. Unlike other "implementations ", we explicitly formalise the structural induction in Isabelle /HOL and believ ..."
Abstract - Cited by 8 (3 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 machine-checked proof of cut-admissibility for RA. Unlike other "implementations ", we explicitly formalise the structural induction in Isabelle /HOL

Encoding Object-Z in Isabelle/HOL

by Graeme Smith, Florian Kammüller, Thomas Santen - International Conference of Z and B Users (ZB 2002), volume 2272 of LNCS , 2002
"... In this paper, we present a formalisation of the reference semantics of Object-Z in the higher-order logic (HOL) instantiation of the generic theorem prover Isabelle, Isabelle/HOL. This formalisation has the e#ect of both clarifying the semantics and providing the basis for a theorem prover for ..."
Abstract - Cited by 13 (4 self) - Add to MetaCart
In this paper, we present a formalisation of the reference semantics of Object-Z in the higher-order logic (HOL) instantiation of the generic theorem prover Isabelle, Isabelle/HOL. This formalisation has the e#ect of both clarifying the semantics and providing the basis for a theorem prover

Formalised Cut Admissibility for Display Logic

by unknown authors
"... Abstract. We use a deep embedding of the display calculus for relation algebras ffiRA in the logical framework Isabelle/HOL to formalise a machine-checked proof of cut-admissibility for ffiRA. Unlike other "implementations", we explicitly formalise the structural induction in Isabe ..."
Abstract - Add to MetaCart
Abstract. We use a deep embedding of the display calculus for relation algebras ffiRA in the logical framework Isabelle/HOL to formalise a machine-checked proof of cut-admissibility for ffiRA. Unlike other "implementations", we explicitly formalise the structural induction

Stream Fusion in HOL

by Andreas Lochbihler, Alexandra Maximova , 2015
"... Stream Fusion is a system for removing intermediate list data structures from functional programs, in particular Haskell. This entry adapts stream fusion to Isabelle/HOL and its code generator. We define stream types for finite and possibly infinite lists and stream versions for most of the fusible ..."
Abstract - Add to MetaCart
Stream Fusion is a system for removing intermediate list data structures from functional programs, in particular Haskell. This entry adapts stream fusion to Isabelle/HOL and its code generator. We define stream types for finite and possibly infinite lists and stream versions for most of the fusible

A Deep Embedding of a Decidable Fragment of Separation Logic in HOL

by Thomas Tuerk , 2007
"... Smallfoot is a tool to automatically check separation logic specifications of sequential programs. It uses a decidable fragment of separation logic. In this paper, a deep embedding of a slightly different decidable fragment of separation logic inspired by Smallfoot is presented. Moreover, a HOL impl ..."
Abstract - Add to MetaCart
Smallfoot is a tool to automatically check separation logic specifications of sequential programs. It uses a decidable fragment of separation logic. In this paper, a deep embedding of a slightly different decidable fragment of separation logic inspired by Smallfoot is presented. Moreover, a HOL

Java Definite Assignment in Isabelle/HOL

by Norbert Schirmer, Technische Universität München - In Proc. of ECOOP Workshop on Formal Techniques for Java-like Programs, number 408 in Technical Report. ETH , 2003
"... In Java the compiler guarantees that each local variable is initialised when we attempt to access it at runtime. This prohibits access to uninitialised memory during execution and is a key ingredient for type safety. We have formalised the definite assignment analysis of the Java compiler in the ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
In Java the compiler guarantees that each local variable is initialised when we attempt to access it at runtime. This prohibits access to uninitialised memory during execution and is a key ingredient for type safety. We have formalised the definite assignment analysis of the Java compiler

A separation logic framework in HOL

by Thomas Tuerk - In Otmane Ait Mohamed, C.M., Tahar, S., eds.: TPHOLs ’08: Emerging Trends Proceedings. (08 2008) 116–122
"... Abstract. Separation Logic has proved to be a powerful technique for program verification. There are tools based on ideas of separation logic and even some implementations in theorem provers. However, these implementations all concentrate on the verification of programs written in one specific langu ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
, a formalisation of Abstract Separation Logic in HOL is presented as a first step towards implementing the proposed framework. This presentation contains an initial case study – an implementation separation logic for this purpose. 1
Results 11 - 20 of 111