Sciweavers

13383 search results - page 20 / 2677
» Abstractions from proofs
Sort
View
POPL
2010
ACM
14 years 7 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala
CADE
2010
Springer
13 years 8 months ago
Terminating Tableaux for Hybrid Logic with Eventualities
x-free and employs a novel clausal form that abstracts away from propositional reasoning. It comes with an elegant correctness proof. We discuss some optimizations for decision pro...
Mark Kaminski, Gert Smolka
ICML
1998
IEEE
14 years 10 months ago
Intra-Option Learning about Temporally Abstract Actions
tion Learning about Temporally Abstract Actions Richard S. Sutton Department of Computer Science University of Massachusetts Amherst, MA 01003-4610 rich@cs.umass.edu Doina Precup D...
Richard S. Sutton, Doina Precup, Satinder P. Singh
HPCA
2006
IEEE
14 years 10 months ago
BulletProof: a defect-tolerant CMP switch architecture
As silicon technologies move into the nanometer regime, transistor reliability is expected to wane as devices become subject to extreme process variation, particle-induced transie...
Kypros Constantinides, Stephen Plaza, Jason A. Blo...
TYPES
2000
Springer
14 years 1 months ago
A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg