Sciweavers

TPHOL
2000
IEEE
13 years 11 months ago
Formal Verification of IA-64 Division Algorithms
The IA-64 architecture defers floating point and integer division to software. To ensure correctness and maximum efficiency, Intel provides a number of recommended algorithms which...
John Harrison
TPHOL
2000
IEEE
13 years 11 months ago
Specification and Verification of a Steam-Boiler with Signal-Coq
Mickaël Kerboeuf, David Nowak, Jean-Pierre Ta...
TPHOL
2000
IEEE
13 years 11 months ago
Verified Optimizations for the Intel IA-64 Architecture
This paper outlines a formal model of the Intel IA-64 architecture, and explains how this model can be used to verify the correctness of assembly-level code optimizations. The form...
Jim Grundy
TPHOL
2000
IEEE
13 years 11 months ago
Equational Reasoning via Partial Reflection
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
TPHOL
2000
IEEE
13 years 12 months ago
TAS - A Generic Window Inference System
Christoph Lüth, Burkhart Wolff
TPHOL
2000
IEEE
13 years 12 months ago
Fast Tactic-Based Theorem Proving
Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose metalanguage to implement both general-purpose reasonin...
Jason Hickey, Aleksey Nogin
TPHOL
2000
IEEE
13 years 12 months ago
Proving ML Type Soundness Within Coq
We verify within the Coq proof assistant that ML typing is sound with respect to the dynamic semantics. We prove this property in the framework of a big step semantics and also in ...
Catherine Dubois
TPHOL
2000
IEEE
13 years 12 months ago
Routing Information Protocol in HOL/SPIN
We provide a proof using HOL and SPIN of convergence for the Routing Information Protocol (RIP), an internet protocol based on distance vector routing. We also calculate a sharp re...
Karthikeyan Bhargavan, Carl A. Gunter, Davor Obrad...
TPHOL
2000
IEEE
13 years 12 months ago
Proof Terms for Simply Typed Higher Order Logic
Abstract. This paper presents proof terms for simply typed, intuitionistic higher order logic, a popular logical framework. Unification-based algorithms for the compression and re...
Stefan Berghofer, Tobias Nipkow