Interprocedural Path Complexity Analysis-Reference-Cited by-同舟云学术

Interprocedural Path Complexity Analysis

Published:2024-09-11 Issue: Volume:161 Page:162-173
ISSN:
Container-title:Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis
language:
Short-container-title:

Author:

Kaniyur Mira¹^ORCID,Cavalcante-Studart Ana¹^ORCID,Yang Yihan¹^ORCID,Park Sangeon¹^ORCID,Chen David¹^ORCID,Lam Duy¹^ORCID,Bang Lucas¹^ORCID

Affiliation:

1. Harvey Mudd College, Claremont, USA

Funder

NSF (National Science Foundation)

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3650212.3652118

Reference26 articles.

1. Saswat Anand, Patrice Godefroid, and Nikolai Tillmann. 2008. Demand-Driven Compositional Symbolic Execution. In Tools and Algorithms for the Construction and Analysis of Systems, C. R. Ramakrishnan and Jakob Rehof (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 367–381. isbn:978-3-540-78800-3

2. Automatically computing path complexity of programs

3. Gabriel Bessler, Josh Cordova, Shaheen Cullen-Baratloo, Sofiane Dissem, Emily Lu, Sofia Devin, Ibrahim Abughararh, and Lucas Bang. 2021. Metrinome: Path Complexity Predicts Symbolic Execution Path Explosion. In 43rd IEEE/ACM International Conference on Software Engineering: Companion Proceedings, ICSE Companion 2021, Madrid, Spain, May 25-28, 2021. IEEE.

4. A Simple and Effective Measure for Complex Low-Level Dependencies

5. Peter Boonstoppel, Cristian Cadar, and Dawson Engler. 2008. RWset: Attacking Path Explosion in Constraint-Based Test Generation. In Tools and Algorithms for the Construction and Analysis of Systems, C. R. Ramakrishnan and Jakob Rehof (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 351–366. isbn:978-3-540-78800-3