The Böhm–Jacopini Theorem Is False, Propositionally

DOI10.1007/978-3-540-70594-9_11MaRDI QIDQ3521987zbMATH OpenOpenAlexWikidataFDO

Authors Dexter Kozen, Wei-Lung Dustin Tseng

Publication date 28 August 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70594-9_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)

Recommendations

• scientific article; zbMATH DE number 3848600
• scientific article; zbMATH DE number 3848602
• An analysis of Böhm's theorem
• Program structures: Some new characterisations
• A while program normal form theorem in total correctness

Cites work

• scientific article; zbMATH DE number 3478370 (Why is no real title available?)
• scientific article; zbMATH DE number 2208070 (Why is no real title available?)
• Conversion of Unstructured Flow Diagrams to Structured Form
• Eliminating go to's while preserving program structure
• Flow diagrams, turing machines and languages with only two formation rules
• On the capabilities of while, repeat, and exit statements
• Regular expressions and the equivalence of programs
• Unravelling Unstructured Programs

Cited in

(5)

• scientific article; zbMATH DE number 7243677 (Why is no real title available?)
• Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks
• Completeness and the finite model property for Kleene algebra, reconsidered
• Dijkstra graphs
• A complete inference system for skip-free guarded Kleene algebra with tests

This page was built for publication: The Böhm–Jacopini Theorem Is False, Propositionally

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