Sciweavers

53 search results - page 3 / 11
» Precise Call Graphs for C Programs with Function Pointers
Sort
View
ICFP
2007
ACM
14 years 5 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
SIGSOFT
2009
ACM
14 years 6 months ago
Static data race detection for concurrent programs with asynchronous calls
A large number of industrial concurrent programs are being designed based on a model which combines threads with event-based communication. These programs consist of several threa...
Vineet Kahlon, Nishant Sinha, Erik Kruus, Yun Zhan...
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
13 years 11 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet
PLDI
2006
ACM
13 years 11 months ago
SAFECode: enforcing alias analysis for weakly typed languages
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...
Dinakar Dhurjati, Sumant Kowshik, Vikram S. Adve
PLDI
2004
ACM
13 years 11 months ago
Symbolic pointer analysis revisited
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...
Jianwen Zhu, Silvian Calman