On the complexity of flow-sensitive dataflow analyses
From MaRDI portal
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- On the complexity of dataflow analysis of logic programs
- On the sequential nature of interprocedural program-analysis problems
- On the computational complexity of data flow analysis over finite bounded meet semilattices
- Using locality of flow in dataflow analyses.
- On the complexity analysis of static analyses
Cited in
(15)- The expressive power of indeterminate dataflow primitives
- Stability, sequentiality and demand driven evaluation in dataflow
- Nesting analysis of mobile ambients
- Reference count analysis with shallow aliasing
- On the computational complexity of data flow analysis over finite bounded meet semilattices
- Characterizing polynomial time complexity of stream programs using interpretations
- scientific article; zbMATH DE number 1688386 (Why is no real title available?)
- On probabilistic techniques for data flow analysis
- New results on the computability and complexity of points-to analysis
- Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery
- scientific article; zbMATH DE number 1948400 (Why is no real title available?)
- Deciding kCFA is complete for EXPTIME
- On the complexity of dataflow analysis of logic programs
- Using locality of flow in dataflow analyses.
- Syntactic and semantic soundness of structural dataflow analysis
This page was built for publication: On the complexity of flow-sensitive dataflow analyses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178843)
