Sciweavers

11214 search results - page 1926 / 2243
» Just-in-time data structures
Sort
View
CONCUR
2007
Springer
16 years 29 days ago
Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures
We present a fixpoint-based algorithm for context-sensitive interprocedural kill/gen-analysis of programs with thread creation. Our algorithm is precise up to abstraction of sync...
Peter Lammich, Markus Müller-Olm
CP
2007
Springer
16 years 29 days ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
230
Voted
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
16 years 29 days ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
FASE
2007
Springer
16 years 29 days ago
Contract-Driven Development
Although unit tests are recognized as an important tool in software development, programmers prefer to write code, rather than unit tests. Despite the emergence of tools like JUni...
Bertrand Meyer
FASE
2007
Springer
16 years 29 days ago
EQ-Mine: Predicting Short-Term Defects for Software Evolution
We use 63 features extracted from sources such as versioning and issue tracking systems to predict defects in short time frames of two months. Our multivariate approach covers aspe...
Jacek Ratzinger, Martin Pinzger, Harald Gall
« Prev « First page 1926 / 2243 Last » Next »