Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference34 articles.
1. Apt, K.R., Plotkin, G.D.: Countable nondeterminism and random assignment. J. ACM 33 (4) 724?767 (1986)
2. Back, R.J.R.: On the correctness of refinement steps in program development (Ph.D. thesis). Report A-1978-4, Dept. of Computer Science, University of Helsinki, 1978
3. Back, R.J.R.: Correctness preserving program refinements: proof theory and applications. Mathematical Center Tracts 131, Mathematical Centre, Amsterdam 1980
4. Back, R.J.R.: Proving total correctness of nondeterministic programs in infinitary logic. Acta Informatica 15 233?250 (1981)
5. Back, R.J.R.: On correct refinement of programs. J. Comput. Syst. Sci. 23 (1), 49?68 (1981)
Cited by
164 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Property-Based Testing: Climbing the Stairway to Verification;Proceedings of the 15th ACM SIGPLAN International Conference on Software Language Engineering;2022-11-29
2. Quantitative strongest post: a calculus for reasoning about the flow of quantitative information;Proceedings of the ACM on Programming Languages;2022-04-29
3. Modeling and Proving Distributed Algorithms for Dynamic Graphs;Future Generation Computer Systems;2020-07
4. Who Carries the Burden of Modularity?;Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles;2020
5. Verification by Construction of Distributed Algorithms;Theoretical Aspects of Computing – ICTAC 2019;2019