Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs最新文献

Reflection, rewinding, and coin-toss in EasyCrypt 在EasyCrypt中反射、倒带和抛硬币

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2022-01-17 DOI: 10.1145/3497775.3503693

Denis Firsov, Dominique Unruh

引用次数: 4

Applying formal verification to microkernel IPC at meta 形式验证在微内核IPC上的应用

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2022-01-17 DOI: 10.1145/3497775.3503681

Quentin Carbonneaux, Noam Zilberstein, C. Klee, P. O'Hearn, Francesco Zappa Nardelli

{"title":"Applying formal verification to microkernel IPC at meta","authors":"Quentin Carbonneaux, Noam Zilberstein, C. Klee, P. O'Hearn, Francesco Zappa Nardelli","doi":"10.1145/3497775.3503681","DOIUrl":"https://doi.org/10.1145/3497775.3503681","url":null,"abstract":"We use Iris, an implementation of concurrent separation logic in the Coq proof assistant, to verify two queue data structures used for inter-process communication in an operating system under development. Our motivations are twofold. First, we wish to leverage formal verification to boost confidence in a delicate piece of industrial code that was subject to numerous revisions. Second, we aim to gain information on the cost-benefit tradeoff of applying a state-of-the-art formal verification tool in our industrial setting. On both fronts, our endeavor has been a success. The verification effort proved that the queue algorithms are correct and uncovered four algorithmic simplifications as well as bugs in client code. The simplifications involve the removal of two memory barriers, one atomic load, and one boolean check, all in a performance-sensitive part of the OS. Removing the redundant boolean check revealed unintended uses of uninitialized memory in multiple device drivers, which were fixed. The proof work was completed in person months, not years, by engineers with no prior familiarity with Iris. These findings are spurring further use of verification at Meta.","PeriodicalId":196529,"journal":{"name":"Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121543137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

The sel4 verification: the art and craft of proof and the reality of commercial support (invited talk) 自我验证:证明的艺术和工艺与商业支持的现实(特邀演讲)

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2022-01-17 DOI: 10.1145/3497775.3505265

June Andronick

引用次数: 0

Verbatim++: verified, optimized, and semantically rich lexing with derivatives 经过验证，优化和语义丰富的词法与衍生

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2022-01-17 DOI: 10.1145/3497775.3503694

D. Egolf, Sam Lasser, Kathleen Fisher

{"title":"Verbatim++: verified, optimized, and semantically rich lexing with derivatives","authors":"D. Egolf, Sam Lasser, Kathleen Fisher","doi":"10.1145/3497775.3503694","DOIUrl":"https://doi.org/10.1145/3497775.3503694","url":null,"abstract":"Lexers and parsers are attractive targets for attackers because they often sit at the boundary between a software system's internals and the outside world. Formally verified lexers can reduce the attack surface of these systems, thus making them more secure. One recent step in this direction is the development of Verbatim, a verified lexer based on the concept of Brzozowski derivatives. Two limitations restrict the tool's usefulness. First, its running time is quadratic in the length of its input string. Second, the lexer produces tokens with a simple \"tag and string\" representation, which limits the tool's ability to integrate with parsers that operate on more expressive token representations. In this work, we present a suite of extensions to Verbatim that overcomes these limitations while preserving the tool's original correctness guarantees. The lexer achieves effectively linear performance on a JSON benchmark through a combination of optimizations that, to our knowledge, has not been previously verified. The enhanced version of Verbatim also enables users to augment their lexical specifications with custom semantic actions, and it uses these actions to produce semantically rich tokens---i.e., tokens that carry values with arbitrary, user-defined types. All extensions were implemented and verified with the Coq Proof Assistant.","PeriodicalId":196529,"journal":{"name":"Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114992541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Forward build systems, formally 正式地向前构建系统

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2022-01-17 DOI: 10.1145/3497775.3503687

Sarah Spall, Neil Mitchell, Sam Tobin-Hochstadt

引用次数: 1

Mechanized verification of a fine-grained concurrent queue from meta’s folly library 来自meta的愚库的细粒度并发队列的机械化验证

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2022-01-17 DOI: 10.1145/3497775.3503689

Simon Friis Vindum, D. Frumin, L. Birkedal

{"title":"Mechanized verification of a fine-grained concurrent queue from meta’s folly library","authors":"Simon Friis Vindum, D. Frumin, L. Birkedal","doi":"10.1145/3497775.3503689","DOIUrl":"https://doi.org/10.1145/3497775.3503689","url":null,"abstract":"We present the first formal specification and verification of the fine-grained concurrent multi-producer-multi-consumer queue algorithm from Meta’s C++ library Folly of core infrastructure components. The queue is highly optimized, practical, and used by Meta in production where it scales to thousands of consumer and producer threads. We present an implementation of the algorithm in an ML-like language and formally prove that it is a contextual refinement of a simple coarse-grained queue (a property that implies that the MPMC queue is linearizable). We use the ReLoC relational logic and the Iris program logic to carry out the proof and to mechanize it in the Coq proof assistant. The MPMC queue is implemented using three modules, and our proof is similarly modular. By using ReLoC and Iris’s support for modular reasoning we verify each module in isolation and compose these together. A key challenge of the MPMC queue is that it has a so-called external linearization point, which ReLoC has no support for reasoning about. Thus we extend ReLoC, both on paper and in Coq, with novel support for reasoning about external linearization points.","PeriodicalId":196529,"journal":{"name":"Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115768030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Specification and verification of a transient stack 暂态堆栈的规范和验证

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2022-01-17 DOI: 10.1145/3497775.3503677

Alexandre Moine, A. Charguéraud, F. Pottier

引用次数: 0

Certified abstract machines for skeletal semantics 骨架语义的认证抽象机

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2022-01-17 DOI: 10.1145/3497775.3503676

Guillaume Ambal, Sergueï Lenglet, Alan Schmitt

引用次数: 2

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs 第11届ACM SIGPLAN认证程序和证明国际会议论文集

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2022-01-17 DOI: 10.1145/3497775

引用次数: 0

A drag-and-drop proof tactic 这是一种拖放防策略

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2022-01-17 DOI: 10.1145/3497775.3503692

Pablo Donato, Pierre-Yves Strub, Benjamin Werner

引用次数: 5