On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs

DOI10.1016/S0022-0000(74)80028-0zbMATH Open0285.68010OpenAlexW2058059746MaRDI QIDQ1845472FDOQ1845472

Joseph Goguen

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1016/s0022-0000(74)80028-0

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (12)

• Final algebra semantics and data type extensions
• A categorical manifesto
• Title not available (Why is that?)
• SYSTEMS AND DISTINCTIONS; DUALITY AND COMPLEMENT ARITY†
• Programs as partial graphs. I: Flow equivalence and correctness
• Deterministic and nondeterministic flowchart interpretations
• Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I
• Bisimulation is two-way simulation
• Correctness of recursive parallel nondeterministic flow programs
• A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
• Recursion-closed algebraic theories
• Program morphisms

This page was built for publication: On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs

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