Abstract
The aim of this paper is to ground Algorithmic (or Dynamic) Logic on Algebraic semantics in the french acceptation of the term, i.e. theory in which the meaning of a program is a tree resulting from an infinite formal unfolding. We present an algorithmic system in which programs are program-trees and also an example of how it can be applied in order to design systems for programs. Another feature is the use of techniques of Lω1ω (the notion of Consistency Property) for proving completeness and Model Existence theorems.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J.W. DE BAKKER: Recursive programs as predicate transformers, in: Formal descriptions of programming concepts, E.J. NEUHOLD ed. North Holland, 1978 p. 165–202.
B. COURCELLE, M. NIVAT: The Algebraic Semantics of Recursive Program Schemes, in Proc. 7th MFCS Symposium, 1978, Lecture Notes in Computer Science, Vol. 62, p. 16–30.
G. COUSINEAU: Les arbres à feuilles indicées: un cadre algébrique de définition des structures de contrôle. Thèse d'Etat, Paris, 1977.
G. COUSINEAU: An algebraic definition of control structures, Theoretical Computer Science 12, 1980, p. 175–192.
G. COUSINEAU: La programmation en EXEL; revue technique THOMSON-CSF, Vol. 10, no 2, 1978, p. 209–234 et Vol. 11, no 1, 1979, p. 13–35.
G. COUSINEAU, P. ENJALBERT: Program Equivalence and provability, Lecture notes in Computer Science no 74, p. 237–245.
DONER: Tree acceptors and some of their applications, J. Comput. System Science, Vol. 4, 1970, p. 406–451.
P. ENJALBERT: Systèmes de déduction pour les arbres et les schémas de programmes, RAIRO Informatique Théorique, Vol. 15, no 1, 1981, p. 3–21 et Vol. 14, no 4, 1980.
P. ENJALBERT: Contribution à l'étude de la logique Algorithmique... Thèse d'Etat Paris VII, 1981.
P. ENJALBERT: ω-rules and continuity. To appear in: Proceedings of Bialowieza Conference on program logics, 1981.
D. HAREL: First order dynamic logic, springer lecture notes in Computer Science, no 68, 1979.
C. HENRY: Etude des transformations de programmes EXEL, réalisation d'un transformateur automatique, contrat SESORI no 218, Rapport final, 1980.
H.J. KEISLER: Model theory for infinitary Logic, Studies in logic and the foundations of Mathematics, Vol. 62, North Holland, 1971.
F. KRÖGER: Infinite proof rules for loops. Acta Informatica, Vol. 14, Fas. 4, 1980.
G. MIRKOWSKA: Propositional algorithmic logic. Internal report, Institut de Mathématiques, Université de Varsovie, 1979.
A. SALWICKI: Formalized algorithmic languages, Bull. Acad. Pol. Sci. Ser. Math. Astr. Phys. 18, 1970, p. 227–232.
D. SCOTT: The lattice of flow diagrams in: Symposium on semantics of algorithmic languages (E. ENGELER ed.), Lecture notes in Math., no 188, Springer Verlag, Berlin, 1971.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Enjalbert, P. (1983). Algebraic semantics and program logics: Algorithmic logic for program trees. In: Salwicki, A. (eds) Logics of Programs and Their Applications. Logic of Programs 1980. Lecture Notes in Computer Science, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11981-7_9
Download citation
DOI: https://doi.org/10.1007/3-540-11981-7_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11981-4
Online ISBN: 978-3-540-39445-7
eBook Packages: Springer Book Archive