Deterministic and nondeterministic flowchart interpretations

DOI10.1016/0022-0000(83)90050-8MaRDI QIDQ796975zbMATHOpenAlexFDO

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

zbMATH Keywords

SemanticsAbelian monoidsDeterministic programming languagesNondeterministic programming languagessyntax for programming languages

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60) Categories of machines, automata (18B20)

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

Cites work

• scientific article; zbMATH DE number 3681970 (Why is no real title available?)
• scientific article; zbMATH DE number 3512082 (Why is no real title available?)
• scientific article; zbMATH DE number 3549200 (Why is no real title available?)
• scientific article; zbMATH DE number 3612415 (Why is no real title available?)
• scientific article; zbMATH DE number 3637271 (Why is no real title available?)
• scientific article; zbMATH DE number 3335055 (Why is no real title available?)
• scientific article; zbMATH DE number 3362974 (Why is no real title available?)
• scientific article; zbMATH DE number 3399453 (Why is no real title available?)
• Infinite trees in normal form and recursive equations having a unique solution
• Matricial theories
• Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II
• On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs
• On modules over a semiring
• Partially additive categories and flow-diagram semantics
• Regular trees and the free iterative theory
• Structured Programming With and Without go to Statements
• The common algebraic structure of exit-automata and machines
• The existence and construction of free iterative theories
• Theory of program structures: Schemes, semantics, verification

Cited in

(10)

• Free semiring-representations and nondeterminism
• An execution mechanism for nondeterministic, state-oriented programs based on a chart parser
• On flowchart theories. I. The deterministic case
• Relational algebraic semantics of deterministic and nondeterministic programs
• A functorial semantics for multi-algebras and partial algebras, with applications to syntax.
• SPECIFICATION AND COMPUTING STATES IN FUZZY ALGORITHMS
• APPLICATION PLACEMENT ON A CLUSTER OF SERVERS
• On flowchart theories. II: The nondeterministic case
• Cohomological invariants of representations of 3-manifold groups
• Iterative and recursive matrix theories

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)