Deterministic and nondeterministic flowchart interpretations
DOI10.1016/0022-0000(83)90050-8zbMATH Open0544.68010OpenAlexW2068186388MaRDI QIDQ796975FDOQ796975
Authors: Richard J. Lorentz, David B. Benson 
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
Recommendations
- On flowchart theories. II: The nondeterministic case
- Relational algebraic semantics of deterministic and nondeterministic programs
- Non-deterministic information systems and their domains
- scientific article; zbMATH DE number 3956410
- Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes
SemanticsAbelian monoidsDeterministic programming languagesNondeterministic programming languagessyntax for programming languages
General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60) Categories of machines, automata (18B20)
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?)
- Regular trees and the free iterative theory
- On modules over a semiring
- Theory of program structures: Schemes, semantics, verification
- The common algebraic structure of exit-automata and machines
- The existence and construction of free iterative theories
- Matricial theories
- Infinite trees in normal form and recursive equations having a unique solution
- Partially additive categories and flow-diagram semantics
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II
- Title not available (Why is that?)
- Title not available (Why is that?)
- On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs
- Structured Programming With and Without go to Statements
- Title not available (Why is that?)
Cited In (10)
- On flowchart theories. I. The deterministic case
- On flowchart theories. II: The nondeterministic case
- APPLICATION PLACEMENT ON A CLUSTER OF SERVERS
- Relational algebraic semantics of deterministic and nondeterministic programs
- SPECIFICATION AND COMPUTING STATES IN FUZZY ALGORITHMS
- Iterative and recursive matrix theories
- Cohomological invariants of representations of 3-manifold groups
- A functorial semantics for multi-algebras and partial algebras, with applications to syntax.
- An execution mechanism for nondeterministic, state-oriented programs based on a chart parser
- Free semiring-representations and nondeterminism
This page was built for publication: Deterministic and nondeterministic flowchart interpretations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796975)
