Sciweavers

157 search results - page 6 / 32
» Presenting Proofs with Adapted Granularity
Sort
View
JAR
2007
77views more  JAR 2007»
13 years 7 months ago
Superposition-based Equality Handling for Analytic Tableaux
We present a variant of the basic ordered superposition rules to handle equality in an analytic free-variable tableau calculus. We prove completeness of this calculus by an adaptat...
Martin Giese
POPL
2010
ACM
14 years 4 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
LCPC
1993
Springer
13 years 11 months ago
Maximizing Loop Parallelism and Improving Data Locality via Loop Fusion and Distribution
Abstract. Loop fusion is a program transformation that merges multiple loops into one. It is e ective for reducing the synchronization overhead of parallel loops and for improving ...
Ken Kennedy, Kathryn S. McKinley
ICPP
2008
IEEE
14 years 1 months ago
Solving Large, Irregular Graph Problems Using Adaptive Work-Stealing
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
Guojing Cong, Sreedhar B. Kodali, Sriram Krishnamo...
FROCOS
2009
Springer
14 years 2 months ago
Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
In an attempt to improve automation capabilities in the Coq proof assistant, we develop a tactic for the propositional fragment based on the DPLL procedure. Although formulas natur...
Stéphane Lescuyer, Sylvain Conchon