Conditions for incremental iteration: Examples and counterexamples
- 1 October 1988
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 11 (1), 1-15
- https://doi.org/10.1016/0167-6423(88)90061-5
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Incremental Analysis of Logic ProgramsPublished by MIT Press ,1995
- A critical analysis of incremental iterative data flow analysis algorithmsIEEE Transactions on Software Engineering, 1990
- An interval-based approach to exhaustive and incremental interprocedural data-flow analysisACM Transactions on Programming Languages and Systems, 1990
- Incremental data flow analysis via dominator and attribute updatePublished by Association for Computing Machinery (ACM) ,1988
- An incremental algorithm for software analysisACM SIGPLAN Notices, 1987
- Efficient computation of flow insensitive interprocedural summary informationACM SIGPLAN Notices, 1984
- Incremental data flow analysisPublished by Association for Computing Machinery (ACM) ,1983
- Constructive versions of Tarski’s fixed point theoremsPacific Journal of Mathematics, 1979
- Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979
- A unified approach to global program optimizationPublished by Association for Computing Machinery (ACM) ,1973