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

DOI10.1145/361953.361957MaRDI QIDQ5579353zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(3)

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

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

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