Sciweavers

2200 search results - page 73 / 440
» The Generalized Pignistic Transformation
Sort
View
POPL
2004
ACM
14 years 9 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
MICRO
2012
IEEE
285views Hardware» more  MICRO 2012»
11 years 11 months ago
Automatic Extraction of Coarse-Grained Data-Flow Threads from Imperative Programs
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
Feng Li, Antoniu Pop, Albert Cohen
CIKM
2004
Springer
14 years 2 months ago
Extending and inferring functional dependencies in schema transformation
We study the representation, derivation and utilization of a special kind of constraints in multidatabase systems. A major challenge is when component database schemas are schemat...
Qi He, Tok Wang Ling
CORR
2007
Springer
194views Education» more  CORR 2007»
13 years 9 months ago
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
Markus Püschel, José M. F. Moura
CASES
2006
ACM
14 years 3 months ago
Code transformation strategies for extensible embedded processors
Embedded application requirements, including high performance, low power consumption and fast time to market, are uncommon in the broader domain of general purpose applications. I...
Paolo Bonzini, Laura Pozzi