Sciweavers

173 search results - page 10 / 35
» Interprocedural analysis of asynchronous programs
Sort
View
TAPSOFT
1997
Springer
15 years 3 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
ADAEUROPE
2008
Springer
15 years 6 months ago
A Framework for CFG-Based Static Program Analysis of Ada Programs
Abstract. The control flow graph is the basis for many code optimisation and analysis techniques. We introduce a new framework for the construction of powerful CFG-based represent...
Raul Fechete, Georg Kienesberger, Johann Blieberge...
95
Voted
ICSM
1998
IEEE
15 years 3 months ago
Analysis of Programs with Exception-Handling Constructs
Analysis techniques, such as control-flow, data-flow, and control-dependence, are used for a variety of maintenance tasks, including regression testing, dynamic execution profilin...
Saurabh Sinha, Mary Jean Harrold
LCPC
1999
Springer
15 years 3 months ago
An Empirical Study of Function Pointers Using SPEC Benchmarks
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...
Ben-Chung Cheng, Wen-mei W. Hwu
115
Voted
LCPC
2005
Springer
15 years 5 months ago
Concurrency Analysis for Parallel Programs with Textually Aligned Barriers
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
Amir Kamil, Katherine A. Yelick