Sciweavers

578 search results - page 35 / 116
» Analysis of Programs with Exception-Handling Constructs
Sort
View
CPAIOR
2007
Springer
14 years 2 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
PLDI
2006
ACM
14 years 2 months ago
An experimental analysis of self-adjusting computation
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...
Umut A. Acar, Guy E. Blelloch, Matthias Blume, Kan...
CC
2010
Springer
150views System Software» more  CC 2010»
14 years 3 months ago
Practical Extensions to the IFDS Algorithm
Abstract. This paper presents four extensions to the Interprocedural Finite Distributive Subset (IFDS) algorithm that make it applicable to a wider class of analysis problems. IFDS...
Nomair A. Naeem, Ondrej Lhoták, Jonathan Ro...
SIGSOFT
2004
ACM
14 years 2 months ago
Variability management with feature-oriented programming and aspects
This paper presents an analysis of feature-oriented and aspectoriented modularization approaches with respect to variability management as needed in the context of system families...
Mira Mezini, Klaus Ostermann
PPOPP
2005
ACM
14 years 2 months ago
Teleport messaging for distributed stream programs
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
William Thies, Michal Karczmarek, Janis Sermulins,...