Axiomatizing schemes and their behaviors

DOI10.1016/0022-0000(85)90059-5zbMath0613.68013OpenAlexW2044747903MaRDI QIDQ1819574

Stephen L. Bloom, Zoltán Ésik

Publication date: 1985

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(85)90059-5

zbMATH Keywords

equivalence of program schemeswhile programsflowchart schemesequational axiomatizationtotal algebraFlowchartsIterative theories

Mathematics Subject Classification ID

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

Related Items (13)

THE POWER OF THE GROUP-IDENTITIES FOR ITERATION ⋮ Feedback, trace and fixed-point semantics ⋮ On flowchart theories. I. The deterministic case ⋮ Equational axioms for regular sets ⋮ An equational axiomatization of systolic systems ⋮ The equational logic of fixed points ⋮ An algebraic model of synchronous systems ⋮ A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization ⋮ Foundations of a theory of synchronous systems ⋮ The monoidal structure of Turing machines ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ Traced Premonoidal Categories ⋮ Equational logic of circular data type specification

Cites Work

• Algebras of iteration theories
• An axiomatization of D-scheme strong equivalence
• The existence and construction of free iterative theories
• Scalar and vector iteration
• On the algebraic structure of rooted trees
• Algebraic and graph theoretic characterizations of structured flowchart schemes
• Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation
• Structured Programming With and Without go to Statements
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Axiomatizing schemes and their behaviors