Sciweavers

376 search results - page 31 / 76
» Optimizing Pattern Matching Compilation by Program Transform...
Sort
View
APLAS
2005
ACM
15 years 5 months ago
Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
Peter Vanbroekhoven, Gerda Janssens, Maurice Bruyn...
PLDI
2010
ACM
15 years 4 months ago
Bringing Extensibility to Verified Compilers
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
Zachary Tatlock, Sorin Lerner
SAC
2008
ACM
14 years 11 months ago
Optimizing code through iterative specialization
Code specialization is a way to obtain significant improvement in the performance of an application. It works by exposing values of different parameters in source code. The availa...
Minhaj Ahmad Khan, Henri-Pierre Charles, Denis Bar...
ICSM
2007
IEEE
15 years 6 months ago
Matching Control Flow of Program Versions
In many application areas, including piracy detection, software debugging and maintenance, situations arise in which there is a need for comparing two versions of a program that d...
Vijayanand Nagarajan, Rajiv Gupta, Matias Madou, X...
DLS
2008
213views Languages» more  DLS 2008»
15 years 1 months ago
A parsing machine for PEGs
Parsing Expression Grammar (PEG) is a recognition-based foundation for describing syntax that renewed interest in top-down parsing approaches. Generally, the implementation of PEG...
Sérgio Medeiros, Roberto Ierusalimschy