Sciweavers

1485 search results - page 140 / 297
» Whole Program Paths
Sort
View
POPL
2004
ACM
14 years 9 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen
SPAA
1995
ACM
14 years 21 days ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
FAC
2007
170views more  FAC 2007»
13 years 9 months ago
Are the Logical Foundations of Verifying Compiler Prototypes Matching user Expectations?
Abstract. The Verifying Compiler (VC) project proposals suggest that mainstream software developers are its targeted end-users. Like other software engineering efforts, the VC proj...
Patrice Chalin
CP
2009
Springer
14 years 9 months ago
An Interpolation Method for CLP Traversal
We consider the problem of exploring the search tree of a CLP goal in pursuit of a target property. Essential to such a process is a method of tabling to prevent duplicate explorat...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
XSYM
2005
Springer
84views Database» more  XSYM 2005»
14 years 2 months ago
Patterns and Types for Querying XML Documents
Among various proposals for primitives for deconstructing XML data two approaches seem to clearly stem from practise: path expressions, widely adopted by the database community, an...
Giuseppe Castagna