Abstract. I describe the implementation of two complete decision procedures for integer Presburger arithmetic in the HOL theorem-proving system. The first procedure is Cooper’s algorithm, the second, the Omega Test. Between them, the algorithms illustrate three different implementation techniques in a fully expansive system.
I would like to thank my supervisors, professors Nelma Moreira and Sabine Broda, for their guidance,...
As the world becomes increasingly reliant on technology and the technology becomes increasingly comp...
The aim of these lectures is to give a clear and explicit overview of the most important decidable a...
In this paper we describe an environment for reasoning about the reals which combines the rigour of ...
Abstract. Building on a simple construction of the complex numbers and a proof of the Fundamental Th...
. Computer algebra systems are extremely powerful and flexible, but often give results which require...
Efficient decision procedures for arithmetic play a very important role in formal verification. In ...
In this paper, we propose a generic mechanism for extending decision procedures by means of a lemma ...
The focus of this lecture series will be HOL, Church's higher-order logic, which is the core of...
This paper presents Hoarescope, a program that helps to prove partial correctness assertions of AL(N...
AbstractThe realization of inference rules as the primitive operations of a type “theorem” in a type...
We describe how proof rules for three advanced refinement features are mechanically verified using t...
This article formalizes quantifier elimination procedures for dense linear orders, linear real arith...
An early chapter in the development of decision procedures concerns the theory of Presburger arithme...
In this report, we present the complete HOL theory for the Standard Uniform random variable. The Sta...
I would like to thank my supervisors, professors Nelma Moreira and Sabine Broda, for their guidance,...
As the world becomes increasingly reliant on technology and the technology becomes increasingly comp...
The aim of these lectures is to give a clear and explicit overview of the most important decidable a...
In this paper we describe an environment for reasoning about the reals which combines the rigour of ...
Abstract. Building on a simple construction of the complex numbers and a proof of the Fundamental Th...
. Computer algebra systems are extremely powerful and flexible, but often give results which require...
Efficient decision procedures for arithmetic play a very important role in formal verification. In ...
In this paper, we propose a generic mechanism for extending decision procedures by means of a lemma ...
The focus of this lecture series will be HOL, Church's higher-order logic, which is the core of...
This paper presents Hoarescope, a program that helps to prove partial correctness assertions of AL(N...
AbstractThe realization of inference rules as the primitive operations of a type “theorem” in a type...
We describe how proof rules for three advanced refinement features are mechanically verified using t...
This article formalizes quantifier elimination procedures for dense linear orders, linear real arith...
An early chapter in the development of decision procedures concerns the theory of Presburger arithme...
In this report, we present the complete HOL theory for the Standard Uniform random variable. The Sta...
I would like to thank my supervisors, professors Nelma Moreira and Sabine Broda, for their guidance,...
As the world becomes increasingly reliant on technology and the technology becomes increasingly comp...
The aim of these lectures is to give a clear and explicit overview of the most important decidable a...
DOI
Add to ORKG