Correctness of recursive parallel nondeterministic flow programs

DOI10.1016/0022-0000(83)90043-0zbMath0532.68019OpenAlexW1993492813MaRDI QIDQ789165

Joseph A. Goguen, José Meseguer

Publication date: 1983

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(83)90043-0

zbMATH Keywords

verificationcorrectnessflowparallelnondeterministicprogram scheme

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items

On flowchart theories. II: The nondeterministic case, Program morphisms, A categorical manifesto, A functorial semantics for multi-algebras and partial algebras, with applications to syntax., Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories, Compositional SOS and beyond: A coalgebraic view of open systems

Cites Work

• Topoi. The categorial analysis of logic
• Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II
• Parallel realization of systems, using factorizations and quotients in categories
• On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs
• The correctness of nondeterministic programs
• Mathematical theory of partial correctness
• Can programming be liberated from the von Neumann style?
• Automata in general algebras
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item