On Expressive Interpretations of a Hoare-Logic for Clarke's Language L4

[1]  Hans Langmaack,et al.  Apects of Programs With Finite Modes , 1983, FCT.

[2]  Joseph Y. Halpern,et al.  From Denotational to Operational and Axiomatic Semantics for ALGOL-like Languages: an Overview , 1983, Logic of Programs.

[3]  Joseph Y. Halpern,et al.  On effective axiomatizations of Hoare logics , 1982, POPL '82.

[4]  John-Jules Ch. Meyer,et al.  Correctness of Programs with Function Procedures , 1981, Logic of Programs.

[5]  Ernst-Rüdiger Olderog,et al.  Present-Day Hoare-Like Systems for Programming Languages with Procedures: Power, Limits and most Likely Expressions , 1980, ICALP.

[6]  Akira Kanda,et al.  Fully Effective Solutions of Recursive Domain Equations , 1979, MFCS.

[7]  Richard J. Lipton,et al.  A necessary and sufficient condition for the existence of hoare logics , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[8]  Robert L. Constable,et al.  Computability concepts for programming language semantics , 1975, Theor. Comput. Sci..

[9]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

[10]  Ernst-Rüdiger Olderog,et al.  Correctnes of Programs with Pascal-Like Procedures without Global Variables , 1984, Theor. Comput. Sci..

[11]  Akira Kanda,et al.  Effective solutions of recursive domain equations , 1980 .

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

[13]  G. Takeuti.  Proof Theory , 1975 .