Efficient interprocedural data-flow analysis using treedepth and treewidth

DOI10.1007/978-3-031-24950-1_9zbMath1529.68158OpenAlexW4316662575MaRDI QIDQ6174398

Amir Kafshdar Goharshady, Ahmed Khaled Zaher

Publication date: 17 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-24950-1_9

zbMATH Keywords

static analysisdata-flow analysisparameterized algorithmsIFDS

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• Precise interprocedural dataflow analysis with applications to constant propagation
• Graph minors. III. Planar tree-width
• \([1,2\)-sets and \([1,2]\)-total sets in trees with algorithms]
• The method of attributes for data flow analysis. II: Demand analysis
• All structured programs have small tree width and good register allocation
• Faster algorithms for quantitative verification in constant treewidth graphs
• Faster algorithms for quantitative verification in bounded treewidth graphs
• Quantitative analysis of smart contracts
• Tree-depth, subgraph coloring and homomorphism bounds
• Algorithms for algebraic path properties in concurrent systems of constant treewidth components
• Data Flow Analysis
• Graph minors. II. Algorithmic aspects of tree-width
• Parallel Algorithms with Optimal Speedup for Bounded Treewidth
• Rankings of Graphs
• Precise interprocedural dataflow analysis with applications to constant propagation
• A linear time algorithm for finding tree-decompositions of small treewidth
• Compiler Construction
• Treewidth in Verification: Local vs. Global
• Computer Aided Verification
• The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.