556 search results - page 18 / 112 » Pair Programming: Not for Everyone |
AGP
1998
IEEE
14 years 1 months ago
1998
IEEE
The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitabl...
ICLP
2009
Springer
14 years 9 months ago
2009
Springer
We present an implementation of table constraints in CLP(FD). For binary constraints, the supports of each value are represented as a finite-domain variable, and action rules are u...
KBSE
2010
IEEE
13 years 7 months ago
2010
IEEE
Named constants are used heavily in operating systems code, both as internal flags and in interactions with devices. Decision making within an operating system thus critically de...
PLDI
2012
ACM
11 years 11 months ago
2012
ACM
Chimera1 uses a new hybrid program analysis to provide deterministic replay for commodity multiprocessor systems. Chimera leverages the insight that it is easy to provide determin...
BMCBI
2010
13 years 9 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...