The impact of interprocedural analysis and optimization in the Rn programming environment
ACM Transactions on Programming Languages and Systems (TOPLAS)
Interprocedural optimization: eliminating unnecessary recompilation
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
A practical interprocedural data flow analysis algorithm
Communications of the ACM
A program data flow analysis procedure
Communications of the ACM
Efficient computation of flow insensitive interprocedural summary information
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
A precise inter-procedural data flow algorithm
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An efficient way to find the side effects of procedure calls and the aliases of variables
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
ACM Letters on Programming Languages and Systems (LOPLAS)
Constructing call multigraphs using dependence graphs
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Context-sensitive interprocedural points-to analysis in the presence of function pointers
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
An empirical study of static call graph extractors
Proceedings of the 18th international conference on Software engineering
Call graph construction in object-oriented languages
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
An empirical study of static call graph extractors
ACM Transactions on Software Engineering and Methodology (TOSEM)
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
Interprocedural pointer alias analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
A framework for call graph construction algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Interprocedural side-effect analysis in linear time
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Automatic translation of software binaries onto FPGAs
Proceedings of the 41st annual Design Automation Conference
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
Bridging the gap between technical and social dependencies with Ariadne
eclipse '05 Proceedings of the 2005 OOPSLA workshop on Eclipse technology eXchange
Linux kernel customization for embedded systems by using call graph approach
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Automatic extraction of function bodies from software binaries
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Precise static type analysis for object oriented programs
ACM SIGPLAN Notices
Proceedings of the 2007 international ACM conference on Supporting group work
An overview of a compiler for mapping software binaries to hardware
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Optimal interprocedural program optimization: a new framework and its application
Optimal interprocedural program optimization: a new framework and its application
SEAFOOD'07 Proceedings of the 1st international conference on Software engineering approaches for offshore and outsourced development
| Hi-index | 0.00 |
An algorithm for constructing a precise call multigraph for languages that permit procedure parameters, extending the method of B. Ryder for handling recursion, is presented. If it is assumed that there is a constant upper bound on the number of procedure parameters to any procedure in the program, then the algorithm is polynomial in the total number of procedures in the program.