TPHOL
1999
IEEE
14 years 3 months ago
1999
IEEE
Abstract. Intel is applying formal verification to various pieces of mathematical software used in Merced, the first implementation of the new IA-64 architecture. This paper discus...
TPHOL
1999
IEEE
14 years 3 months ago
1999
IEEE
Gandalf is a first-order resolution theorem-prover, optimized for speed and specializing in manipulations of large clauses. In this paper I describe GANDALF TAC, a HOL tactic that ...
TPHOL
1999
IEEE
14 years 3 months ago
1999
IEEE
Abstract. Isabelle/HOL has recently acquired new versions of definitional packages for inductive datatypes and primitive recursive functions. In contrast to its predecessors and mo...
TPHOL
1999
IEEE
14 years 3 months ago
1999
IEEE
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. ...
TPHOL
1999
IEEE
14 years 3 months ago
1999
IEEE
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
FLOPS
1999
Springer
14 years 3 months ago
1999
Springer
We present a simple generic framework to solve constraints on any domain (finite or infinite) which has a lattice structure. The approach is based on the use of a single constrai...
FLOPS
1999
Springer
14 years 3 months ago
1999
Springer
FLOPS
1999
Springer
14 years 3 months ago
1999
Springer
FLOPS
1999
Springer
14 years 3 months ago
1999
Springer
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
FLOPS
1999
Springer
14 years 3 months ago
1999
Springer
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...