From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from mail2-relais-roc.national.inria.fr (mail2-relais-roc.national.inria.fr [192.134.164.83]) by c5ff346549e7 (Postfix) with ESMTPS id 81CFA5D5 for ; Mon, 14 Jun 2021 13:49:32 +0000 (UTC) X-IronPort-AV: E=Sophos;i="5.83,273,1616454000"; d="scan'208";a="513415289" Received: from prod-listesu18.inria.fr (HELO sympa.inria.fr) ([128.93.162.160]) by mail2-relais-roc.national.inria.fr with ESMTP; 14 Jun 2021 15:49:16 +0200 Received: by sympa.inria.fr (Postfix, from userid 20132) id 36120E00B4; Mon, 14 Jun 2021 15:49:16 +0200 (CEST) Received: from mail3-relais-sop.national.inria.fr (mail3-relais-sop.national.inria.fr [192.134.164.104]) by sympa.inria.fr (Postfix) with ESMTPS id 12DE9E0045 for ; Mon, 14 Jun 2021 15:49:10 +0200 (CEST) Authentication-Results: mail3-smtp-sop.national.inria.fr; spf=None smtp.pra=stevez@seas.upenn.edu; spf=Pass smtp.mailfrom=stevez@seas.upenn.edu; spf=None smtp.helo=postmaster@mail-qv1-f53.google.com IronPort-PHdr: =?us-ascii?q?A9a23=3Aaaj3JRNqqCyamx3gbS8l6nZfChdPi9zP1u491JM?= =?us-ascii?q?rhvp0f7i5+Ny6ZQqDvKQr1wWVFtSGo9t/yMPu+5j6XmIB5ZvT+FsjS7drEyE/t?= =?us-ascii?q?MMNggY7C9SEA0CoZNTjbig9AdgQHAQ9pyLzPkdaAtvxaEPPqXOu8zESBg//NQ1?= =?us-ascii?q?oLejpB4Lelcu62/229pHJbQhEmjWwbbx2IRi2sA7cqtQYjYx+J6gr1xDHuGFIe?= =?us-ascii?q?+NYxWNpIVKcgRPx7dqu8ZBg7ipdpesv+9ZPXqvmcas4S6dYDCk9PGAu+MLrrxj?= =?us-ascii?q?DQhCR6XYaT24bjwBHAwnB7BH9Q5fxri73vfdz1SWGIcH7S60/VC+85Kl3VhDnl?= =?us-ascii?q?CYHNyY48G7JjMxwkLlbqw+lqxBm3oLYfJ2ZOP94c6jAf90VWHBBU95PWSJBH42?= =?us-ascii?q?ybIUBAOQOMulEoIfwvEcOoBikCAWwGO/ixD1Fi3nr1qM6yeQhFgTG0RQ9EdISr?= =?us-ascii?q?nvUssv6P7oRXu+o1qbIyynMYO1Y2Df89IfDbxcsoeqQXb1ub8re10guGhjejlq?= =?us-ascii?q?Os4PlJCmZ1vkVs2eF6epgU/ijhHA6pAFsuzWiwNonhYbViIwP0F/E6Tl5z5gvJ?= =?us-ascii?q?d2+UEN2btqpHpVRuiyEOYZ4TcwsTn91tSs0xLALuIC3ciYXxZknxhPTdeCKfoy?= =?us-ascii?q?W7x/tWuucLyt1iG9ldr+hmhu/70utx+vhXce611ZKqzBKktjKtn0VzBzT68eHS?= =?us-ascii?q?uN5/ki73zaDzQfT6vtLIUwslarbLIIhzaIqlpoLq0jMAij2mEDugKCMakok//K?= =?us-ascii?q?k6+P9YrXpoJKXKox6ihnmP6gwhsCyBf40PwsOUmSB5+iwybnu8Vf5TbhElvE6j?= =?us-ascii?q?KjUvIzYKMkeqK60DA1Y3pom5hu8CjqqzcgUkHkbIF9Aex+KjIjkNl/LLf37D/q?= =?us-ascii?q?yglChnTJvyv3CI7LuHJDAI3ffnLv9Zrlw7VNXxhApwtBF/Z1UD6kMIPLtVU/1s?= =?us-ascii?q?9zVFho5PBa1w+bjEdl9z50eVX+WDq+XMK7fv0WE5u0oI+mLa48VvCjyJ+I56P7?= =?us-ascii?q?piH81gV4dfa+30psLcH20AOhqLkGDbXfvgtoNC3kGshc6QeDwiFCPXyZfZ3OoU?= =?us-ascii?q?KI94jE7BpimDYDGRo21m7yBwDm0HoNIaWFHEV2MCmnneJ+fW/sWdSKSOtFukjo?= =?us-ascii?q?CVbS7VYAuyAyuuBfgy7V7NurU5jEYtZX72ddp/eLTkBUy+SVwD8ScyGGNU3p5n?= =?us-ascii?q?ngIRj8zxKBwu1ZxylaF0ahigvxXD8Zf5/1TUlRyCZmJxOV/D5X2WxndVtaPUle?= =?us-ascii?q?vBNu8Uh8rSddk+MMDfUs1KdmriBvOwCuhS+sOi7GVCY4c6a/VxD7sP8t7zTDL2?= =?us-ascii?q?LR33ApueddGKWDz3v03zAPUHYOc1hzBz85CmowH0SfWsnqbwGyI+kxUTVwpOU0?= =?us-ascii?q?gdWsSb1CQsMz04EWEQrOzW+xP2uppzMeDLu5TdISsgwgdAvjkP9vabiS6nGLiX?= =?us-ascii?q?X61?= IronPort-HdrOrdr: =?us-ascii?q?A9a23=3AwXK/xaG0Bq4SPIrWpLqExceALOsnbusQ8zAX?= =?us-ascii?q?Po5KOHhom7+j5r2TdZMgpGXJYVcqKQodcLW7UpVoLkmsk6KdjbNhX4tKPzOWwF?= =?us-ascii?q?dATrsSircKqgeIc0afygc078ZdmsNFebjN5DZB/KXHCUWDYq8dKRq8nJxAR92y?= =?us-ascii?q?856gd25XgmhbgTtENg=3D=3D?= X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: =?us-ascii?q?A0DZAQBwXcdgfzXbVdFRCYEJgyqBT1cWV?= =?us-ascii?q?YRIkVMtj1qMA4ERA1QCCQEDAQsBATcKBAEBhAxEgmsCHQcBBDQTAgQVAQEFAQE?= =?us-ascii?q?BAgEDAwQBEwEBDQsLCCcchWgNgjgpAYNmFgsGDwEFCAEBJAIFDAE0AhEVAjYBB?= =?us-ascii?q?QEsAwYCAQEFCwIMgk8BgwcBDp0OgQQ9izKBMoEBggcBAQaBQAWBEIM0CQ2BWQk?= =?us-ascii?q?JAQh+KoZ5hxgcgUlEgRQBJwwDgyuBQYEWCwMBgRcKEWuCWIJkgkkHGFAPPTsID?= =?us-ascii?q?gEBE3kFDBIFGAQJBQUGGg8CFwsPFhmQZEuLVoMqmimBFYMmgSyIY4cviSiCfAY?= =?us-ascii?q?OBSaDXoFChG+Eb4VpQZA8oWmGVowhKgITFoRNAgoHBhAjgUiBTB4MB00lEzuCN?= =?us-ascii?q?QEzCUcZDlaROYUUhWYlMgI2AgYBCQEBAwmJagEB?= X-IPAS-Result: =?us-ascii?q?A0DZAQBwXcdgfzXbVdFRCYEJgyqBT1cWVYRIkVMtj1qMA4E?= =?us-ascii?q?RA1QCCQEDAQsBATcKBAEBhAxEgmsCHQcBBDQTAgQVAQEFAQEBAgEDAwQBEwEBD?= =?us-ascii?q?QsLCCcchWgNgjgpAYNmFgsGDwEFCAEBJAIFDAE0AhEVAjYBBQEsAwYCAQEFCwI?= =?us-ascii?q?Mgk8BgwcBDp0OgQQ9izKBMoEBggcBAQaBQAWBEIM0CQ2BWQkJAQh+KoZ5hxgcg?= =?us-ascii?q?UlEgRQBJwwDgyuBQYEWCwMBgRcKEWuCWIJkgkkHGFAPPTsIDgEBE3kFDBIFGAQ?= =?us-ascii?q?JBQUGGg8CFwsPFhmQZEuLVoMqmimBFYMmgSyIY4cviSiCfAYOBSaDXoFChG+Eb?= =?us-ascii?q?4VpQZA8oWmGVowhKgITFoRNAgoHBhAjgUiBTB4MB00lEzuCNQEzCUcZDlaROYU?= =?us-ascii?q?UhWYlMgI2AgYBCQEBAwmJagEB?= X-IronPort-AV: E=Sophos;i="5.83,273,1616454000"; d="scan'208";a="384391636" X-MGA-submission: =?us-ascii?q?MDGDKl8Hc6m3OGfzCzWcbtXDXcm8w0M4z1RfeJ?= =?us-ascii?q?H7tgGDMrnQRtN9TraDz+cgGJno3RU4+8SE68nlm54sE37SRwhk3xXL2c?= =?us-ascii?q?K/85rz/GYBDjuK3poxZQ/gM98KPbOk+iHnzGf73cdapWKkq4ooxJ6jr2?= =?us-ascii?q?5cC7Jo0adz4Kv9VHTAskucPg=3D=3D?= Received: from mail-qv1-f53.google.com ([209.85.219.53]) by mail3-smtp-sop.national.inria.fr with ESMTP/TLS/AES256-GCM-SHA384; 14 Jun 2021 15:49:07 +0200 Received: by mail-qv1-f53.google.com with SMTP id u14so17529610qvq.6 for ; Mon, 14 Jun 2021 06:49:07 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=seas-upenn-edu.20150623.gappssmtp.com; s=20150623; h=to:from:subject:cc:message-id:date:user-agent:mime-version :content-transfer-encoding:content-language; bh=fSgqWFpmWGQOhPsZ/r7XeqNV3TQKPIPBUq629QQGVtc=; b=NbIYHCXN7F7o+nBCl/4ZDKRx6klNXfLzjnImAyoI/KlV5uWOX9LJAGVgbB/YK4IlKs zDW7yxjtmR8UZlt0oGgSZn9CcsAwyH2Nkw8t8U3aEuB++65Ut2SJ9j8yu4fxaAwMdrsS Ns0c7Cl5iV1o8y3EHKNdjRXQnqeRP/D12CcjIcXCtq1Y26ssHINGYCiZSnIoiOmJILPs TyPhiUUsNCkIpHtn4gI170NcZ4a6jssNv8ThTU1eQGN+ezHCEbbqB2zaWIxJcfgBJ3t8 e588/6oKPXFQ8LsO86voPPrgoT9RoCmEYVGGk/xznyK6G8EtYKCExrj6DUWlM8SAqIDP buUw== X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:to:from:subject:cc:message-id:date:user-agent :mime-version:content-transfer-encoding:content-language; bh=fSgqWFpmWGQOhPsZ/r7XeqNV3TQKPIPBUq629QQGVtc=; b=lTj2jingxOAL3J60rooKKz5/mjCW2P/vg9fTQQqgLt+/UGdDP9FBsXpVmZ3Gou0fHI b8vy/QjPm5tCFpwOHzCHq3nGc7jqM3qD3ApY57+JGTW9QB33E/PqN/QTW5AmHrNZGwb8 RjYRhnyImx1ftTUR1AtCghlLus9zIATre9xtmzGvCPQWMjg8M3eta9dNZ3MpA1l09ppA poQvPoERarYQ+AWRSJ9YmYuIXcMFVpffSj0NdW/LKQoCHBxq8vbskFs0vWgfmKOpYxRE ipl/EuTJZ403BF2gScvqeOAShq7DZaKuaWTZe3nci/nNvFMbXAytv5ofIHObg07YUkzN JA8Q== X-Gm-Message-State: AOAM531nyShZXO4vN105dLhfKzLY0mMIjZMutAScllFa5qBV5BevNZGv +vI+UsnnZJOKMlLCqdcdSX8/Tw== X-Google-Smtp-Source: ABdhPJzuMCXOYlMK4t1yCmJMQiy6nREWv0IItmz3PVJ9zWKgcdV1jrhdG+cxdL2iYlt1UKPNm1gbEw== X-Received: by 2002:a05:6214:1801:: with SMTP id o1mr3227597qvw.13.1623678545864; Mon, 14 Jun 2021 06:49:05 -0700 (PDT) Received: from seasnet-50-11.cis.upenn.edu ([2607:f470:8:1050:8853:8769:99de:400b]) by smtp.gmail.com with ESMTPSA id s81sm10152459qka.82.2021.06.14.06.49.05 (version=TLS1_3 cipher=TLS_AES_128_GCM_SHA256 bits=128/128); Mon, 14 Jun 2021 06:49:05 -0700 (PDT) To: caml-list@inria.fr From: Steve Zdancewic Cc: Andrei Popescu Message-ID: <8b3efe8a-3892-a792-4b2e-1f08cd9215d5@seas.upenn.edu> Date: Mon, 14 Jun 2021 09:49:04 -0400 User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:78.0) Gecko/20100101 Thunderbird/78.11.0 MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Content-Language: en-US Subject: [Caml-list] Certified Programs and Proofs (CPP) 2022: Call for Papers Reply-To: Steve Zdancewic X-Loop: caml-list@inria.fr X-Sequence: 18524 Errors-To: caml-list-owner@inria.fr Precedence: list Precedence: bulk Sender: caml-list-request@inria.fr X-no-archive: yes List-Id: List-Help: List-Subscribe: List-Unsubscribe: List-Post: List-Owner: List-Archive: Archived-At: Certified Programs and Proofs (CPP) is an international conference on practical and theoretical topics in all areas that consider formal verification and certification as an essential paradigm for their work. CPP spans areas of computer science, mathematics, logic, and education. CPP 2022 (https://popl22.sigplan.org/home/CPP-2022) will be held on 16-18 January 2022 and will be co-located with POPL 2022 in Philadelphia, Pennsylvania, United States. CPP 2022 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG. CPP 2022 will welcome contributions from all members of the community. The CPP 2022 organizers will strive to enable both in-person and remote participation, in cooperation with the POPL 2022 organizers. IMPORTANT DATES * Abstract Submission Deadline: 16 September 2021 at 23:59 AoE (UTC-12h) * Paper Submission Deadline: 22 September 2021 at 23:59 AoE (UTC-12h) * Notification (tentative): 22 November 2021 * Camera Ready Deadline (tentative): 12 December 2021 * Conference: 16-18 January 2022 Deadlines expire at the end of the day, anywhere on earth. Abstract and submission deadlines are strict and there will be no extensions. DISTINGUISHED PAPER AWARDS Around 10% of the accepted papers at CPP 2022 will be designated as Distinguished Papers. This award highlights papers that the CPP program committee thinks should be read by a broad audience due to their relevance, originality, significance and clarity. TOPICS OF INTEREST We welcome submissions in research areas related to formal certification of programs and proofs. The following is a non-exhaustive list of topics of interest to CPP: * certified or certifying programming, compilation, linking, OS kernels, runtime systems, security monitors, and hardware; * certified mathematical libraries and mathematical theorems; * proof assistants (e.g, ACL2, Agda, Coq, Dafny, F*, HOL4, HOL Light, Idris, Isabelle, Lean, Mizar, Nuprl, PVS, etc); * new languages and tools for certified programming; * program analysis, program verification, and program synthesis; * program logics, type systems, and semantics for certified code; * logics for certifying concurrent and distributed systems; * mechanized metatheory, formalized programming language semantics, and logical frameworks; * higher-order logics, dependent type theory, proof theory, logical systems, separation logics, and logics for security; * verification of correctness and security properties; * formally verified blockchains and smart contracts; * certificates for decision procedures, including linear algebra, polynomial systems, SAT, SMT, and unification in algebras of interest; * certificates for semi-decision procedures, including equality, first-order logic, and higher-order unification; * certificates for program termination; * formal models of computation; * mechanized (un)decidability and computational complexity proofs; * formally certified methods for induction and coinduction; * integration of interactive and automated provers; * logical foundations of proof assistants; * applications of AI and machine learning to formal certification; * user interfaces for proof assistants and theorem provers; * teaching mathematics and computer science with proof assistants. SUBMISSION GUIDELINES Prior to the paper submission deadline, the authors should upload their anonymized paper in PDF format through the HotCRP system at https://cpp2022.hotcrp.com The submissions must be written in English and provide sufficient detail to allow the program committee to assess the merits of the contribution. They must be formatted following the ACM SIGPLAN Proceedings format using the acmart style with the sigplan option, which provides a two-column style, using 10 point font for the main text, and a header for double blind review submission, i.e., \documentclass[sigplan,10pt,anonymous,review]{acmart}\settopmatter{printfolios=true,printccs=false,printacmref=false} The submitted papers should not exceed 12 pages, including tables and figures, but excluding bibliography and clearly marked appendices. The papers should be self-contained without the appendices. Shorter papers are welcome and will be given equal consideration. Submissions not conforming to the requirements concerning format and maximum length may be rejected without further consideration. CPP 2022 will employ a lightweight double-blind reviewing process. To facilitate this, the submissions must adhere to two rules: (1) author names and institutions must be omitted, and (2) references to authors’ own related work should be in the third person (e.g., not "We build on our previous work ..." but rather "We build on the work of ..."). The purpose of this process is to help the PC and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing it more difficult. In particular, important background references should not be omitted or anonymized. In addition, authors are free to disseminate their ideas or draft versions of their papers as usual. For example, authors may post drafts of their papers on the web or give talks on their research ideas. POPL has answers to frequently asked questions addressing many common concerns: https://popl20.sigplan.org/track/POPL-2020-Research-Papers#Submission-and-Reviewing-FAQ We strongly encourage the authors to provide any supplementary material that supports the claims made in the paper, such as proof scripts or experimental data. This material must be uploaded at submission time, as an archive, not via a URL. Two forms of supplementary material may be submitted: (1) Anonymous supplementary material is made available to the reviewers before they submit their first-draft reviews. (2) Non-anonymous supplementary material is made available to the reviewers after they have submitted their first-draft reviews and have learned the identity of the authors. Please use anonymous supplementary material whenever possible, so that it can be taken into account from the beginning of the reviewing process. The submitted papers must adhere to the SIGPLAN Republication Policy (https://www.sigplan.org/Resources/Policies/Republication/) and the ACM Policy on Plagiarism (https://www.acm.org/publications/policies/plagiarism). Concurrent submissions to other conferences, journals, workshops with proceedings, or similar forums of publication are not allowed. The PC chairs should be informed of closely related work submitted to a conference or journal in advance of submission. One author of each accepted paper is expected to present it at the (possibly virtual) conference. PUBLICATION, COPYRIGHT AND OPEN ACCESS The CPP 2022 proceedings will be published by the ACM, and authors of accepted papers will be required to choose one of the following publication options: (1) Author retains copyright of the work and grants ACM a non-exclusive permission-to-publish license and, optionally, licenses the work under a Creative Commons license. (2) Author retains copyright of the work and grants ACM an exclusive permission-to-publish license. (3) Author transfers copyright of the work to ACM. For authors who can afford it, we recommend option (1), which will make the paper Gold Open Access, and also encourage such authors to license their work under the CC-BY license. ACM will charge you an article processing fee for this option (currently, US$700), which you have to pay directly with the ACM. For everyone else, we recommend option (2), which is free and allows you to achieve Green Open Access, by uploading a preprint of your paper to a repository that guarantees permanent archival such as arXiv or HAL. This is anyway a good idea for timely dissemination even if you chose option 1. Ensuring timely dissemination is particularly important for this edition, since, because of the very tight schedule, the official proceedings might not be available in time for CPP. The official CPP 2022 proceedings will also be available via SIGPLAN OpenTOC (http://www.sigplan.org/OpenTOC/#cpp). For ACM’s take on this, see their Copyright Policy (http://www.acm.org/publications/policies/copyright-policy) and Author Rights (http://authors.acm.org/main.html). PROGRAM COMMITTEE Andrei Popescu, University of Sheffield, United Kingdom (co-chair) Steve Zdancewic, University of Pennsylvania, United States (co-chair) Mohammad Abdulaziz, TU München, Germany Mauricio Ayala-Rincón, Universidade de Brasília, Brazil Andrej Bauer, University of Ljubljana, Slovenia Thomas Bauereiss, University of Cambridge, United Kingdom Yves Bertot, Inria and Université Cote d'Azur, France Lars Birkedal, Aarhus University, Denmark Sylvie Boldo, Inria and Université Paris-Saclay, France Qinxiang Cao, Shanghai Jiao Tong University, China Évelyne Contejean, Laboratoire Méthodes Formelles, CNRS, France Benjamin Delaware, Purdue University, United States Simon Foster, University of York, United Kingdom Alwyn Goodloe, NASA Langley Research Center, United States Armaël Guéneau, Aarhus University, Denmark John Harrison, Amazon Web Services, United States Joe Hendrix, Galois, Inc, United States Aquinas Hobor, National University of Singapore, Singapore Ralf Jung, MPI-SWS, Germany Cezary Kaliszyk, University of Innsbruck, Austria Jeehoon Kang, KAIST, South Korea Hongjin Liang, Nanjing University, China Gregory Malecha, BedRock Systems, Inc, United States Anders Mörtberg, Stockholm University, Sweden Toby Murray, University of Melbourne, Australia Zoe Paraskevopoulou , Northeastern University, United States Brigitte Pientka, McGill University, Canada Aseem Rastogi, Microsoft Research, India Bas Spitters, Aarhus University, Denmark Kathrin Stark, Princeton University, United States Hira Taqdees Syeda, Chalmers University of Technology, Sweden Joseph Tassarotti, Boston College, United States Laura Titolo, NIA/NASA LaRC, United States Sophie Tourret, Inria, France Dmitriy Traytel, University of Copenhagen, Denmark Floris van Doorn, Paris-Saclay University, France Freek Verbeek, Open University of The Netherlands, Netherlands Freek Wiedijk, Radboud Universiteit Nijmegen, Netherlands ORGANIZERS Lennart Beringer, Princeton University, United States (conference co-chair) Robbert Krebbers, Radboud University, Netherlands (conference co-chair) Andrei Popescu, University of Sheffield, United Kingdom (PC co-chair) Steve Zdancewic, University of Pennsylvania, United States (PC co-chair) CONTACT For any questions please contact the two PC chairs: Andrei Popescu Steve Zdancewic