Sciweavers

257 search results - page 20 / 52
» Programming with narrowing: A tutorial
Sort
View
SLP
1994
121views more  SLP 1994»
13 years 9 months ago
CLP(Intervals) Revisited
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
Frédéric Benhamou, David A. McAllest...
IPPS
2007
IEEE
14 years 2 months ago
ExPert: Dynamic Analysis Based Fault Location via Execution Perturbations
We are designing dynamic analysis techniques to identify executed program statements where a fault lies, i.e. the fault candidate set. To narrow the set of statements in the fault...
Neelam Gupta, Rajiv Gupta
ENTCS
2007
104views more  ENTCS 2007»
13 years 7 months ago
Lazy Context Cloning for Non-Deterministic Graph Rewriting
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
IPPS
2006
IEEE
14 years 1 months ago
Empowering a helper cluster through data-width aware instruction selection policies
Narrow values that can be represented by less number of bits than the full machine width occur very frequently in programs. On the other hand, clustering mechanisms enable cost- a...
Osman S. Unsal, Oguz Ergin, Xavier Vera, Antonio G...
SIGSOFT
2002
ACM
14 years 8 months ago
Isolating cause-effect chains from computer programs
Consider the execution of a failing program as a sequence of program states. Each state induces the following state, up to the failure. Which variables and values of a program sta...
Andreas Zeller