Sciweavers

558 search results - page 34 / 112
» Compiling Resources in a Linear Logic Programming Language
Sort
View
CSCLP
2004
Springer
14 years 4 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
TOOLS
2008
IEEE
14 years 5 months ago
Guarded Program Transformations Using JTL
There is a growing research interest in employing the logic paradigm for making queries on software in general, and OOP software in particular. We describes a side-effect-free tech...
Tal Cohen, Joseph Gil, Itay Maman
POPL
2008
ACM
14 years 11 months ago
Formal verification of translation validators: a case study on instruction scheduling optimizations
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. This approach can be used in a verifie...
Jean-Baptiste Tristan, Xavier Leroy
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
14 years 4 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
ASPLOS
1992
ACM
14 years 2 months ago
Access Normalization: Loop Restructuring for NUMA Compilers
: In scalable parallel machines, processors can make local memory accesses much faster than they can make remote memory accesses. In addition, when a number of remote accesses must...
Wei Li, Keshav Pingali