4719 search results - page 234 / 944 » Newtonian program analysis |
176
click to vote
IWMM
2010
Springer
15 years 7 months ago
2010
Springer
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...
130
click to vote
LLC
2010
15 years 16 days ago
2010
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...
136
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
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...
168
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
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...
141
click to vote
ICSE
2007
IEEE-ACM
16 years 5 months ago
2007
IEEE-ACM
This paper presents Kato, a tool that implements a novel class of optimizations that are inspired by program slicing for imperative languages but are applicable to analyzable decl...