Hoare-Style Logic for Unstructured Programs-Reference-Cited by-同舟云学术

Hoare-Style Logic for Unstructured Programs

Published:2020 Issue: Volume: Page:193-213
ISSN:0302-9743
Container-title:Software Engineering and Formal Methods
language:
Short-container-title:

Author:

Lundberg Didrik^ORCID,Guanciale Roberto^ORCID,Lindner Andreas^ORCID,Dam Mads^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-58768-0_11

Reference59 articles.

1. Appel, A.W.: Foundational proof-carrying code. In: Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, pp. 247–256. IEEE (2001)

2. Arbib, M.A., Alagić, S.: Proof rules for gotos. Acta Informatica 11(2), 139–148 (1979). https://doi.org/10.1007/BF00264021

3. Ashcroft, E., Hoare, C.A.R., et al.: Remarks on “program proving: jumps and functions” by M. Clint and C.A.R. Hoare. Acta Informatica 6, 317–318 (1976)

4. Barnett, M., Leino, K.R.M.: Weakest-precondition of unstructured programs. In: Proceedings of the 6th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pp. 82–87 (2005)

5. Bartels, B.: A mechanized verification environment for real-time process algebras and low-level programming languages. Ph.D. thesis, Technical University of Berlin (2014)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mechanised Operational Reasoning for C11 Programs with Relaxed Dependencies;Formal Aspects of Computing;2023-06-23

2. HOL4P4;Proceedings of the 5th International Workshop on P4 in Europe;2022-12-06

3. Loop Verification with Invariants and Contracts;Lecture Notes in Computer Science;2022

4. Owicki-Gries Reasoning for C11 Programs with Relaxed Dependencies;Formal Methods;2021