Sciweavers

73 search results - page 8 / 15
» plp: A Generic Compiler for Ordered Logic Programs
Sort
View
ICS
2005
Tsinghua U.
14 years 2 months ago
Low-power, low-complexity instruction issue using compiler assistance
In an out-of-order issue processor, instructions are dynamically reordered and issued to function units in their dataready order rather than their original program order to achiev...
Madhavi Gopal Valluri, Lizy Kurian John, Kathryn S...
IPPS
1999
IEEE
14 years 1 months ago
Marshaling/Demarshaling as a Compilation/Interpretation Process
Marshaling is the process through which structured values are serialized into a stream of bytes; demarshaling converts this stream of bytes back to structured values. Most often, ...
Christian Queinnec
CC
2001
Springer
177views System Software» more  CC 2001»
14 years 1 months ago
Imperative Program Transformation by Rewriting
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
David Lacey, Oege de Moor
GPCE
2005
Springer
14 years 2 months ago
Optimizing Marshalling by Run-Time Program Generation
Saving the internal data of an application in an external form is called marshalling. A generic marshaller is difficult to optimize because the format of the data that will be mars...
Baris Aktemur, Joel Jones, Samuel N. Kamin, Lars C...
PLILP
1994
Springer
14 years 24 days ago
clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving
We present the design and the implementation of clp(B): a boolean constraint solver inside the Constraint Logic Programming paradigm. This solver is based on local propagation meth...
Philippe Codognet, Daniel Diaz