Flow Graph Reducibility

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 Jan 1972 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Computing, volume 1, pages 188-202 (issn: 0097-5397, eissn: 1095-7111,

Copyright policy )

Authors: Matthew S. Hecht; Jeffrey D. Ullman;

doi: 10.1137/0201014 , 10.1145/800152.804919

Flow Graph Reducibility

- Summary
- Subjects
- Metrics

Abstract

The structure of programs can often be described by a technique called “interval analysis” on their flow graphs. Here, we characterize the set of flow graphs that can be analyzed in this way in terms of two very simple transformation on graphs. We then give a necessary and sufficient condition for analyzability and apply it to “goto-less programs,” showing that they all meet the criterion.

Keywords

Analysis of algorithms and problem complexity, General topics in the theory of software, Formal languages and automata

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	116
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 0.1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%