From specifications to programs: A fork-algebraic approach to bridge the gap

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1113, Issue , 1996, Pages 180-191

  Baum, Gabriel A ^a   Frias, Marcelo F ^b   Haeberer, Armando M ^b   Martínez López, Pablo E ^a  

^a UNIVERSIDAD NACIONAL DE LA PLATA   (Argentina)

^b PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; SPECIFICATIONS;

ALGEBRAIC APPROACHES; ALGEBRAIC OPERATIONS; ALGEBRAIC PROPERTIES; FIRST ORDER THEORIES; RELATIONAL CALCULUS; SPECIFICATION TOOLS; TRANSFORMATION RULES; UNIVERSAL QUANTIFIERS;

ALGEBRA;

EID: 21444433879     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61550-4_147     Document Type: Conference Paper

References (15)

1. Berghammer, R., Haeberer, A.M., Schmidt, G., and Veloso, P.A.S,. Comparing Two Different Approaches to Products in Abstract Relation Algebras, in Proceedings of the Third International Conference on Algebraic Methodology and Software Technology, AMAST '93, Springer Verlag, 1993, 167-176.
2. Chin, L.H. and Tarski, A., Distributive and Modular Laws in the Arithmetic of Relation Algebras, in University of California Publications in Mathematics. University of California, 1951, 341-384.
3. Frias, M.F., Aguayo N.G. and Novak B., Development of Graph Algorithms with Fork Algebras, in Proceedings of the XIX Latinamerican Conference on Informatics, 1993, 529-554.
4. Frias, M.F., Baum, G.A., Haeberer, A.M. and Veloso, P.A.S., Fork Algebras are Representable, in Bulletin of the Section of Logic, University of Lódź, (24) 2, 1995, pp. 64-75.
5. Frias, M.F., Haeberer, A.M. and Veloso, P.A.S., A Finite Axiomatization for Fork Algebras, to appear in Journal of the IGPL, 1996.
6. Gyuris, V., A Short Proof for Representability of Fork Algebras, Journal of the IGPL, vol 3, N. 5, 1995, pp. 791-796.
7. Haeberer, A.M., Baum, G.A. and Schmidt G., On the Smooth Calculation of Relational Recursive Expressions out of First-Order Non-Constructive Specifications Involving Quantifiers, in Proceedings of the Intl. Conference on Formal Methods in Programming and Their Applications, LNCS 735, Springer Verlag, 1993, 281-298.
8. Haeberer, A.M. and Veloso, P.A.S., Partial Relations for Program Derivation: Adequacy, Inevitability and Expressiveness, in Constructing Programs from Specifications - Proceedings of the IFIP TC2 Working Conference on Constructing Programs from Specifications. North Holland., 1991, 319-371.
9. Löwenheim, L., Über Möglichkeiten im Relativkalkül, Math. Ann., vol. 76, 1915, 447-470.
10. Maddux, R., Finitary Algebraic Logic, Zeitschr. f. math. Logik und Grundlagen d. Math., vol. 35, 1989, 321-332.
11. Mikulás, S., Sain, L, Simon, A., Complexity of Equational Theory of Relational Algebras with Projection Elements. Bulletin of the Section of Logic, Vol. 21, N. 3, 103-111, University of Lódź, October. 1992.
12. Németi L, Strong Representability of Fork Algebras, a Set Theoretic Foundation, to appear in Journal of the IGPL, 1996.
13. Sain, I. and Németi, L, Fork Algebras in Usual as well as in Non-well-founded Set Theories, preprint of the Mathematical Institute of the Hungarian Academy of Sciences, 1994.
14. Tarski, A., On the Calculus of Relations, Journal of Symbolic Logic, vol. 6, 1941, 73-89.
15. Tarski, A. and Givant, S., A Formalization of Set Theory without Variables, A.M.S. Coll. Pub., vol. 41, 1987.