Syntactic and semantic soundness of structural dataflow analysis
From MaRDI portal
Publication:6536282
Recommendations
Cites work
- scientific article; zbMATH DE number 3463168 (Why is no real title available?)
- scientific article; zbMATH DE number 3485178 (Why is no real title available?)
- scientific article; zbMATH DE number 3557197 (Why is no real title available?)
- scientific article; zbMATH DE number 1927580 (Why is no real title available?)
- scientific article; zbMATH DE number 3402095 (Why is no real title available?)
- A Comparison of Two Algorithms for Global Data Flow Analysis
- A lattice-theoretical fixpoint theorem and its applications
- A program data flow analysis procedure
- Abstract semantic dependency
- Bi-inductive structural semantics
- Combining model checking and data-flow analysis
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
- Constructive versions of Tarski's fixed point theorems
- Data flow analysis as model checking
- Generating data flow analysis algorithms from modal specifications
- Making abstract interpretations complete
- Structural analysis: A new approach to flow analysis in optimizing compilers
- Systematic design of program transformation frameworks by abstract interpretation
- Temporal abstract interpretation
- The powerset operator on abstract interpretations
This page was built for publication: Syntactic and semantic soundness of structural dataflow analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536282)