On the computational complexity of data flow analysis over finite bounded meet semilattices

DOI10.1016/j.tcs.2021.06.019OpenAlexW3175960660MaRDI QIDQ1981765

K. Murali Krishnan, Gaurav Sood

Publication date: 6 September 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.06.019

zbMATH Keywords

computational complexity\( \mathsf{NL} \)-complete\( \mathsf{P} \)-completedata flow frameworkmaximum fixed point solutionmeet over all paths solution

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of data flow frameworks: A unified model
• Monotone data flow analysis frameworks
• On the sequential nature of interprocedural program-analysis problems
• A lattice-theoretical fixpoint theorem and its applications
• Lattice Theory: Foundation
• Computational Complexity

This page was built for publication: On the computational complexity of data flow analysis over finite bounded meet semilattices