research-article

Open access

On the computation of interprocedural weak control closure

Authors:

Abu Naser Masud,

Björn LisperAuthors Info & Claims

CC 2022: Proceedings of the 31st ACM SIGPLAN International Conference on Compiler Construction

Pages 65 - 76

https://doi.org/10.1145/3497776.3517782

Published: 18 March 2022 Publication History

Abstract

Many program analysis techniques depend on capturing the control dependencies of the program. Most existing control dependence algorithms either compute intraprocedural control dependencies only, or they compute control dependence relations that are not precise in general including nonterminating systems. Weak control closure (WCC) subsumes all known nontermination insensitive control dependence relations, including those that are appropriate for nonterminating systems. In this paper, we provide the first formal development of an algorithm to compute the WCC for interprocedural programs capturing the weak form of interprocedural control dependencies. The method is widely applicable due to the generality of WCC. Theorems on the theoretical results of soundness, precision, and the worst-case complexity of our method are also included. We have compared our algorithm with a WCC computation algorithm based on a state-of-the-art interprocedural control dependence computation algorithm. The latter algorithm loses soundness, and we improve the precision by 15.21% on all our experimental benchmarks. This empirical evidence suggests that our algorithm is more effective for any client application of WCC requiring interprocedural program analysis.

References

[1]

Torben Amtoft. 2008. Slicing for modern program structures: a theory for eliminating irrelevant loops. Inf. Process. Lett., 106, 2 (2008), 45–51. https://doi.org/10.1016/j.ipl.2007.10.002

Digital Library

[2]

Gianfranco Bilardi and Keshav Pingali. 1996. A Framework for Generalized Control Dependence. SIGPLAN Not., 31, 5 (1996), May, 291–300. issn:0362-1340 https://doi.org/10.1145/249069.231435

Digital Library

[3]

James Bucek, Klaus-Dieter Lange, and Jóakim v. Kistowski. 2018. SPEC CPU2017: Next-Generation Compute Benchmark. In Companion of the 2018 ACM/SPEC International Conference on Performance Engineering (ICPE ’18). ACM, New York, NY, USA. 41–42. isbn:978-1-4503-5629-9 https://doi.org/10.1145/3185768.3185771

Digital Library

[4]

S. Danicic, R. Barraclough, M. Harman, J. D. Howroyd, Á. Kiss, and M. Laurence. 2011. A unifying theory of control dependence and its application to arbitrary program structures. Theoretical Computer Science, 412, 49 (2011), 6809– 6842. https://doi.org/10.1016/j.tcs.2011.08.033

Digital Library

[5]

Dorothy E. Denning and Peter J. Denning. 1977. Certification of Programs for Secure Information Flow. Commun. ACM, 20, 7 (1977), July, 504–513. issn:0001-0782 https://doi.org/10.1145/359636.359712

Digital Library

[6]

Jeanne Ferrante, Karl J. Ottenstein, and Joe D. Warren. 1987. The Program Dependence Graph and Its Use in Optimization. ACM Trans. Program. Lang. Syst., 9, 3 (1987), July, 319–349. issn:0164-0925 https://doi.org/10.1145/24039.24041

Digital Library

[7]

Husni Khanfar, Björn Lisper, and Abu Naser Masud. 2015. Static Backward Program Slicing for Safety-Critical Systems. In Reliable Software Technologies – Ada-Europe 2015, Juan Antonio de la Puente and Tullio Vardanega (Eds.). Springer International Publishing, Cham. 50–65. https://doi.org/10.1007/978-3-319-19584-1_4

[8]

J. Krinke. 2001. Identifying similar code with program dependence graphs. In Proceedings Eighth Working Conference on Reverse Engineering. 301–309. https://doi.org/10.1109/WCRE.2001.957835

[9]

Chris Lattner and Vikram Adve. 2004. The LLVM Compiler Framework and Infrastructure Tutorial. In LCPC’04 Mini Workshop on Compiler Research Infrastructures. West Lafayette, Indiana. https://doi.org/10.1007/11532378_2

Digital Library

[10]

Jean-Christophe Léchenet, Nikolai Kosmatov, and Pascale Le Gall. 2018. Fast Computation of Arbitrary Control Dependencies. In Fundamental Approaches to Software Engineering, Alessandra Russo and Andy Schürr (Eds.). Springer International Publishing, Cham. 207–224. isbn:978-3-319-89363-1 https://doi.org/10.1007/978-3-319-89363-1_12

[11]

Björn Lisper, Abu Naser Masud, and Husni Khanfar. 2015. Static Backward Demand-Driven Slicing. In Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation (PEPM ’15). ACM, New York, NY, USA. 115–126. https://doi.org/10.1145/2678015.2682538

Digital Library

[12]

J. P. Loyall and S. A. Mathisen. 1993. Using dependence analysis to support the software maintenance process. In 1993 Conference on Software Maintenance. 282–291. https://doi.org/10.1109/ICSM.1993.366934

[13]

Abu Naser Masud. 2020. Simple and Efficient Computation of Minimal Weak Control Closure. In Static Analysis, David Pichardie and Mihaela Sighireanu (Eds.). Springer International Publishing, Cham. 200–222. https://doi.org/10.1007/978-3-030-65474-0_10

Digital Library

[14]

