scientific article; zbMATH DE number 3956410
[For the entire collection see Zbl 0578.00006.] This research is an attempt to develop Backus' ideas, namely to construct a mathematical theory in which program transformations are allowed and in which correctness can be obtained using simple algebraic computations. In fact, a formal representation \(Fl_{X,T}\) of multi-input multi-exit flowchart schemes is given. (It uses a support theory T of known computation processes for redirecting flow of control and a double-ranked set X of variables for atomic schemes). A natural equivalence relation \(\equiv\) on these formal representations is considered. In the deterministic case, this equivalence \(\equiv_ d\) precisely captures having the same set of finite and infinite computation paths - that is the strong equivalence of Elgot. The algebra used for support theories in the deterministic case is a strong iteration theory (i.e. an iteration theory defined by Bloom, Elgot and Wright which obeys a functorial dagger implication). In this deterministic case the main result shows that \(Fl_{X,T}/\equiv_ d\) is the coproduct of T and the strong iteration theory freely generated by X. A partial similar result was obtained for the nondeterministic case using as support theories matrix theories endowed with an axiomatized repetition. Note: The partial result in the nondeterministic case was made much more strong by solving the open problem for a wide class of support theories, including all \(Rel_ D\). This and the results concerning the nondeterministic case will appear in Theoret. Comput. Sci., while the results concerning the deterministic case will appear in J. Comput. System Sci.
- scientific article; zbMATH DE number 4157896
- scientific article; zbMATH DE number 4113973
- Algebraic semantics of recursive flowchart schemes
- scientific article; zbMATH DE number 4014009
- scientific article; zbMATH DE number 4201627
- Algebraic characterization of reducible flowcharts
- scientific article; zbMATH DE number 4100594
- scientific article; zbMATH DE number 4121404
- The algebra of flows in graphs
- An algebraic foundation for graph-based diagrams in computing
- On flowchart theories. I. The deterministic case
- On flowchart theories. II: The nondeterministic case
- Classes of finite relations as initial abstract data types. I
- A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
- Axiomatizing schemes and their behaviors
- Condition/decision duality and the internal logic of extensive restriction categories
- Algebraic semantics of recursive flowchart schemes
- scientific article; zbMATH DE number 3890699 (Why is no real title available?)
- scientific article; zbMATH DE number 4201627 (Why is no real title available?)
- scientific article; zbMATH DE number 4157896 (Why is no real title available?)
- scientific article; zbMATH DE number 3928354 (Why is no real title available?)
- scientific article; zbMATH DE number 4100594 (Why is no real title available?)
- scientific article; zbMATH DE number 742725 (Why is no real title available?)
- scientific article; zbMATH DE number 4113973 (Why is no real title available?)
- scientific article; zbMATH DE number 4189706 (Why is no real title available?)
- Algebraic characterization of reducible flowcharts
- Deterministic and nondeterministic flowchart interpretations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3725522)