Sciweavers

193 search results - page 2 / 39
» Automatic Parallelization and Optimization of Programs by Pr...
Sort
View
IPPS
2002
IEEE
15 years 2 months ago
Proving Self-Stabilization with a Proof Assistant
We present a formalization of a proof of self-stabilization in the Coq proof assistant. Coq is a program allowing to define mathematical objects and properties, and to make proof...
Pierre Courtieu
PLDI
2003
ACM
15 years 2 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
81
Voted
ICTAC
2004
Springer
15 years 2 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
96
Voted
JUCS
2006
131views more  JUCS 2006»
14 years 9 months ago
Verification of CRWL Programs with Rewriting Logic
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
José Miguel Cleva, Isabel Pita
126
Voted
AGTIVE
2007
Springer
15 years 3 months ago
Graph Rewriting for Hardware Dependent Program Optimizations
We present a compiler internal program optimization that uses graph rewriting. This optimization enables the compiler to automatically use rich instructions (such as SIMD instructi...
Andreas Schösser, Rubino Geiß