On the sequential nature of interprocedural program-analysis problems

DOI10.1007/s002360050068zbMath0861.68016OpenAlexW4254368211MaRDI QIDQ2565054

Thomas W. Reps

Publication date: 11 May 1997

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050068

zbMATH Keywords

interprocedural program-analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of software (68N99)

Related Items (4)

On the computational complexity of data flow analysis over finite bounded meet semilattices ⋮ Space Complexity of Reachability Testing in Labelled Graphs ⋮ Space complexity of reachability testing in labelled graphs ⋮ Interconvertibility of a class of set constraints and context-free-language reachability

This page was built for publication: On the sequential nature of interprocedural program-analysis problems