Sciweavers

394 search results - page 51 / 79
» Formal polytypic programs and proofs
Sort
View
CADE
2010
Springer
15 years 7 months ago
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic
Craig interpolation has become a versatile tool in formal verification, for instance to generate intermediate assertions for safety analysis of programs. Interpolants are typically...
Angelo Brillout, Daniel Kroening, Philipp Rüm...
IPPS
1999
IEEE
15 years 10 months ago
Mechanical Verification of a Garbage Collector
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
Klaus Havelund
ICFP
1997
ACM
15 years 10 months ago
Foundations for the Implementation of Higher-Order Subtyping
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
Karl Crary
UTP
2010
15 years 4 months ago
Unifying Theories in Isabelle/HOL
In this paper, we present various extensions of Isabelle/HOL by theories that are essential for several formal methods. First, we explain how we have developed an Isabelle/HOL theo...
Abderrahmane Feliachi, Marie-Claude Gaudel, Burkha...
CORR
2008
Springer
105views Education» more  CORR 2008»
15 years 6 months ago
Certifying floating-point implementations using Gappa
High confidence in floating-point programs requires proving numerical properties of final and intermediate values. One may need to guarantee that a value stays within some range, ...
Florent de Dinechin, Christoph Quirin Lauter, Guil...