Sciweavers

4355 search results - page 145 / 871
» From Interpretation to Compilation
Sort
View
134
Voted
CODES
1999
IEEE
15 years 8 months ago
A unified formal model of ISA and FSMD
In this paper, we develop a formal framework to widen the scope of retargetable compilation. The goal is achieved by the unification of architectural models for both the processor...
Jianwen Zhu, Daniel Gajski
161
Voted
JAR
2010
160views more  JAR 2010»
15 years 2 months ago
Declarative Representation of Proof Terms
Abstract. We present a declarative language inspired by the pseudonatural language used in Matita for the explanation of proof terms. We show how to compile the language to proof t...
Claudio Sacerdoti Coen
PASTE
2005
ACM
15 years 9 months ago
Representation-independent program analysis
Program analysis has many applications in software engineering and high-performance computation, such as program understanding, debugging, testing, reverse engineering, and optimi...
Michelle Mills Strout, John M. Mellor-Crummey, Pau...
LCTRTS
2005
Springer
15 years 9 months ago
Generation of permutations for SIMD processors
Short vector (SIMD) instructions are useful in signal processing, multimedia, and scientific applications. They offer higher performance, lower energy consumption, and better res...
Alexei Kudriavtsev, Peter M. Kogge
168
Voted
PPDP
2005
Springer
15 years 9 months ago
Formal validation of pattern matching code
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re...