Skip to search formSkip to main contentSkip to account menu

HOL (proof assistant)

Known as: HOL theorem prover family, HOL, HOL4 
HOL (Higher Order Logic) denotes a family of interactive theorem proving systems usingsimilar (higher-order) logics and implementation strategies… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Abstract data typeCommon LispGNU Common LispHOL Light

Broader (1)

Logic in computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
HOL with Definitions: Semantics, Soundness, and a Verified Implementation
We present a mechanised semantics and soundness proof for the HOL Light kernel including its definitional principles, extending… 
2011
2011
Automated Formal Verification of the TTEthernet Synchronization Quality
Clock synchronization is the foundation of distributed realtime architectures such as the Timed-Triggered Architecture… 
Highly Cited
2010
Highly Cited
2010
The Isabelle Collections Framework
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle… 
2009
2009
Opportunistic CSMA/CA for achieving multi-user diversity in wireless LAN
The throughput of an IEEE 802.11 network decreases as the number of users increases because of the increased collision… 
2008
2008
Model-Based Firewall Conformance Testing
Firewalls are a cornerstone of todays security infrastructure for networks. Their configuration, implementing a firewall policy… 
2002
2002
Integrating HOL-CASL into the Development Graph Manager MAYA
For the recently developed specification language CASL, there exist two different kinds of proof support: While HOL-Casl has its… 
1997
1997
Derivation and Use of Induction Schemes in Higher-Order Logic
We discuss how to formally derive induction schemes for recursively defined functions in higher order logic. The functions are… 
1993
1993
Reducing the Variance of Sojourn times in Queueing Networks with Overtaking
In a queueing network with overtaking, the probabilistic eeects entailed by a customer propagate in such a manner that the… 
1993
1993
A Broader Class of Trees for Recursive Type Definitions for HOL
In this paper we describe the construction in Hol of the inductive type of arbitrarily branching labeled trees. Such a type is… 
1990
1990
Queueing strategies for multicast packet switching
  • J. HuiT. Renner
  • [Proceedings] GLOBECOM '90: IEEE Global…
  • 1990
  • Corpus ID: 61869058
The authors consider multicast packet switching where an input may send the same packet to many outputs within an ATM… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)