Relation-algebraic semantics

Theoretical Computer Science

Volumn 160, Issue 1-2, 1996, Pages 1-85

  Maddux, Roger D ^a  

^a IOWA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; INVARIANCE; MATHEMATICAL OPERATORS; PROGRAMMING THEORY; THEOREM PROVING;

PROGRAM STATEMENTS; RELATION ALGEBRA; RELATIONAL COMPOSITION; SEMANTICS; SEQUENTIAL COMPOSITION; TARSKI FIXED POINT THEOREM;

COMPUTATION THEORY;

EID: 0030172882     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00082-8     Document Type: Article

References (55)

1. R. Backhouse and J. van der Woude, Demonic operators and monotype factors, Tech. Report, Eindhoven, 1993.
2. H. Bekić, Definable operations in general algebras, and the theory of automata and flowcharts, Tech. Report, IBM Laboratory, Vienna, 1969.
3. R. Berghammer and H. Zierer, Relational algebraic semantics of deterministic and nondeterministic programs, Theoret. Comput. Sci. 43 (1986) 123-147.
4. G. Boole, The Mathematical Analysis of Logic; Being an Essay Towards a Calculus of Deductive Reasoning (B. Blackwell, Oxford, 1948, first published in London and Cambridge, 1847).
5. M. Broy, R. Gnatz and M. Wirsing, Semantics of nondeterministic and noncontinuous constructs, in: F. L. Bauer and M. Broy, eds., Program Construction Lecture Notes in Computer Science, Vol. 69 (Springer, Berlin, 1979) International Summer School, Marktoberdorf (1978), 553-592.
6. L.H. Chin and A. Tarski, Distributive and modular laws in the arithmetic of relation algebras, University of California Publications in Mathematics, New Series Vol. 1 (1951) 341-384.
7. P. Cousot, Methods and Logics for Proving Programs, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B, Formal Models and Semantics (Elsevier, Amsterdam, 1990) 841-993.
8. J.W. de Bakker, Semantics and termination of nondeterministic recursive programs, in: S. Michaelson and R. Milner, eds., Proc. 3rd Internat. Coll. on Automata, Languages, and Programming (Edinburgh Univ. Press, Edinburg 1976) 436-477.
9. J.W. de Bakker, Mathematical Theory of Program Correctness, (Prentice-Hall, Englewood Cliffs, NJ, 1980).
10. J.W. de Bakker and W.-P. de Roever, A calculus for recursive program schemes, in: M. Nivat ed., Proc. 1st Internat. Coll. on Automata, Languages, and Programming, Proc. Symp. (IRIA), 3-7 July 1972, Rocquencourt, (North-Holland, Amsterdam 1973), 167-196.
11. W.-P. de Roever, Recursion and parameter mechanisms: an axiomatic approach, in: (J. Loeckx, ed.) Proc. 2nd Internat. Coll. on Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 14 (Springer, Berlin 1973) 34-65.
12. W.P. de Roever, Recursive Program Schemes: Semantics and Proof Theory Mathematical Centre Tracts, Vol. 70, Centre for Mathematics and Computer Science (1976), ix+112.
13. E.W. Dijkstra, Guarded commands, nondeterminacy, and formal derivation of programs, Comm. ACM (1975) 453-457.
14. E.W. Dijkstra, A Discipline of Programming, (Prentice-Hall, Englewoods Cliffs, NJ, 1976).
15. E.W. Dijkstra and C.S. Scholten, Predicate Calculus and Program Semantics, Texts and Monographs in Computer Science (Springer, New York, 1990).
16. L. Henkin, J. Donald Monk, and A. Tarski, Cylindric Algebras, Part I, (North-Holland, Amsterdam, 1971).
17. P. Hitchcock and D.M.R. Park, Induction rules and termination proofs, in: M. Nivat, ed., Proc. 1st Internat. Coll. on Automata, Languages, and Programming, Proc. Symp. (IRIA), 3-7 July 1972, Rocquencourt, (North-Holland, Amsterdam 1973) 225-251.
18. C.A.R. Hoare, I.J. Hayes, He Jifeng, C. C. Morgan, A. W. Roscoe, J. W. Sanders, I. H. Sorenson, J. M. Spivey and B. A. Sufrin, Laws of programming, Comm. A C M. (1987) 672-686, 770.
19. C.A.R. Hoare and He Jifeng, The weakest prespecification, Part I, Fund. Inform. 9 (1986) 51-84.
20. C.A.R. Hoare and He Jifeng, The weakest prespecification, Part II, Fund. Inform. 9 (1986) 217-252.
21. E.V. Huntington, New sets of independent postulates for the algebra of logic, with special reference to Whitehead and Russell's Principia Mathematica, Trans. Amer. Math. Soc. 35 (1933) 274-304.
22. E.V. Huntington, Boolean algebra. A correction, Trans. Amer. Math. Soc. 35 (1933) 557-558.
23. B. Jónsson, Varieties of relation algebras, Algebra Universalis 15 (1982) 273-298.
24. B. Jónsson, The theory of binary relations, in: H. Andréka, J. D. Monk, , and I. Németi, eds. Algebraic Logic (Proc. Conf., Budapest, 1988), Colloq. Math. Soc. J. Bolyai, Vol. 54, (North-Holland, Amsterdam 1991), 245-292.
25. B. Jónsson and A. Tarski, Representation problems for relation algebras, Bull. Amer. Math. Soc. 54 (1948) 80 and 1192, Abstract 89.
26. B. Jónsson and A. Tarski, Boolean algebras with operators, Part I, Amer. J. Math. 73 (1951) 891-939.
27. B. Jónsson and A. Tarski, Boolean algebras with operators, Part II, Amer. J. Math. 74 (1952) 127-162.
28. B. Knaster, Un Thérème sur les fonctions d'ensembles, Rocznik Polskiego Towarzystwa Matematycznego (Annales de la Société Polonaise de Mathématique) 6 (1927, published 1928) 133-134.
29. J. Leszczylowski, A theorem on resolving equations in the space of languages, Bull. Acad. Polon. Sci., Ser. Sci. Math. Astr. Phys. 19 (1971) 967-970.
30. R.D. Maddux, Some nonrepresentable relation algebras, Notices Amer. Math. Soc. 23 (1976) A-431, A-557.
31. R.D. Maddux, Finite integral relation algebras, in: Universal Algebra and Lattice Theory (Springer, Berlin, 1985) Proc. Southeastern Conf. in Universal Algebra and Lattice Theory, Charleston, S.C., July 11-14, 1984, Lecture Notes in Math., Vol. 1149, 175-197.
32. R.D. Maddux, Introductory course on relation algebras, finite-dimensional cylindric algebras, and their interconnections, in: H. Andréka, J. D. Monk and I. Németi, eds., Algebraic Logic (Proc. Conf., Budapest 1988) Colloq. Math. Soc. J. Bolyai, Vol. 54, (North-Holland, Amsterdam 1991), 361-392.
33. R.D. Maddux, The origin of relation algebras in the development and axiomatization of the calculus of relations, Studia Logica 50 (1991) 421-455.
34. R.D. Maddux, A working relational model: The derivation of the Dijkstra-Scholten predicate transformer semantics from Tarski's axioms for the Peirce-Schröder calculus of relations, South African Comput. J. 9 (1993) 92-130.
35. A. De Morgan, On the symbols of logic, the theory of the syllogism, and in particular of the copula, and the application of the theory of probabilities to some questions in the theory of evidence, Trans. Cambridge Philos. Soc. 9 (1856) 79-127, reprinted in [37].
36. A. De Morgan, On the syllogism, no. IV, and on the logic of relations, Trans. Cambridge Philos. Soc. 10 (1864) 331-358, reprinted in [37].
37. A. De Morgan, On the Syllogism, and Other Logical Writings, (Yale Univ. Press, New Haven, 1966), edited, with an Introduction by P. Heath.
38. T. T. Nguyen, A relational model of demonic nondeterministic programs, Internat. J. Foundations Comput. Sci. 2, (1991) 101-131.
39. T. T. Nguyen, The connection between predicate logic and demonic relation calculus, Tech. Report CRIN 92-R-187, Centre de Recherche en Informatique de Nancy, 18 November, 1992.
40. D. Park, Fixpoint induction and proofs of program properties, in: B. Meltzer and D. Richie, eds., Machine Intelligence, Vol. 5, (Edinburgh Univ. Press, Edinburgh 1969) 59-77.
41. D. Park, On the semantics of fair parallelism, Abstract Software Specification, Lecture Notes in Computer Science, Vol. 86, (Springer, Berlin 1980) 504-526.
42. C.S. Peirce, Description of a notation for the logic of relatives, resulting from an amplification of the conceptions of Boole's calculus of logic, Mem. Amer. Academy Sci. 9 (1870) 317-378, (reprinted by Welch, Bigelow and Co., Cambridge, MA 1870 1-62); also reprinted in [45, 46].
43. C.S. Peirce, On the algebra of logic, Amer. J. Math. 3 (1880) 15-57, reprinted in [45].
44. C.S. Peirce, Note B: the logic of relatives, in: C. S. Peirce, ed., Studies in Logic by Members of the Johns Hopkins University (Little, Brown, and Co., Boston, 1883) book reprinted, with an Introduction by M. H. Fisch and a Preface by A. Eschbach, by John Benjamins Publishing Co., Amsterdam and Philadelphia, (1983), Iviii, vi+203; paper reprinted in [45, pp. 187-203].
45. C.S. Peirce, in: C. Hartshorne and Paul Weiss, eds., Collected Papers, Vol. III, (Harvard Univ. Press, Cambridge, 1933).
46. C.S. Peirce, in: E.C. Moore, M.H. Fisch, C.J.W. Kloesel, D.D. Roberts and L.A. Ziegler, eds., Writings of Charles S. Peirce, A Chronological Edition, (Indiana Univ. Press, Bloomington, 1984).
47. G. Schmidt, Programs as partial graphs I: flow equivalence and correctness, Theoret. Comput. Sci. 15 (1981) 1-25.
48. G. Schmidt, Programs as partial graphs II: recursion, Theoret. Comput. Sci. 15 (1981), 159-179.
49. G. Schmidt and T. Ströhlein, in: W. Brauer, G. Rozenberg and A. Salomaa, eds., Relations and Graphs, (Springer, Berlin, 1993).
50. F.W.K. Ernst Schröder, Vorlesungen über die Algebra der Logik (exacte Logik), Vol. 3, Algebra und Logik der Relative. Part I, (Chelsea, Bronx, New York), 2nd ed., 1966, first published in Leipzig, 1895.
51. D.S. Scott and J.W. de Bakker, A theory of programs, unpublished seminar notes, 1969.
52. A. Tarski, On the calculus of relations, J. Symbolic Logic 6 (1941) 73-89.
53. A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math. 5 (1955) 285-309.
54. A. Tarski and S.R. Givant, A Formalization of Set Theory without Variables, Colloquium Publications, Vol. 41. (American Mathematical Society, 1987).
55. J. van der Woude, Calculations with relations, an example, in: W. Feijen, A. J. M. van Gasteren, D. Gries, and J. Misra, eds., Beauty is our Business (Springer, Berlin, 1990), 435-441.