4722 search results - page 329 / 945 » Representation-independent program analysis |
163
click to vote
IOR
2006
15 years 6 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
171
click to vote
OOPSLA
2010
Springer
15 years 5 months ago
2010
Springer
We propose a new way to raise the level of discourse in the programming process: permit ambiguity, but manage it by linking it to unambiguous examples. This allows programming env...
140
click to vote
ITICSE
2006
ACM
16 years 17 days ago
2006
ACM
Identifying and managing students who experience difficulty with learning to program is a challenge for CS educators. In an attempt to answer the familiar question “What makes f...
192
click to vote
ISPD
2004
ACM
16 years 1 days ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
183
click to vote
CAV
2010
Springer
2010
Springer
Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs
15 years 8 months ago
Triggering errors in concurrent programs is a notoriously difficult task. A key reason for this is the behavioral complexity resulting from the large number of interleavings of op...