Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery

DOI10.1145/2993.357243MaRDI QIDQ3321438zbMATH OpenOpenAlexFDO

Authors Roland C. Backhouse

Publication date 1984

Published in ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2993.357243

zbMATH Keywords

code optimizationcompilingerror correctionGauss-Seidel iterationlatticeLL grammarparser generatorpath problemrecursive descent parsers

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• Local concurrent error detection and correction in data structures using virtual backpointers
• Precise interprocedural dataflow analysis with applications to constant propagation
• Precise interprocedural dataflow analysis with applications to constant propagation
• On the complexity of flow-sensitive dataflow analyses
• scientific article; zbMATH DE number 17826
• Using locality of flow in dataflow analyses.
• scientific article; zbMATH DE number 5503714
• On the complexity of global computation in the presence of link failures: the case of uni-directional faults
• scientific article; zbMATH DE number 1822437
• scientific article; zbMATH DE number 1773092

This page was built for publication: Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery

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