The equivalence of r.e. program schemes and data flow schemes

DOI10.1016/0022-0000(80)90044-6zbMath0444.68036OpenAlexW2083903014MaRDI QIDQ1144928

Jeffrey M. Jaffe

Publication date: 1980

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(80)90044-6

zbMATH Keywords

computabilitydata flow schemesrecursively enumerable program schemes

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Theory of program structures: Schemes, semantics, verification
• Translating recursion equations into flow charts
• Program Schemes with Pushdown Stores
• On Classes of Program Schemata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The equivalence of r.e. program schemes and data flow schemes