Sciweavers

376 search results - page 30 / 76
» Optimizing Pattern Matching Compilation by Program Transform...
Sort
View
LPAR
2004
Springer
15 years 5 months ago
Second-Order Matching via Explicit Substitutions
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
Flávio L. C. de Moura, Fairouz Kamareddine,...
VLSID
2004
IEEE
125views VLSI» more  VLSID 2004»
16 years 6 days ago
Energy-Optimizing Source Code Transformations for OS-driven Embedded Software
The increasing software content of battery-powered embedded systems has fueled much interest in techniques for developing energyefficient embedded software. Source code transforma...
Yunsi Fei, Srivaths Ravi, Anand Raghunathan, Niraj...
ESOP
2000
Springer
15 years 3 months ago
A Calculus for Link-Time Compilation
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...
Elena Machkasova, Franklyn A. Turbak
LREC
2008
90views Education» more  LREC 2008»
15 years 1 months ago
Navigating through Dense Annotation Spaces
Pattern matching, or querying, over annotations is a general purpose paradigm for inspecting, navigating, mining, and transforming annotation repositories--the common representati...
Branimir Boguraev, Mary S. Neff
LATIN
1998
Springer
15 years 4 months ago
Fast Two-Dimensional Approximate Pattern Matching
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Ricardo A. Baeza-Yates, Gonzalo Navarro