The Böhm–Jacopini Theorem Is False, Propositionally

DOI10.1007/978-3-540-70594-9_11zbMATH Open1156.68354OpenAlexW1560923948WikidataQ55880202 ScholiaQ55880202MaRDI QIDQ3521987FDOQ3521987

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

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

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)

Cites Work

• Title not available (Why is that?)
• Flow diagrams, turing machines and languages with only two formation rules
• Regular expressions and the equivalence of programs
• Eliminating go to's while preserving program structure
• On the capabilities of while, repeat, and exit statements
• Unravelling Unstructured Programs
• Conversion of Unstructured Flow Diagrams to Structured Form
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• 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)