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

Semantic cut elimination for the logic of bunched implications, formalized in Coq 在Coq中形式化的聚类隐含逻辑的语义切割消除

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2021-12-10 DOI: 10.1145/3497775.3503690

D. Frumin

{"title":"Semantic cut elimination for the logic of bunched implications, formalized in Coq","authors":"D. Frumin","doi":"10.1145/3497775.3503690","DOIUrl":"https://doi.org/10.1145/3497775.3503690","url":null,"abstract":"The logic of bunched implications (BI) is a substructural logic that forms the backbone of separation logic, the much studied logic for reasoning about heap-manipulating programs. Although the proof theory and metatheory of BI are mathematically involved, the formalization of important metatheoretical results is still incipient. In this paper we present a self-contained formalized, in the Coq proof assistant, proof of a central metatheoretical property of BI: cut elimination for its sequent calculus. The presented proof is semantic, in the sense that is obtained by interpreting sequents in a particular “universal” model. This results in a more modular and elegant proof than a standard Gentzen-style cut elimination argument, which can be subtle and error-prone in manual proofs for BI. In particular, our semantic approach avoids unnecessary inversions on proof derivations, or the uses of cut reductions and the multi-cut rule. Besides modular, our approach is also robust: we demonstrate how our method scales, with minor modifications, to (i) an extension of BI with an arbitrary set of simple structural rules, and (ii) an extension with an S4-like □ modality.","PeriodicalId":196529,"journal":{"name":"Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132612981","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

Formalising lie algebras 李代数的形式化

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2021-12-08 DOI: 10.1145/3497775.3503672

Oliver Nash

引用次数: 1

Windmills of the minds: an algorithm for fermat’s two squares theorem 心智的风车:费马二平方定理的算法

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2021-12-05 DOI: 10.1145/3497775.3503673

Hing-Lun Chan

引用次数: 0

A verified algebraic representation of cairo program execution 经过验证的cairo程序执行的代数表示

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2021-09-29 DOI: 10.1145/3497775.3503675

J. Avigad, Lior Goldberg, D. Levit, Y. Seginer, Alon Titelman

引用次数: 3

Formal verification of a distributed dynamic reconfiguration protocol 分布式动态重配置协议的形式化验证

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2021-09-24 DOI: 10.1145/3497775.3503688

William Schultz, Ian Dardik, S. Tripakis

引用次数: 5

(Deep) induction rules for GADTs GADTs的(深)归纳规则

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2021-05-17 DOI: 10.1145/3497775.3503680

Patricia Johann, Enrico Ghiorzi

引用次数: 1

Overcoming restraint: composing verification of foreign functions with cogent 克服约束:用cogent组成外函数验证

Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2021-02-19 DOI: 10.1145/3497775.3503686

L. Cheung, Liam O'Connor, C. Rizkallah

{"title":"Overcoming restraint: composing verification of foreign functions with cogent","authors":"L. Cheung, Liam O'Connor, C. Rizkallah","doi":"10.1145/3497775.3503686","DOIUrl":"https://doi.org/10.1145/3497775.3503686","url":null,"abstract":"Cogent is a restricted functional language designed to reduce the cost of developing verified systems code. Because of its sometimes-onerous restrictions, such as the lack of support for recursion and its strict uniqueness type system, Cogent provides an escape hatch in the form of a foreign function interface (FFI) to C code. This poses a problem when verifying Cogent programs, as imported C components do not enjoy the same level of static guarantees that Cogent does. Previous verification of file systems implemented in Cogent merely assumed that their C components were correct and that they preserved the invariants of Cogent’s type system. In this paper, we instead prove such obligations. We demonstrate how they smoothly compose with existing Cogent theorems, and result in a correctness theorem of the overall Cogent-C system. The Cogent FFI constraints ensure that key invariants of Cogent’s type system are maintained even when calling C code. We verify reusable higher-order and polymorphic functions including a generic loop combinator and array iterators and demonstrate their application to several examples including binary search and the BilbyFs file system. We demonstrate the feasibility of verification of mixed Cogent-C systems, and provide some insight into verification of software comprised of code in multiple languages with differing levels of static guarantees.","PeriodicalId":196529,"journal":{"name":"Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs","volume":"238 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114385577","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