Sciweavers

4719 search results - page 181 / 944
» Newtonian program analysis
Sort
View
DAC
2006
ACM
16 years 5 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...
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 4 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
ICSE
2003
IEEE-ACM
16 years 4 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 8 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
CAV
2009
Springer
150views Hardware» more  CAV 2009»
16 years 4 months ago
Automated Analysis of Java Methods for Confidentiality
We address the problem of analyzing programs such as J2ME midlets for mobile devices, where a central correctness requirement concerns confidentiality of data that the user wants t...
Pavol Cerný, Rajeev Alur