Results 1  10
of
1,273
Theorem Proving in HigherOrder Logic
"... The focus of this lecture series will be HOL, Church's higherorder logic, which is the core of many interactive theorem provers. We will cover the following topics: Foundations: HOL contains only simply typed lambda terms over equality and implication and a few inference rules for these consta ..."
Abstract
 Add to MetaCart
The focus of this lecture series will be HOL, Church's higherorder logic, which is the core of many interactive theorem provers. We will cover the following topics: Foundations: HOL contains only simply typed lambda terms over equality and implication and a few inference rules
Theorem Proving in Higher Order Logics
, 2003
"... Algebra in Type Theory with Dependent Records . . . 13 Xin Yu, Aleksey Nogin, Alexei Kopylov and Jason Hickey Implementing and Automating Basic Number Theory in MetaPRL Proof Assistant . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 Modal Linear Logic in Higher Order Logic  An Experiment with COQ . . 75 Mehrnoosh Sadrzadeh Representing RSL Specifications in Isabelle/HOL . . . . . . . . . . . . . . . . . . . . . . 95 Morton P. Lindegaard Verifying Functional Bulk Synchronouos Parallel Programs Using the Coq System
Theorem Proving in Higher Order Logics
, 2002
"... Syntax in Nuprl ::::::::::::::::::::::::::::::::::::::::::::: 23 Eli Barzilay, Stuart Allen DOVE: a Graphical Tool for the Analysis and Evaluation of Critical Systems :::::::::::::::::::::: 33 Tony Cant, Jim McCarthy, Brendan Mahony Formalising General Correctness ::::::::::::::::::::::::::::::: ..."
Abstract
 Add to MetaCart
Elsa L. Gunter, Yi Meng A HigherOrder System for Representing Metabolic Pathways ::::::::::::::::::::::::::::::::::: 112 Sara Kalvala HigherOrder Pattern Unification and Proof Irrelevance ::::::::::::::::::::::::::::::::::::::::: 121 Jason Reed AVerification of Rijndael in HOL
Formal Development of Processes by ModelChecking and Theorem Proving with FDR and HOLCSP
"... Abstract. Modelcheckers are highly specialized tools, geared towards one particular formal method. In contrast, theorem provers are flexible, versatile formal proof environments suitable for a wide variety of formal methods. Their strengths are complimentary, and hence their combination rewarding. ..."
Abstract
 Add to MetaCart
to prove, and the modelchecker can either show the property, or will fail. On the other hand, there are generalpurpose theorem provers, usually based on a powerful metalogic like higherorder logic or type theory, into which the formal method is embedded. A theorem prover assists the construction
Structuring and Automating Hardware Proofs in a HigherOrder TheoremProving Environment
 Formal Methods in System Design
, 1993
"... . In this article we present a structured approach to formal hardware verification by modelling circuits at the registertransfer level using a restricted form of higherorder logic. This restricted form of higherorder logic is sufficient for obtaining succinct descriptions of hierarchically design ..."
Abstract

Cited by 25 (8 self)
 Add to MetaCart
. In this article we present a structured approach to formal hardware verification by modelling circuits at the registertransfer level using a restricted form of higherorder logic. This restricted form of higherorder logic is sufficient for obtaining succinct descriptions of hierarchically
The HOL System LOGIC Preface
, 2012
"... This volume contains the description of the HOL system’s logic. It is one of four volumes making up the documentation for HOL: (i) LOGIC: a formal description of the higher order logic implemented by the HOL system. (ii) TUTORIAL: a tutorial introduction to HOL, with case studies. (iii) DESCRIPTION: ..."
Abstract
 Add to MetaCart
manual. The HOL system is designed to support interactive theorem proving in higher order logic (hence the acronym ‘HOL’). To this end, the formal logic is interfaced to a general purpose programming language (ML, for metalanguage) in which terms and theorems of the logic can be denoted, proof
The HOL System LOGIC Preface
, 2010
"... This volume contains the description of the HOL system’s logic. It is one of four volumes making up the documentation for HOL: (i) LOGIC: a formal description of the higher order logic implemented by the HOL system. (ii) TUTORIAL: a tutorial introduction to HOL, with case studies. (iii) DESCRIPTION: ..."
Abstract
 Add to MetaCart
manual. The HOL system is designed to support interactive theorem proving in higher order logic (hence the acronym ‘HOL’). To this end, the formal logic is interfaced to a general purpose programming language (ML, for metalanguage) in which terms and theorems of the logic can be denoted, proof
The HOL System LOGIC Preface
, 2009
"... This volume contains the description of the HOL system’s logic. It is one of four volumes making up the documentation for HOL: (i) LOGIC: a formal description of the higher order logic implemented by the HOL system. (ii) TUTORIAL: a tutorial introduction to HOL, with case studies. (iii) DESCRIPTION: ..."
Abstract
 Add to MetaCart
manual. The HOL system is designed to support interactive theorem proving in higher order logic (hence the acronym ‘HOL’). To this end, the formal logic is interfaced to a general purpose programming language (ML, for metalanguage) in which terms and theorems of the logic can be denoted, proof
Combining higher order abstract syntax with tactical theorem proving and (co)induction
 In TPHOLs ’02: Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
, 2002
"... Abstract. Combining Higher Order Abstract Syntax (HOAS) and induction is well known to be problematic. We have implemented a tool called Hybrid, within Isabelle HOL, which does allow object logics to be represented using HOAS, and reasoned about using tactical theorem proving in general and principl ..."
Abstract

Cited by 38 (16 self)
 Add to MetaCart
Abstract. Combining Higher Order Abstract Syntax (HOAS) and induction is well known to be problematic. We have implemented a tool called Hybrid, within Isabelle HOL, which does allow object logics to be represented using HOAS, and reasoned about using tactical theorem proving in general
Experience Factory.
 Encyclopedia of SE,
, 1994
"... INTRODUCTION Reuse of products, processes and experience originating from the system life cycle is seen today as a feasible solution to the problem of developing higher quality systems at a lower cost. In fact, quality improvement is very often achieved by reusing and modifying over and over the sa ..."
Abstract

Cited by 334 (21 self)
 Add to MetaCart
INTRODUCTION Reuse of products, processes and experience originating from the system life cycle is seen today as a feasible solution to the problem of developing higher quality systems at a lower cost. In fact, quality improvement is very often achieved by reusing and modifying over and over
Results 1  10
of
1,273