Graph theoretic characterization of G-schemes and T L-schemes

DOI10.1016/0304-3975(82)90006-8zbMath0476.68018OpenAlexW2061818158MaRDI QIDQ1159978

John C. Shepherdson

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90006-8

zbMATH Keywords

structured flowchart schemes

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Analysis of structured programs
• A semantically meaningful characterization of reducible flowchart schemes
• Algebraic and graph theoretic characterizations of structured flowchart schemes
• Erratum and Corrigendum for "Structured Programming With and Without GO TO Statements"

This page was built for publication: Graph theoretic characterization of G-schemes and T L-schemes