Abstract
The program dependence graph (PDG) represents data and control dependences between statements in a program. The PDG is a useful intermediate representation for compiler code optimizations, because compiler code optimizations mostly rely on data and control dependence information. However, the validity of optimization methods based on PDGs has not been well studied. In order to justify optimization based on PDGs, it is necessary to introduce a formal semantics of PDGs. This paper presents an operational semantics of PDGs corresponding to programs which have an unstructured control flow. Our PDG semantics is equivalent to sequential program semantics in the sense that a CFG and the corresponding PDG perform the same computation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baxter, W., III Bauer, H.R.: The program dependence graph and vectorization. In: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 1–11. ACM Press, New York (1989)
Cartwright, E., Felleisen, M.: The semantics of program dependence. In: Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, pp. 13–27. ACM Press, New York (1989)
Das, M.: Partial evaluation using dependence graphs. PhD thesis, Supervisor-Thomas W. Reps (1998)
Ferrante, J., Ottenstein, K.J.: A program form based on data dependency in predicate regions. In: Principles of Programming Languages, pp. 217–236 (1983)
Ferrante, J., Ottenstein, K.J., Warren, J.D.: The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems 9(3), 319–349 (1987)
Parsons-Selke, R.: A rewriting semantics for program dependence graphs. In: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 12–24. ACM Press, New York (1989)
Podgurski, A., Clarke, L.A.: A formal model of program dependences and its implications for software testing, debugging, and maintenance. IEEE Transactions on Software Engineering 16(9), 965–979 (1990)
Ramalingam, G., Reps, T.: Semantics of program representation graphs. Technical Report CS-TR-1989-900 (1989)
Simons, B., Alpern, D., Ferrante, J.: A foundation for sequentializing parallel code. In: SPAA 1990. Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, pp. 350–359. ACM Press, New York (1990)
Steensgaard, B.: Sequentializing program dependence graphs for irreducible programs. Technical Report MSR-TR-93-14, Redmond, WA (1993)
Warren, J.: A hierarchical basis for reordering transformations. In: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp. 272–282. ACM Press, New York (1984)
Zeng, J., Soviani, C., Edwards, S.A.: Generating fast code from concurrent program dependence graphs. In: LCTES 2004. Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems, pp. 175–181. ACM Press, New York (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ito, S., Hagihara, S., Yonezaki, N. (2007). An Operational Semantics of Program Dependence Graphs for Unstructured Programs. In: Okada, M., Satoh, I. (eds) Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues. ASIAN 2006. Lecture Notes in Computer Science, vol 4435. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77505-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-77505-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77504-1
Online ISBN: 978-3-540-77505-8
eBook Packages: Computer ScienceComputer Science (R0)