Sciweavers

4725 search results - page 220 / 945
» Dependence-Based Program Analysis
Sort
View
POPL
1994
ACM
15 years 10 months ago
An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph
We present a new incremental algorithm for the problem of maintaining the dominator tree of a reducible flowgraph as the flowgraph undergoes changes such as the insertion and dele...
G. Ramalingam, Thomas W. Reps
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
15 years 8 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
LLC
2010
15 years 1 months ago
Quantified Conditionals and Compositionality
The interpretation of conditionals in the scope of a quantifier (as in `No student will succeed if he goofs off') presents a troubling puzzle. Either we are forced to abandon...
Janneke Huitink
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
16 years 6 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
179
Voted
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 6 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer