Results 1 - 10 of 111

A formalisation of Smallfoot in HOL

by Thomas Tuerk - of Lecture Notes in Computer Science , 2009
"... Abstract. In this paper a general framework for separation logic inside Separation Logic. It contains a model of an abstract, imperative programming language as well as an abstract specification logic for this language. While the formalisation mainly follows the original definition of Abstract Separ ..."
Abstract - Cited by 20 (1 self) - Add to MetaCart
Abstract. In this paper a general framework for separation logic inside Separation Logic. It contains a model of an abstract, imperative programming language as well as an abstract specification logic for this language. While the formalisation mainly follows the original definition of Abstract

C formalised in HOL

by Michael Norrish , 1998
"... We present a formal semantics of the C programming language, covering both the type system and the dynamic behaviour of programs. The semantics is wide-ranging, covering most of the language, with its most significant omission being the C library. Using a structural operational semantics we specify ..."
Abstract - Cited by 86 (9 self) - Add to MetaCart
We present a formal semantics of the C programming language, covering both the type system and the dynamic behaviour of programs. The semantics is wide-ranging, covering most of the language, with its most significant omission being the C library. Using a structural operational semantics we specify

A HOL Formalisation of the Temporal Logic of Actions

by Thomas Långbacka - Higher Order Logic Theorem Proving and Its Applications, volume 859 of Lecture Notes in Computer Science (LNCS , 1994
"... . We describe an attempt to formalise the semantics of the ..."
Abstract - Cited by 11 (0 self) - Add to MetaCart
. We describe an attempt to formalise the semantics of the

Nominal techniques in Isabelle/HOL

by Christian Urban - Proceedings of the 20th International Conference on Automated Deduction (CADE-20 , 2005
"... Abstract. In this paper we define an inductive set that is bijective with the ff-equated lambda-terms. Unlike de-Bruijn 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 101 (14 self) - Add to MetaCart
Abstract. In this paper we define an inductive set that is bijective with the ff-equated lambda-terms. Unlike de-Bruijn 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

Formalising a Model of the lambda-calculus in HOL-ST

by Sten Agerholm , 1994
"... Most new theorem provers implement strong and complicated type theories which eliminate some of the limitations of simple type theories such as the HOL logic. A more accessible alternative might be to use a combination of set theory and simple type theory as in HOL-ST which is a version of the HOL s ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
system supporting a ZF-like set theory in addition to higher order logic. This paper presents a case study on the use of HOL-ST to build a model of the -calculus by formalising the inverse limit construction of domain theory. This construction is not possible in the HOL system itself, or in simple type

Formalising a . . .

by Kevin Elphinstone, Gerwin Klein, Rafal Kolanski
"... 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 - 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

Machine Words in Isabelle/HOL

by Jeremy Dawson, Paul Graunke, Brian Huffman, Gerwin Klein, John Matthews , 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].

A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL

by Simon J. Gay - in Isabelle/HOL, Proc. TPHOLs01 , 2000
"... . We present a formalisation, in the theorem proving system Isabelle/HOL, of a linear type system for the pi calculus, including a proof of runtime safety of typed processes. The use of a uniform encoding of pi calculus syntax in a meta language, the development of a general theory of type envir ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
. We present a formalisation, in the theorem proving system Isabelle/HOL, of a linear type system for the pi calculus, including a proof of runtime safety of typed processes. The use of a uniform encoding of pi calculus syntax in a meta language, the development of a general theory of type

A formalisation of the normal forms of context-free grammars in HOL4

by Aditi Barthwal , Michael Norrish - Proc. of 24th Int. Wksh. on Computer Science Logic, CSL 2010, v. 6247 of Lect. Notes in Comput. Sci , 2010
"... Abstract. We describe the formalisation of the normal forms of context-free grammars (CFGs) using the HOL4 theorem prover. These straightforward pen and paper proofs easily understood from the text turn out to be much harder to mechanise. The informal observations in the text become deductive gaps ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. We describe the formalisation of the normal forms of context-free grammars (CFGs) using the HOL4 theorem prover. These straightforward pen and paper proofs easily understood from the text turn out to be much harder to mechanise. The informal observations in the text become deductive gaps

Formalising finfuns — generating code for functions as data from Isabelle/HOL

by Andreas Lochbihler - of Lecture Notes in Computer Science , 2009
"... Abstract. FinFuns are total functions that are constant except for a fi-nite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how to safely set up Isabelle’s code genera-tor such that operations like equality testing and quantification on Fin-Funs be ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Abstract. FinFuns are total functions that are constant except for a fi-nite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how to safely set up Isabelle’s code genera-tor such that operations like equality testing and quantification on Fin
Results 1 - 10 of 111