Argosy: verifying layered storage systems with recovery refinement-Reference-Cited by-同舟云学术

Argosy: verifying layered storage systems with recovery refinement

Published:2019-06-08 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation
language:
Short-container-title:

Author:

Chajed Tej¹,Tassarotti Joseph¹,Kaashoek M. Frans¹,Zeldovich Nickolai¹

Affiliation:

1. Massachusetts Institute of Technology, USA

Funder

National Science Foundation

Google

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3314221.3314585

Reference30 articles.

1. NetKAT

2. Parameterised notions of computation

3. Ryan Beckett Eric Campbell and Michael Greenberg. 2017. Kleene Algebra Modulo Theories. arXiv: cs.PL/1707.02894 Ryan Beckett Eric Campbell and Michael Greenberg. 2017. Kleene Algebra Modulo Theories. arXiv: cs.PL/1707.02894

4. Temporal NetKAT

5. Thomas Braibant and Damien Pous. 2012. Deciding Kleene Algebras in Coq. Logical Methods in Computer Science 8 1 (2012). Thomas Braibant and Damien Pous. 2012. Deciding Kleene Algebras in Coq. Logical Methods in Computer Science 8 1 (2012).

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

1. A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests;Programming Languages and Systems;2023

2. Separation Logic-Based Verification Atop a Binary-Compatible Filesystem Model;Lecture Notes in Computer Science;2020

3. Verifying concurrent, crash-safe systems with Perennial;Proceedings of the 27th ACM Symposium on Operating Systems Principles;2019-10-27

4. QED at Large: A Survey of Engineering of Formally Verified Software;Foundations and Trends® in Programming Languages;2019