Abu Naser Masud. 2022. Efficient computation of minimal weak and strong control closure. Journal of Systems and Software, 184 (2022), 111140. issn:0164-1212 https://doi.org/10.1016/j.jss.2021.111140

Digital Library

[15]

Abu Naser Masud and Björn Lisper. 2021. Semantic Correctness of Dependence-Based Slicing for Interprocedural, Possibly Nonterminating Programs. ACM Trans. Program. Lang. Syst., 42, 4 (2021), Article 19, Jan., 56 pages. issn:0164-0925 https://doi.org/10.1145/3434489

Digital Library

[16]

A. Podgurski and L. A. Clarke. 1990. A Formal Model of Program Dependences and Its Implications for Software Testing, Debugging, and Maintenance. IEEE Trans. Softw. Eng., 16, 9 (1990), Sept., 965–979. issn:0098-5589 https://doi.org/10.1109/32.58784

Digital Library

[17]

Reese T. Prosser. 1959. Applications of Boolean Matrices to the Analysis of Flow Diagrams. In Papers Presented at the December 1-3, 1959, Eastern Joint IRE-AIEE-ACM Computer Conference (IRE-AIEE-ACM ’59 (Eastern)). ACM, New York, NY, USA. 133–138. https://doi.org/10.1145/1460299.1460314

Digital Library

[18]

Venkatesh Prasad Ranganath, Torben Amtoft, Anindya Banerjee, John Hatcliff, and Matthew B. Dwyer. 2005. A New Foundation for Control Dependence and Slicing for Modern Program Structures. In European Symposium on Programming (LNCS, Vol. 3444). Springer-Verlag, 77–93. https://doi.org/10.1007/978-3-540-31987-0_7

Digital Library

[19]

Venkatesh Prasad Ranganath, Torben Amtoft, Anindya Banerjee, John Hatcliff, and Matthew B. Dwyer. 2007. A New Foundation for Control Dependence and Slicing for Modern Program Structures. ACM Trans. Program. Lang. Syst., 29, 5 (2007), Article 27, Aug., issn:0164-0925 https://doi.org/10.1145/1275497.1275502

Digital Library

[20]

Saurabh Sinha, Mary Jean Harrold, and Gregg Rothermel. 2001. Interprocedural Control Dependence. ACM Trans. Softw. Eng. Methodol., 10, 2 (2001), April, 209–254. issn:1049-331X https://doi.org/10.1145/367008.367022

Digital Library

[21]

Mark Weiser. 1981. Program Slicing. In Proc. 5th International Conference on Software Engineering (ICSE ’81). IEEE Press, Piscataway, NJ, USA. 439–449. isbn:0-89791-146-6 http://dl.acm.org/citation.cfm?id=800078.802557

Cited By

Masud A(2023)The Duality in Computing SSA Programs and Control DependencyIEEE Transactions on Software Engineering10.1109/TSE.2022.319224949:4(1766-1781)Online publication date: 1-Apr-2023
https://dl.acm.org/doi/10.1109/TSE.2022.3192249
Masud A(2022)Fast and Incremental Computation of Weak Control ClosureStatic Analysis10.1007/978-3-031-22308-2_15(325-349)Online publication date: 5-Dec-2022
https://dl.acm.org/doi/10.1007/978-3-031-22308-2_15

Index Terms

On the computation of interprocedural weak control closure
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
2. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning
      1. Program analysis

Recommendations

Simple and Efficient Computation of Minimal Weak Control Closure
Static Analysis
Abstract
Control dependency is a fundamental concept in many program analyses, transformation, parallelization, and compiler optimization techniques. An overwhelming number of definitions of control dependency relations are found in the literature that ...
Efficient computation of minimal weak and strong control closure
Abstract
Control dependency is a fundamental concept in many program analyses, transformation, parallelization, and compiler optimization techniques. An overwhelming number of definitions of control dependency relations are found in the ...
Highlights
- WCC and SCC have wider applicability than postdominator-based control dependency.
Interprocedural control dependence

Program-dependence information is useful for a variety of applications, such as software testing and maintenance tasks, and code optimization. Properly defined, control and data dependences can be used to identify semantic dependences. To function ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CC 2022: Proceedings of the 31st ACM SIGPLAN International Conference on Compiler Construction

March 2022

253 pages

ISBN:9781450391832

DOI:10.1145/3497776

General Chairs:
Bernhard Egger
Seoul National University, South Korea
,
Aaron Smith
Microsoft, USA

Copyright © 2022 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 March 2022

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Knowledge Foundation Sweden

Conference

CC '22

Sponsor:

SIGPLAN

CC '22: 31st ACM SIGPLAN International Conference on Compiler Construction

April 2 - 3, 2022

Seoul, South Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
242
Total Downloads

Downloads (Last 12 months)98
Downloads (Last 6 weeks)18

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Masud A(2023)The Duality in Computing SSA Programs and Control DependencyIEEE Transactions on Software Engineering10.1109/TSE.2022.319224949:4(1766-1781)Online publication date: 1-Apr-2023
https://dl.acm.org/doi/10.1109/TSE.2022.3192249
Masud A(2022)Fast and Incremental Computation of Weak Control ClosureStatic Analysis10.1007/978-3-031-22308-2_15(325-349)Online publication date: 5-Dec-2022
https://dl.acm.org/doi/10.1007/978-3-031-22308-2_15

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten