Sciweavers

6960 search results - page 282 / 1392
» Continuity Analysis of Programs
Sort
View
SIGSOFT
2007
ACM
16 years 4 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
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
168
Voted
PEPM
1995
ACM
15 years 7 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