Proceedings of the 2015 Conference on Certified Programs and Proofs最新文献

Clean-Slate Development of Certified OS Kernels 经过认证的OS内核的全新开发

Proceedings of the 2015 Conference on Certified Programs and Proofs Pub Date : 2015-01-13 DOI: 10.1145/2676724.2693180

Zhong Shao

引用次数: 6

A Framework for Verifying Depth-First Search Algorithms 深度优先搜索算法的验证框架

Proceedings of the 2015 Conference on Certified Programs and Proofs Pub Date : 2015-01-13 DOI: 10.1145/2676724.2693165

P. Lammich, René Neumann

引用次数: 20

Certified Normalization of Context-Free Grammars 上下文无关语法的认证规范化

Proceedings of the 2015 Conference on Certified Programs and Proofs Pub Date : 2015-01-13 DOI: 10.1145/2676724.2693177

Denis Firsov, Tarmo Uustalu

引用次数: 10

Completeness and Decidability of de Bruijn Substitution Algebra in Coq Coq中de Bruijn代换代数的完备性和可判定性

Proceedings of the 2015 Conference on Certified Programs and Proofs Pub Date : 2015-01-13 DOI: 10.1145/2676724.2693163

S. Schäfer, G. Smolka, Tobias Tebbi

引用次数: 23

Practical Tactics for Verifying C Programs in Coq 在Coq中验证C程序的实用策略

Proceedings of the 2015 Conference on Certified Programs and Proofs Pub Date : 2015-01-13 DOI: 10.1145/2676724.2693162

Jingyuan Cao, Ming Fu, Xinyu Feng

