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

Under-Approximation for Scalable Bug Detection (Keynote) 可扩展错误检测的欠逼近（主题演讲）

Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2024-01-09 DOI: 10.1145/3636501.3637683

Azalea Raad

{"title":"Under-Approximation for Scalable Bug Detection (Keynote)","authors":"Azalea Raad","doi":"10.1145/3636501.3637683","DOIUrl":"https://doi.org/10.1145/3636501.3637683","url":null,"abstract":"Incorrectness Logic (IL) has recently been advanced as a logical under-approximate theory for proving the presence of bugs - dual to Hoare Logic, which is an over-approximate theory for proving the absence of bugs. To facilitate scalable bug detection, later we developed incorrectness separation logic (ISL) by marrying the under-approximate reasoning of IL with the local reasoning of separation logic and its frame rule. This locality leads to techniques that are compositional both in code (concentrating on a program component) and in the resources accessed (spatial locality), without tracking the entire global state or the global program within which a component sits. This enables reasoning to scale to large teams and codebases: reasoning can be done even when a global program is not present. We then developed Pulse-X, an automatic program analysis for catching memory safety errors, underpinned by ISL. Using PulseX, deployed at Meta, we found a number of real bugs in codebases such as OpenSSL, which were subsequently confirmed and fixed. We have compared the performance of Pulse-X against the state-of-the-art tool Infer on a number of large programs; our comparison shows that Pulse-X is comparable with Infer in terms of performance, and in certain cases its fix-rate surpasses that of Infer.","PeriodicalId":516581,"journal":{"name":"Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140511620","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}

引用次数: 0

Rooting for Efficiency: Mechanised Reasoning about Array-Based Trees in Separation Logic 为效率扎根：分离逻辑中基于数组的树的机械化推理

Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2024-01-09 DOI: 10.1145/3636501.3636944

Qiyuan Zhao, George Pîrlea, Zhendong Ang, Umang Mathur, Ilya Sergey

引用次数: 1

A Temporal Differential Dynamic Logic Formal Embedding 时态差分动态逻辑形式嵌入

Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2024-01-09 DOI: 10.1145/3636501.3636943

Lauren White, Laura Titolo, J. Slagel, César Muñoz

引用次数: 0

A Mechanised and Constructive Reverse Analysis of Soundness and Completeness of Bi-intuitionistic Logic 双直觉逻辑健全性和完备性的机制化和构造性反向分析

Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2024-01-09 DOI: 10.1145/3636501.3636957

Ian Shillito, Dominik Kirst

引用次数: 0

The Last Yard: Foundational End-to-End Verification of High-Speed Cryptography 最后一码高速密码学的端到端基础验证

Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2024-01-09 DOI: 10.1145/3636501.3636961

Philipp G. Haselwarter, B. S. Hvass, Lasse Letager Hansen, Théo Winterhalter, Cătălin Hriţcu, Bas Spitters

{"title":"The Last Yard: Foundational End-to-End Verification of High-Speed Cryptography","authors":"Philipp G. Haselwarter, B. S. Hvass, Lasse Letager Hansen, Théo Winterhalter, Cătălin Hriţcu, Bas Spitters","doi":"10.1145/3636501.3636961","DOIUrl":"https://doi.org/10.1145/3636501.3636961","url":null,"abstract":"The field of high-assurance cryptography is quickly maturing, yet a unified foundational framework for end-to-end formal verification of efficient cryptographic implementations is still missing. To address this gap, we use the Coq proof assistant to formally connect three existing tools: (1) the Hacspec emergent cryptographic specification language; (2) the Jasmin language for efficient, high-assurance cryptographic implementations; and (3) the SSProve foundational verification framework for modular cryptographic proofs. We first connect Hacspec with SSProve by devising a new translation from Hacspec specifications to imperative SSProve code. We validate this translation by considering a second, more standard translation from Hacspec to purely functional Coq code and generate a proof of the equivalence between the code produced by the two translations. We further define a translation from Jasmin to SSProve, which allows us to formally reason in SSProve about efficient cryptographic implementations in Jasmin. We prove this translation correct in Coq with respect to Jasmin's operational semantics. Finally, we demonstrate the usefulness of our approach by giving a foundational end-to-end Coq proof of an efficient AES implementation. For this case study, we start from an existing Jasmin implementation of AES that makes use of hardware acceleration and prove that it conforms to a specification of the AES standard written in Hacspec. We use SSProve to formalize the security of the encryption scheme based on the Jasmin implementation of AES.","PeriodicalId":516581,"journal":{"name":"Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139640505","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}

引用次数: 1

Displayed Monoidal Categories for the Semantics of Linear Logic 线性逻辑语义学的显示单义范畴

Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2024-01-09 DOI: 10.1145/3636501.3636956

Benedikt Ahrens, Ralph Matthes, N. V. D. Weide, Kobe Wullaert

{"title":"Displayed Monoidal Categories for the Semantics of Linear Logic","authors":"Benedikt Ahrens, Ralph Matthes, N. V. D. Weide, Kobe Wullaert","doi":"10.1145/3636501.3636956","DOIUrl":"https://doi.org/10.1145/3636501.3636956","url":null,"abstract":"We present a formalization of different categorical structures used to interpret linear logic. Our formalization takes place in UniMath, a library of univalent mathematics based on the Coq proof assistant. All the categorical structures we formalize are based on monoidal categories. As such, one of our contributions is a practical, usable library of formalized results on monoidal categories. Monoidal categories carry a lot of structure, and instances of monoidal categories are often built from complicated mathematical objects. This can cause challenges of scalability, regarding both the vast amount of data to be managed by the user of the library, as well as the time the proof assistant spends on checking code. To enable scalability, and to avoid duplication of computer code in the formalization, we develop \"displayed monoidal categories\". These gadgets allow for the modular construction of complicated monoidal categories by building them in layers; we demonstrate their use in many examples. Specifically, we define linear-non-linear categories and construct instances of them via Lafont categories and linear categories.","PeriodicalId":516581,"journal":{"name":"Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139640508","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}

引用次数: 1

Compositional Verification of Concurrent C Programs with Search Structure Templates 利用搜索结构模板对并发 C 语言程序进行组合验证

Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2024-01-09 DOI: 10.1145/3636501.3636940

Duc T. Nguyen, Lennart Beringer, William Mansky, Shengyi Wang

引用次数: 0

Formalizing Giles Gardam’s Disproof of Kaplansky’s Unit Conjecture 吉尔斯-加尔丹对卡普兰斯基单位猜想的形式化反证

Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2024-01-09 DOI: 10.1145/3636501.3636947

Siddhartha Gadgil, Anand Tadipatri

引用次数: 1

PfComp: A Verified Compiler for Packet Filtering Leveraging Binary Decision Diagrams PfComp：利用二进制判定图进行数据包过滤的验证编译器

Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2024-01-09 DOI: 10.1145/3636501.3636954

Clément Chavanon, Frédéric Besson, Tristan Ninet

引用次数: 0

Lean Formalization of Extended Regular Expression Matching with Lookarounds 带查找功能的扩展正则表达式匹配的精益形式化

Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2024-01-09 DOI: 10.1145/3636501.3636959

Ekaterina Zhuchko, Margus Veanes, Gabriel Ebner

引用次数: 1