A semantically meaningful characterization of reducible flowchart schemes
- 30 June 1979
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 8 (3) , 325-357
- https://doi.org/10.1016/0304-3975(79)90016-1
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Algebraic and graph theoretic characterizations of structured flowchart schemesTheoretical Computer Science, 1979
- The existence and construction of free iterative theoriesJournal of Computer and System Sciences, 1976
- Characterizations of Reducible Flow GraphsJournal of the ACM, 1974
- Flow Graph ReducibilitySIAM Journal on Computing, 1972
- Control flow analysisACM SIGPLAN Notices, 1970
- Global common subexpression eliminationACM SIGPLAN Notices, 1970
- Object code optimizationCommunications of the ACM, 1969