Author:
Hurd Joe,McIver Annabelle,Morgan Carroll
Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. A Discipline of Programming;Dijkstra,1976
2. Mechanizing programming logics in higher order logic;Gordon,1989
3. Introduction to HOL (A theorem-proving environment for higher order logic);Gordon,1993
4. M. Gordon, R. Milner, C. Wadsworth, Edinburgh LCF, Lecture Notes in Computer Science, Vol. 78, Springer, Berlin, 1979.
5. J. Harrison, Formalizing Dijkstra, in: J. Grundy, M. Newey (Eds.), Theorem Proving in Higher Order Logics, 11th Internat. Conf., TPHOLs ’98, Lecture Notes in Computer Science, Vol. 1497, Canberra, Australia, Springer, Berlin, September 1998, pp. 171–188.
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Quantitative Analysis on Coin Flipping Protocol;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2024
2. Uncertainty and Probabilistic UTP;Lecture Notes in Computer Science;2024
3. A Deductive Verification Infrastructure for Probabilistic Programs;Proceedings of the ACM on Programming Languages;2023-10-16
4. Program logic for higher-order probabilistic programs in Isabelle/HOL;Science of Computer Programming;2023-08
5. Slicing of probabilistic programs based on specifications;Science of Computer Programming;2022-08