Automatic segmentation of cyclic program structures based on connectivity and processor timing

DOI10.1145/361953.361957zbMath0187.40601OpenAlexW2086461268MaRDI QIDQ5579353

Thomas C. Lowe

Publication date: 1970

Published in: Communications of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

computer science and automata

Related Items (3)

Optimal segmentation of graphs with exclusive OR nodes ⋮ Applications of graph theory in computer systems ⋮ Semantic decomposition of computer programs: An aid to program testing

This page was built for publication: Automatic segmentation of cyclic program structures based on connectivity and processor timing