Deterministic and nondeterministic flowchart interpretations

DOI10.1016/0022-0000(83)90050-8zbMath0544.68010MaRDI QIDQ796975

David B. Benson, Richard J. Lorentz

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)90050-8

zbMATH Keywords

Semantics; Abelian monoids; Deterministic programming languages; Nondeterministic programming languages; syntax for programming languages

Mathematics Subject Classification ID

68Q60: Specification and verification (program logics, model checking, etc.)

68N01: General topics in the theory of software

18B20: Categories of machines, automata

Related Items

Iterative and recursive matrix theories, Free semiring-representations and nondeterminism, On flowchart theories. I. The deterministic case, On flowchart theories. II: The nondeterministic case, A functorial semantics for multi-algebras and partial algebras, with applications to syntax., APPLICATION PLACEMENT ON A CLUSTER OF SERVERS, SPECIFICATION AND COMPUTING STATES IN FUZZY ALGORITHMS

Cites Work

• Partially additive categories and flow-diagram semantics
• Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II
• Regular trees and the free iterative theory
• The existence and construction of free iterative theories
• Theory of program structures: Schemes, semantics, verification
• Matricial theories
• On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs
• On modules over a semiring
• The common algebraic structure of exit-automata and machines
• Infinite trees in normal form and recursive equations having a unique solution
• Structured Programming With and Without go to Statements
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item