Sciweavers

4719 search results - page 50 / 944
» Newtonian program analysis
Sort
View
ESEC
1995
Springer
13 years 11 months ago
An Exploratory Study of Program Metrics as Predictors of Reachability Analysis Performance
This paper presents the results of an exploratory experiment investigating the use of program metrics to predict reachability graph size, reachability graph generation time, and d...
A. T. Chamillard
MP
2007
95views more  MP 2007»
13 years 7 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
ICSE
2000
IEEE-ACM
13 years 11 months ago
Component design of retargetable program analysis tools that reuse intermediate representations
Interactive program analysis tools are often tailored to one particular representation of programs, making adaptation to a new language costly. One way to ease adaptability is to ...
James Hayes, William G. Griswold, Stuart Moskovics
ICFP
2006
ACM
14 years 7 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
HVC
2005
Springer
112views Hardware» more  HVC 2005»
14 years 1 months ago
Dynamic Deadlock Analysis of Multi-threaded Programs
This paper presents a dynamic program analysis algorithm that can detect deadlock potentials in a multi-threaded program by examining a single execution trace, obtained by running ...
Saddek Bensalem, Klaus Havelund