Sciweavers

1552 search results - page 49 / 311
» On the Complexity of Constant Propagation
Sort
View
ISSTA
2000
ACM
15 years 6 months ago
Which pointer analysis should I use?
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
Michael Hind, Anthony Pioli
TCS
1998
15 years 1 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 2 months ago
Decomposition of the NVALUE constraint
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
Christian Bessiere, George Katsirelos, Nina Narody...
SCAM
2008
IEEE
15 years 8 months ago
Change Impact Graphs: Determining the Impact of Prior Code Changes
The source code of a software system is in constant change. The impact of these changes spreads out across the software system and may lead to the sudden manifestation of failures...
Daniel M. Germán, Gregorio Robles, Ahmed E....
SMI
2006
IEEE
127views Image Analysis» more  SMI 2006»
15 years 8 months ago
Length Constrained Multiresolution Deformation for Surface Wrinkling
We present a method for deforming piecewise linear 3D curves with constant length constraint. We show how this constraint can be integrated into a multiresolution editing tool all...
Basile Sauvage, Stefanie Hahmann, Georges-Pierre B...