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

Path Complexity Analysis for Interprocedural Code

Published:2024-04-14 Issue: Volume: Page:404-405
ISSN:
Container-title:Proceedings of the 2024 IEEE/ACM 46th International Conference on Software Engineering: Companion Proceedings
language:
Short-container-title:

Author:

Kaniyur Mira Bhagirathi¹^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, California, USA

Funder

NSF

Publisher

ACM

Link

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

Reference8 articles.

1. Automatically computing path complexity of programs

2. 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.

3. 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.

4. Cristian Cadar, Daniel Dunbar, and Dawson Engler. 2008. KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. In Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (San Diego, California) (OSDI'08). USENIX Association, USA, 209--224.

5. Robert L. Graham, Donald E. Knuth, and Oren Patashnik. 1994. Concrete Mathematics: A Foundation for Computer Science (2nd ed.). Addison-Wesley Publishing Company, USA.