Efficient interprocedural data-flow analysis using treedepth and treewidth

DOI10.1007/978-3-031-24950-1_9MaRDI QIDQ6174398zbMATH OpenOpenAlexFDO

Authors 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

data-flow analysisIFDSparameterized algorithmsstatic analysis

Mathematics Subject Classification ID

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

Recommendations

• Faster algorithms for algebraic path properties in recursive state machines with constant treewidth
• Precise interprocedural dataflow analysis with applications to constant propagation
• Precise interprocedural analysis through linear algebra
• On the sequential nature of interprocedural program-analysis problems
• Solving Multiple Dataflow Queries Using WPDSs

Cites work

• \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms
• A linear time algorithm for finding tree-decompositions of small treewidth
• Algorithms for algebraic path properties in concurrent systems of constant treewidth components
• All structured programs have small tree width and good register allocation
• Compiler Construction
• Data Flow Analysis
• Fast mu-calculus model checking when tree-width is bounded.
• Faster algorithms for quantitative verification in bounded treewidth graphs
• Faster algorithms for quantitative verification in constant treewidth graphs
• Graph minors. II. Algorithmic aspects of tree-width
• Graph minors. III. Planar tree-width
• scientific article; zbMATH DE number 4060712 (Why is no real title available?)
• scientific article; zbMATH DE number 3485178 (Why is no real title available?)
• scientific article; zbMATH DE number 566078 (Why is no real title available?)
• scientific article; zbMATH DE number 1956467 (Why is no real title available?)
• scientific article; zbMATH DE number 1926662 (Why is no real title available?)
• scientific article; zbMATH DE number 2115035 (Why is no real title available?)
• Parallel Algorithms with Optimal Speedup for Bounded Treewidth
• Precise interprocedural dataflow analysis with applications to constant propagation
• Precise interprocedural dataflow analysis with applications to constant propagation
• Quantitative analysis of smart contracts
• Rankings of Graphs
• Sparsity. Graphs, structures, and algorithms
• The method of attributes for data flow analysis. II: Demand analysis
• The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
• The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
• Tree-depth, subgraph coloring and homomorphism bounds
• Treewidth in Verification: Local vs. Global

Cited in

(1)

• Optimal blocks for maximizing the transaction fee revenue of bitcoin miners

This page was built for publication: Efficient interprocedural data-flow analysis using treedepth and treewidth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174398)