Semantics of flowchart programs and the free Conway theories

 Access to full text

 Full (PDF)

1. 1. S. L. BLOOM, C. C. ELGOT and J. B. WRIGHT, Solutions of the iteration equation and extensions of the scalar iteration operation, SIAM Journal of Computing, 1980, 9, pp. 24-65. Zbl0454.18011MR557823
2. 2. S. L. BLOOM, C. C. ELGOT and J. B. WRIGHT, Vector iteration in pointed iterative theories, SIAM Journal of Computing, 1980, 9, pp. 525-540. Zbl0461.68047MR584509
3. 3. S. L. BLOOM and Z. ÉSIK, Axiomatizing schemes and their behaviours, Journal of Computing and System Sciences, 1985, 31, pp. 375-393. Zbl0613.68013MR835132
4. 4. S. L. BLOOM and Z. ÉSIK, Floyd-Hoare logic in iteration theories, JACM, 1991, pp. 887-934. Zbl0799.68042MR1134520
5. 5. S. L. BLOOM and Z. ÉSIK, Iteration Theories: The Equational Logic of Iterative Processes, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1993. Zbl0773.03033MR1295433
6. 6. D. P. BOVET and P. CRESCENZI, Introduction to the Theory of Complexity, Prentice-Hall, 1994. Zbl0809.68067MR1311246
7. 7. V. E. CAZANESCU and Gh. STEFANESCU, Towards a new algebraic foundation of flowchart scheme theory, Fundamenta Informaticae, 1990, 13, pp. 171-210. Zbl0705.68071MR1074634
8. 8. Sang CHO and Dung T. HUYNH, Finite-automaton aperiodicity is PSPACE-complete, Theoretical Computer Science, 1991, 88, pp. 99-116. Zbl0733.68038MR1130374
9. 9. J. C. CONWAY, Regular Algebra and Finite Machines, Chapman and Hall, 1971. Zbl0231.94041
10. 10. B. COURCELLE, Fundamental properties of infinite trees. In Theoretical Foundations of Programming Methodology, Munich 1981, Reidel, 1982. Zbl0513.68060MR696967
11. 11. C. C. ELGOT, Monadic computation and iterative algebraic theories. In J. C. Shepherdson, editor, Logic Colloquium 1973 volume 80 of Studies in Logic, Amsterdam, 1975. North Holland. Zbl0327.02040MR413584
12. 12. C. C. ELGOT, Matricial Theories, Journal of Algebra, 1976, 42, pp. 391-421. Zbl0361.18004MR430017
13. 13. C. C. ELGOT, Structured programmning with and without goto statements. In IEEE Transactions on Software Engineering, number 232 in SE-2, 1976, pp. 41-53. Zbl0348.68008MR433942
14. 14. Z. ÉSIK, Group axioms for iteration, to appear. Zbl0924.68143MR1674307
15. 15. Z. ÉSIK, Identities in Iterative and rational algebraic theories, Computational Linguistics and Computer Languages, 1980, 14, pp. 183-207. Zbl0466.68010MR626263
16. 16. J. S. GOLAN, The theory of semirings with applications in mathematics and theoretical computer science, Longman Scientific & Technical, 1993. Zbl0780.16036MR1163371
17. 17. D. KROB, Complete Systems of B-rational identities, Theoretical Computer Science, 1991, 89, pp. 207-343. Zbl0737.68053MR1133622
18. 18. F. W. LAWVERE, Functorial Semantics of Algebraic Theories, Proceedings of the National Academy of Sciences USA, 1963, 50, pp. 869-873. Zbl0119.25901MR158921
19. 19. J.-E. PIN, Varieties of Formal Languages, orth Oxford Academic, 1986. Zbl0655.68095MR912694
20. 20. Gh. STEFANESCU, On Flowchart Theories: Part I. The deterministic case, JCSS, 1987, 35, pp. 163-191. Zbl0628.68018MR910211

1. P. Katis, Nicoletta Sabadini, Robert F. C. Walters, Feedback, trace and fixed-point semantics
2. Andrea Corradini, Fabio Gadducci, Rewriting on cyclic structures : equivalence between the operational and the categorical description
3. Andrea Corradini, Fabio Gadducci, Rewriting on cyclic structures: Equivalence between the operational and the categorical description
4. P. Katis, Nicoletta Sabadini, Robert F.C. Walters, Feedback, trace and fixed-point semantics