Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. F. Berman, A completeness technique for D-axiomatizable semantics; Proc. Eleventh ACM Symp. on Theory of Computing (1979) 160–166.
2. R.L. Constable and M.J. O'Donnell, A Programming Logic; Winthrop, Cambridge (1978).
3. M. Fischer and R. Ladner, Propositional Dynamic Logic of regular programs; Jour.Comp.Syst.Sc. 18 (1979) 194–211.
4. D.M. Gabbay, Axiomatizations of Logics of Programs; manuscript, (1977).
5. D. Kozen and R. Parikh, An elementary proof of the completeness of PDL; to appear in Theor. Comp. Sc..
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献