Sciweavers

4716 search results - page 156 / 944
» Iterative-free program analysis
Sort
View
120
Voted
DAC
2006
ACM
16 years 3 months ago
Efficient detection and exploitation of infeasible paths for software timing analysis
Accurate estimation of the worst-case execution time (WCET) of a program is important for real-time embedded software. Static WCET estimation involves program path analysis and ar...
Vivy Suhendra, Tulika Mitra, Abhik Roychoudhury, T...
117
Voted
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 3 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
86
Voted
ICSE
2003
IEEE-ACM
16 years 2 months ago
Fragment Class Analysis for Testing of Polymorphism in Java Software
Testing of polymorphism in object-oriented software may require coverage of all possible bindings of receiver classes and target methods at call sites. Tools that measure this cove...
Atanas Rountev, Ana Milanova, Barbara G. Ryder
PEPM
1995
ACM
15 years 6 months ago
Shape Analysis as a Generalized Path Problem
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
Thomas W. Reps
128
Voted
TGC
2010
Springer
15 years 8 days ago
Symbolic and Analytic Techniques for Resource Analysis of Java Bytecode
Recent work in resource analysis has translated the idea of amortised resource analysis to imperative languages using a program logic that allows mixing of assertions about heap sh...
David Aspinall, Robert Atkey, Kenneth MacKenzie, D...