{"title":"Practical Tactics for Verifying C Programs in Coq","authors":"Jingyuan Cao, Ming Fu, Xinyu Feng","doi":"10.1145/2676724.2693162","DOIUrl":"https://doi.org/10.1145/2676724.2693162","url":null,"abstract":"Proof automation is essential for large scale proof development such as OS kernel verification. An effective approach is to develop tactics and SMT solvers to automatically prove verification conditions. However, for complex systems, it is almost impossible to achieve fully automated verification and human interactions are unavoidable. So the key challenge here is, on the one hand, to reduce manual proofs as much as possible, and on the other hand, to provide user-friendly error messages when the automated verification fails, so that users could adjust specifications or the code accordingly, or to do part of the proofs manually. In this paper we propose a set of practical tactics for verifying C programs in Coq, including both tactics for automatically proving separation logic assertions and ones for automatic verification condition generation. In particular, we develop special tactics for verifying programs manipulating singly-linked lists. Using our tactics we are able to verify several C programs with one-line proof script. Another key feature of our tactics is that, if the tactics fail, they allow users to easily locate problems causing the failure by looking into the remaining subgoals, which greatly improves the usability when human interaction is necessary.","PeriodicalId":187702,"journal":{"name":"Proceedings of the 2015 Conference on Certified Programs and Proofs","volume":"265 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122749107","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}

引用次数: 9

Proceedings of the 2015 Conference on Certified Programs and Proofs 2015年认证程序与证明会议论文集

Proceedings of the 2015 Conference on Certified Programs and Proofs Pub Date : 2015-01-13 DOI: 10.1145/2676724

X. Leroy, Alwen Tiu

{"title":"Proceedings of the 2015 Conference on Certified Programs and Proofs","authors":"X. Leroy, Alwen Tiu","doi":"10.1145/2676724","DOIUrl":"https://doi.org/10.1145/2676724","url":null,"abstract":"It is our great pleasure to welcome you to CPP 2015, the fourth ACM SIGPLAN conference on Certified Proofs and Programs. The CPP series of meetings aims to cover those topics in computer science and mathematics in which certification via formal techniques is crucial. Topics of interest range from interactive and automated theorem proving to program proof to the mechanization of mathematics, with the production of independently-checkable certificates as a recurring theme. A manifesto for CPP, written by Jean-Pierre Jouannaud and Zhong Shao, can be found at http://cpp2015.inria.fr/manifesto.html. \u0000 \u0000The first three editions of CPP were held in December 2011 in Taipei (Taiwan), in December 2012 in Kyoto (Japan); and in December 2013 in Melbourne (Australia), all three co-located with APLAS, the Asian Symposium on Programming Languages and Systems. This year, for the first time, CPP is sponsored by ACM SIGPLAN and is co-located with POPL'15, the 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, in Mumbai, India. We are deeply grateful to ACM SIGPLAN for sponsoring CPP'15, and to the POPL'15 general chair and local organizers for hosting CPP'15. \u0000 \u0000We were pleased that Zhong Shao (Yale University) and Viktor Vafeiadis (MPI SWS) accepted our invitation to be invited speakers for CPP'15. Abstracts of their presentations are included in the proceedings. \u0000 \u0000The program committee for CPP'15 was composed of 19 researchers from 12 countries. In response to the call for papers, we received a total of 26 submissions and accepted 18 papers for presentation and inclusion in the proceedings. Every submission was reviewed by at least four program committee members and their selected subreviewers. The electronic PC meeting was conducted with the help of the Easychair conference management system.","PeriodicalId":187702,"journal":{"name":"Proceedings of the 2015 Conference on Certified Programs and Proofs","volume":"37 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132537046","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

Fixed Precision Patterns for the Formal Verification of Mathematical Constant Approximations 数学常数近似形式验证的固定精度模式

Proceedings of the 2015 Conference on Certified Programs and Proofs Pub Date : 2015-01-13 DOI: 10.1145/2676724.2693172

Yves Bertot

引用次数: 5

Proving Lock-Freedom Easily and Automatically 证明锁自由容易和自动

Proceedings of the 2015 Conference on Certified Programs and Proofs Pub Date : 2015-01-13 DOI: 10.1145/2676724.2693179

Xiao Jia, Wei Li, Viktor Vafeiadis

引用次数: 7

Premise Selection and External Provers for HOL4 HOL4的前提选择和外部证明

Proceedings of the 2015 Conference on Certified Programs and Proofs Pub Date : 2015-01-13 DOI: 10.1145/2676724.2693173

Thibault Gauthier, C. Kaliszyk

引用次数: 45

A Lightweight Formalization of the Metatheory of Bisimulation-Up-To 双仿真元理论的轻量级形式化

Proceedings of the 2015 Conference on Certified Programs and Proofs Pub Date : 2015-01-13 DOI: 10.1145/2676724.2693170

Kaustuv Chaudhuri, M. Cimini, D. Miller

{"title":"A Lightweight Formalization of the Metatheory of Bisimulation-Up-To","authors":"Kaustuv Chaudhuri, M. Cimini, D. Miller","doi":"10.1145/2676724.2693170","DOIUrl":"https://doi.org/10.1145/2676724.2693170","url":null,"abstract":"Bisimilarity of two processes is formally established by producing a bisimulation relation that contains those two processes and obeys certain closure properties. In many situations, particularly when the underlying labeled transition system is unbounded, these bisimulation relations can be large and even infinite. The bisimulation-up-to technique has been developed to reduce the size of the relations being computed while retaining soundness, that is, the guarantee of the existence of a bisimulation. Such techniques are increasingly becoming a critical ingredient in the automated checking of bisimilarity. This paper is devoted to the formalization of the meta theory of several major bisimulation-up-to techniques for the process calculi CCS and the π-calculus (with replication). Our formalization is based on recent work on the proof theory of least and greatest fixpoints, particularly the use of relations defined (co-)inductively, and of co-inductive proofs about such relations, as implemented in the Abella theorem prover. An important feature of our formalization is that our definitions of the bisimulation-up-to relations are, in most cases, straightforward translations of published informal definitions, and our proofs clarify several technical details of the informal descriptions. Since the logic behind Abella also supports λ-tree syntax and generic reasoning using the ∇-quantifier, our treatment of the λ-calculus is both direct and natural.","PeriodicalId":187702,"journal":{"name":"Proceedings of the 2015 Conference on Certified Programs and Proofs","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124080803","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}

引用次数: 10