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

DOI10.1016/S0022-0000(74)80028-0zbMath0285.68010OpenAlexW2058059746MaRDI QIDQ1845472

Joseph A. 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

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item