Precise Call Graph Construction for OO Programs in the Presence of Virtual Functions
ICPP '97 Proceedings of the international Conference on Parallel Processing
Demand-Driven Construction of Call Graphs
CC '00 Proceedings of the 9th International Conference on Compiler Construction
Generalized structured programs and loop trees
Science of Computer Programming
Using mathematics to improve ada compiled code, part 2: the proof
Proceedings of the 2007 ACM international conference on SIGAda annual international conference
A dependence graph-based representation for test coverage analysis of object-oriented programs
ACM SIGSOFT Software Engineering Notes
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Optimal interprocedural program optimization: a new framework and its application
Optimal interprocedural program optimization: a new framework and its application
Analyses for the translation of OpenMP codes into SPMD style with array privatization
WOMPAT'03 Proceedings of the OpenMP applications and tools 2003 international conference on OpenMP shared memory parallel programming
Comparison of different impact analysis methods and programmer's opinion: an empirical study
Proceedings of the 8th International Conference on the Principles and Practice of Programming in Java
Flow-augmented call graph: a new foundation for taming API complexity
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Stacksplorer: call graph navigation helps increasing code maintenance efficiency
Proceedings of the 24th annual ACM symposium on User interface software and technology
Malware classification based on call graph clustering
Journal in Computer Virology
Using mathematics to improve ada compiled code
Ada-Europe'06 Proceedings of the 11th Ada-Europe international conference on Reliable Software Technologies
Language design and analyzability: a retrospective
Software—Practice & Experience
Function matching-based binary-level software similarity calculation
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Automatic generation of basis test paths using variable length genetic algorithm
Information Processing Letters
| Hi-index | 0.00 |
The proliferation of large software systems written in high level programming languages insures the utility of analysis programs which examine interprocedural communications. Often these analysis programs need to reduce the dynamic relations between procedures to a static data representation. This paper presents one such representation, a directed, acyclic graph named the call graph of a program. We delineate the programs representable by an acyclic call graph and present an algorithm for constructing it using the property that its nodes may be linearly ordered. We prove the correctness of the algorithm and discuss the results obtained from an implementation of the algorithm in the PFORT Verifier [1].