Some open questions in the theory of program schemes and dynamic logics

CONTENTS Introduction § 1. Preliminary information § 2. Brief survey of known results § 3. Open questions and relevant results § 4. Concurrence § 5. Functions and data of higher types References

[1]  Alexei P. Stolboushkin,et al.  Flow-diagrams with sets , 1988, Conference on Computer Logic.

[2]  Andreas Goerdt,et al.  On the Expressive Strength of the Finitely Typed Lambda-Terms , 1988, MFCS.

[3]  Neil Immerman,et al.  Nondeterministic space is closed under complementation , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[4]  David Peleg,et al.  Concurrent Program Schemes and Their Logics , 1987, Theor. Comput. Sci..

[5]  David Peleg,et al.  Communication in Concurrent Dynamic Logic , 1987, J. Comput. Syst. Sci..

[6]  David Peleg,et al.  Concurrent dynamic logic , 1987, JACM.

[7]  Pawel Urzyczyn,et al.  "During" Cannot be Expressed by "After" , 1986, J. Comput. Syst. Sci..

[8]  Assaf J. Kfoury,et al.  The Unwind Property for Programs with Bounded Memory , 1985, Inf. Process. Lett..

[9]  Assaf J. Kfoury,et al.  Definability by Deterministic and Non-deterministic Programs (with Applications to First-Order Dynamic Logic) , 1985, Inf. Control..

[10]  David Peleg,et al.  More on Looping vs. Repeating in Dynamic Logic , 1985, Inf. Process. Lett..

[11]  Jerzy Tiuryn,et al.  Unbounded Program Memory Adds to the Expressive Power of First-Order Programming Logic , 1984, Inf. Control..

[12]  Jerzy Tiuryn,et al.  Equivalences among Logics of Programs , 1984, J. Comput. Syst. Sci..

[13]  Alexei P. Stolboushkin,et al.  Regular Dynamic Logic Is Not Interpretable in Deterministic Context-Free Dynamic Logic , 1984, Inf. Control..

[14]  Jerzy Tiuryn,et al.  Remarks on Comparing Expressive Power of Logics of Programs , 1984, MFCS.

[15]  Pawel Urzyczyn,et al.  Nontrivial Definability by Flow-Chart Programs , 1984, Inf. Control..

[16]  J. Tiuryn,et al.  Some relationships between logics of programs and complexity theory , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[17]  Pawel Urzyczyn,et al.  Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs , 1983, FCT.

[18]  Joseph Y. Halpern,et al.  Effective Axiomatizations of Hoare Logics , 1983, JACM.

[19]  Michael A. Taitslin,et al.  Deterministic Dynamic Logic is Strictly Weaker than Dynamic Logic , 1983, Inf. Control..

[20]  Jerzy Tiuryn,et al.  On the Power of Nondeterminism in Dynamic Logic , 1982, ICALP.

[21]  Karl Winklmann,et al.  Expressing Program Looping in Regular Dynamic Logic , 1982, Theor. Comput. Sci..

[22]  Pawel Urzyczyn,et al.  The Unwind Property in Certain Algebras , 1981, Inf. Control..

[23]  Albert R. Meyer,et al.  Definability in Dynamic Logic , 1980, STOC '80.

[24]  Sheila A. Greibach,et al.  Theory of Program Structures: Schemes, Semantics, Verification , 1976, Lecture Notes in Computer Science.

[25]  Carl Hewitt,et al.  Comparative Schematology , 1970 .

[26]  A. J. Kfoury,et al.  The Pebble Game and Logics of Programs , 1985 .

[27]  David Peleg,et al.  On Static Logics, Dynamic Logics, and Complexity Classes , 1984, Inf. Control..

[28]  A. P. Stolboushkin,et al.  Positive program logics in systems with arithmetic , 1984 .

[29]  M. A. Taitslin,et al.  Hierarchies of program logics , 1983 .

[30]  Alexei P. Stolboushkin,et al.  The Comparison of the Expressive Power of First-Order Dynamic Logics , 1983, Theor. Comput. Sci..

[31]  Assaf J. Kfoury,et al.  Definability by Programs in First-Order Structures , 1983, Theor. Comput. Sci..

[32]  Pawel Urzyczyn,et al.  Algorithmic triviality of abstract structures , 1981, Fundam. Informaticae.

[33]  Edmund M. Clarke,et al.  Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems , 1979, JACM.

[34]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[35]  J. V. Tucker,et al.  COMPUTING IN ALGEBRAIC SYSTEMS , 1978 .

[36]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[37]  Harvey M. Friedman,et al.  Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory , 1971 .

[38]  A. Ehrenfeucht.  An application of games to the completeness problem for formalized theories , 1961 .