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 978DA5D4 for ; Thu, 16 Apr 2020 18:57:23 +0000 (UTC) X-IronPort-AV: E=Sophos;i="5.72,392,1580770800"; d="scan'208,217";a="445498111" Received: from sympa.inria.fr ([193.51.193.213]) by mail2-relais-roc.national.inria.fr with ESMTP; 16 Apr 2020 20:57:22 +0200 Received: by sympa.inria.fr (Postfix, from userid 20132) id 788467F487; Thu, 16 Apr 2020 20:57:22 +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 159567F449 for ; Thu, 16 Apr 2020 20:57:17 +0200 (CEST) Authentication-Results: mail3-smtp-sop.national.inria.fr; spf=None smtp.pra=andrei.h.popescu@gmail.com; spf=Pass smtp.mailfrom=andrei.h.popescu@gmail.com; spf=None smtp.helo=postmaster@mail-qt1-f170.google.com IronPort-PHdr: =?us-ascii?q?9a23=3AB0wPyBHKtv/va0CTz92rh51GYnF86YWxBRYc798d?= =?us-ascii?q?s5kLTJ76r8uwAkXT6L1XgUPTWs2DsrQf1LqQ7viocFdDyKjCmUhKSIZLWR4BhJ?= =?us-ascii?q?detC0bK+nBN3fGKuX3ZTcxBsVIWQwt1Xi6NU9IBJS2PAWK8TWapAQfERTnNAdz?= =?us-ascii?q?Ov+9WsuL15z2hKiO/MjYagBMwT68eq9aLROsrAyXuNNFr5FlL/MYzBfTr3oAQ+?= =?us-ascii?q?NOyHhjOBrHlhDw/Mqxup4l6yNItukq6uZPVKz7e+IzSrkOX2duCHw8+MC+7UqL?= =?us-ascii?q?dgCI/HZJFzxOykMUUTiA1wnzW9LKigW/rvB0gXDIMsj/TLRyUjOnvf8yFU3YzR?= =?us-ascii?q?wfPjt8y1n5z8x9iKUB/kCkrh17hpfIOcSbbaUmOKzaetweSCxKWcMDD3UQULP5?= =?us-ascii?q?VJMGCq86BcgdqoD8o1UUqh7nXFujAeruznlDgXqkhKA=3D?= X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: =?us-ascii?q?A0C8IQDZqZhehqqgVdFdCRwBAQEBAQcBA?= =?us-ascii?q?REBBAQBAYF7gSWBLESBByqDXECBHIJeimMbK5VYhXWBZwEJAQMBDCUKBAEBgyl?= =?us-ascii?q?WRU4BBIE7HAcBBDQTAhABAQUBAQECAQIDBAETAQEBCAsLCCmFXQyCKRIFASMBB?= =?us-ascii?q?oMJEAYLBh0BGwwFDAEDEgMNIgsBCQIjAQERAQUBLAkJDQQIgwQBgkoBAy4PlAG?= =?us-ascii?q?PEIEEPYsogRUFAReDAQWBNwWDMgoZJw1iA4E0AgcSgSaGDIYEJn6BHIEQATaDG?= =?us-ascii?q?IFBXT4LAwGBHAoRB1ISglOCXwSNfkWJDWaBZYcJj0sRIUkHgkeBAYcBhWmFMYF?= =?us-ascii?q?4gksdglSBBoNYg2yRF5khgj6DB413DyOBHCqBSB4MBzMaI1AxggQBMwlHGA1Xk?= =?us-ascii?q?QEag1mFFIVCQzACjXCBVAEB?= X-IPAS-Result: =?us-ascii?q?A0C8IQDZqZhehqqgVdFdCRwBAQEBAQcBAREBBAQBAYF7gSW?= =?us-ascii?q?BLESBByqDXECBHIJeimMbK5VYhXWBZwEJAQMBDCUKBAEBgylWRU4BBIE7HAcBB?= =?us-ascii?q?DQTAhABAQUBAQECAQIDBAETAQEBCAsLCCmFXQyCKRIFASMBBoMJEAYLBh0BGww?= =?us-ascii?q?FDAEDEgMNIgsBCQIjAQERAQUBLAkJDQQIgwQBgkoBAy4PlAGPEIEEPYsogRUFA?= =?us-ascii?q?ReDAQWBNwWDMgoZJw1iA4E0AgcSgSaGDIYEJn6BHIEQATaDGIFBXT4LAwGBHAo?= =?us-ascii?q?RB1ISglOCXwSNfkWJDWaBZYcJj0sRIUkHgkeBAYcBhWmFMYF4gksdglSBBoNYg?= =?us-ascii?q?2yRF5khgj6DB413DyOBHCqBSB4MBzMaI1AxggQBMwlHGA1XkQEag1mFFIVCQzA?= =?us-ascii?q?CjXCBVAEB?= X-IronPort-AV: E=Sophos;i="5.72,392,1580770800"; d="scan'208,217";a="346165279" X-MGA-submission: =?us-ascii?q?MDGStxcWpsrl1UA0OeHkaruT6ymLei1Itx4mYr?= =?us-ascii?q?+GtUDTqv3BRycJBc2JVucIwqZH1x/8Q4KcLpWCpQqVMz5rsjojUgtOFo?= =?us-ascii?q?EuhI2/fPNip9t2Q0Zr74nyZ+ASaL1UpVUuXmn11axeFl/Fn9pxhKZtSe?= =?us-ascii?q?uc9WtH/4o4zRS4yu66ZV2bcQ=3D=3D?= Received: from mail-qt1-f170.google.com ([209.85.160.170]) by mail3-smtp-sop.national.inria.fr with ESMTP/TLS/AES256-GCM-SHA384; 16 Apr 2020 20:57:15 +0200 Received: by mail-qt1-f170.google.com with SMTP id q17so17069619qtp.4 for ; Thu, 16 Apr 2020 11:57:15 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025; h=mime-version:from:date:message-id:subject:to:cc; bh=s0pR8gTUYgBdzPO4pxNaG+615Ivnt1QAT43zaZj3Z0I=; b=eP361WxWZ/d26L2N4Ch5IDdT00kxMc3rd/FowxCRhceZXD0fOOtN33UemEZcWduw0o /KrdqfKjlVwHJ3z+yquDJFSM8FPmKgJHj1KEyRAMIDqP3IIy2pNTFSSuv0NV+LYou7B3 6MYTR0E/oXFuzMFYtmvZ/KR1A+tyESJgTQVDddqGCvUj4PlNVpNBYYKOk7no9Wrj/LoN thGo9yhg9/iIkrANDDb7yGyMh5WjOlIgR7wQVyKEFYG+BR6u+XOWcnO6Tg4pa0yBZ64Q 1qkyyJC7i7FFqpbjClccwmQdxI/OS/dQZuaJTkxQNyuJpRR9c6YFyTzKkaemm2W7CGCJ 26aw== X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:from:date:message-id:subject:to:cc; bh=s0pR8gTUYgBdzPO4pxNaG+615Ivnt1QAT43zaZj3Z0I=; b=e/YoNSodLzGYPUOsW+HNs8TPr2ibxTqbsP5t1bOx8zY5b0I0Dv0n3wq8Ji11iMtJUB cBNeEeQY1iTlKRf/nlBjXrfQwXxe7WBTsk+g9AGU7XWA1Em2fk1qtdG/aeIjqlM397Dm +Y3aUfmlO+mcDEg5bJhWvl5qMx9uFuqnd345IacqBRLRAdhWMD6mio0+3l5/iYG1gRt6 0LMjIK/bwphuRiZ9YeaGhA/YzzGC8sGePwJDvybhVby8SjJbkg2juTg79gbZ7166h0Lk /llIRsxL0Z9m+8df5xruxuB9TgZ6ur8qgRg76Q857fqWZWauwT3ZdR46hACLj9XHsWej jIag== X-Gm-Message-State: AGi0PuZsO5HTeJi0fEjmccuO174NrLMc2K+r5vW0Vtew/vJnHliBOekE op7686nMv15TvBpCqR5PwZrwBm9Mtk/2tZYAlqWimIqOAaU= X-Google-Smtp-Source: APiQypIDQn3c7rh9VTcVJ5jHB8gGntihxGOxGyfoozaphN56PbpXDPK7VquABPvL4ssCtpeZTdnSsvJyi3flXLN6YOI= X-Received: by 2002:ac8:2623:: with SMTP id u32mr28131923qtu.388.1587063433309; Thu, 16 Apr 2020 11:57:13 -0700 (PDT) MIME-Version: 1.0 From: Andrei Popescu Date: Thu, 16 Apr 2020 19:57:02 +0100 Message-ID: To: caml-list@inria.fr Cc: Catalin Hritcu Content-Type: multipart/alternative; boundary="0000000000002db4ae05a36d0053" Subject: [Caml-list] Certified Programs and Proofs (CPP) 2021: First Call for Papers Reply-To: Andrei Popescu X-Loop: caml-list@inria.fr X-Sequence: 18101 Errors-to: caml-list-owner@inria.fr Precedence: list Precedence: bulk Sender: caml-list-request@inria.fr X-no-archive: yes List-Id: List-Archive: List-Help: List-Owner: List-Post: List-Subscribe: List-Unsubscribe: --0000000000002db4ae05a36d0053 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable 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 2021 (https://popl21.sigplan.org/home/CPP-2021) will be held on 18-19 January 2021 and will be co-located with POPL 2021. CPP 2021 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG. NEWS * Due to the COVID-19 situation, it is currently uncertain whether CPP 2021 will be a physical conference in Copenhagen, Denmark or a virtual one. * The submission deadline is one month earlier than usual. IMPORTANT DATES * Abstract Deadline: 16 September 2020 at 23:59 AoE (UTC-12h) * Paper Submission Deadline: 22 September 2020 at 23:59 AoE (UTC-12h) * Notification (tentative): 19 November 2020 * Camera Ready Deadline (tentative): 10 December 2020 * Conference: 18-19 January 2021 Deadlines expire at the end of the day, anywhere on earth. Abstract and submission deadlines are strict and there will be no extensions. 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://cpp2021.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{printfol= ios=3Dtrue,printccs=3Dfalse,printacmref=3Dfalse} 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 2021 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=E2=80=99 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-R= eviewing-FAQ We encourage the authors to provide any supplementary material that is required to support 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 2021 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 2021 proceedings will also be available via SIGPLAN OpenTOC (http://www.sigplan.org/OpenTOC/#cpp). For ACM=E2=80=99s 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 C=C4=83t=C4=83lin Hri=C5=A3cu, Inria Paris, France (co-chair) Andrei Popescu, Middlesex University London, UK (co-chair) Reynald Affeldt, National Institute of Advanced Industrial Science and Technology (AIST), Japan June Andronick, CSIRO's Data61 and UNSW, Australia Arthur Azevedo de Amorim, Carnegie Mellon University, USA Joachim Breitner, DFINITY Foundation, Germany Jesper Cockx, TU Delft, Netherlands Cyril Cohen, Universit=C3=A9 C=C3=B4te d=E2=80=99Azur, Inria, France Nils Anders Danielsson, University of Gothenburg / Chalmers University of Technology, Sweden Brijesh Dongol, University of Surrey, UK Floris van Doorn, University of Pittsburgh, USA Yannick Forster, Saarland University, Germany Shilpi Goel, Centaur Technology, Inc., USA Chung-Kil Hur, Seoul National University, South Korea Moa Johansson, Chalmers University of Technology, Sweden Ekaterina Komendantskaya, Heriot-Watt University, UK Angeliki Koutsoukou-Argyraki, University of Cambridge, UK Robert Y. Lewis, Vrije Universiteit Amsterdam, Netherlands Hongjin Liang, Nanjing University, China Andreas Lochbihler, Digital Asset GmbH, Switzerland Petar Maksimovi=C4=87, Imperial College London, UK William Mansky, University of Illinois at Chicago, USA Anders M=C3=B6rtberg, Stockholm University, Sweden Sam Owre, SRI International, USA Karl Palmskog, KTH Royal Institute of Technology, Sweden Johannes =C3=85man Pohjola, CSIRO's Data61 / University of New South Wales, Australia Damien Pous, CNRS, ENS Lyon, France Tahina Ramananandro, Microsoft Research, USA Ilya Sergey, Yale-NUS College and National University of Singapore, Singapore Natarajan Shankar, SRI International, USA Kathrin Stark, Princeton University, USA Ren=C3=A9 Thiemann, University of Innsbruck, Austria Amin Timany, Aarhus University, Denmark Josef Urban, Czech Technical University in Prague, Czech Republic Christoph Weidenbach, MPI-INF, Germany Freek Wiedijk, Radboud University Nijmegen, Netherlands Yannick Zakowski, University of Pennsylvania, USA CONTACT For any questions please contact the two PC chairs: C=C4=83t=C4=83lin Hri=C5=A3cu , Andrei Popescu --0000000000002db4ae05a36d0053 Content-Type: text/html; charset="UTF-8" Content-Transfer-Encoding: quoted-printable

Certified= Programs and Proofs (CPP) is an international conference on practical and = theoretical topics in all areas that consider formal verification and certi= fication as an essential paradigm for their work. CPP spans areas of comput= er science, mathematics, logic, and education.


CPP 2021 (https://popl21.sigpla= n.org/home/CPP-2021) will be held on 18-19 January 2021 and will be co-located with POPL 2= 021. CPP 2021 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG.<= /span>


NEWS<= /p>

* Due to the COVID-= 19 situation, it is currently uncertain whether CPP 2021 will be a physical= conference in Copenhagen, Denmark or a virtual one.

* The submission deadline is one mont= h earlier than usual.


IMPORTANT DATES


* Abstract Deadline: 16 September 2020 at 23:59 AoE (UTC-12h)=

* Paper Submiss= ion Deadline: 22 September 2020 at 23:59 AoE (UTC-12h)

* Notification (tentative): 19 Novem= ber 2020

* Camer= a Ready Deadline (tentative): 10 December 2020

* Conference: 18-19 January 2021

<= br>

Deadlines expire at the= end of the day, anywhere on earth. Abstract and submission deadlines are s= trict and there will be no extensions.


TOPICS OF INTEREST


We welcome submissions in research ar= eas related to formal certification of programs and proofs. The following i= s a non-exhaustive list of topics of interest to CPP:

* certified or certifying programming= , compilation, linking, OS kernels, runtime systems, security monitors, and= hardware;

* cer= tified mathematical libraries and mathematical theorems;

* proof assistants (e.g, ACL2, A= gda, Coq, Dafny, F*, HOL4, HOL Light, Idris, Isabelle, Lean, Mizar, Nuprl, = PVS, etc);

* new= languages and tools for certified programming;

* program analysis, program verification, a= nd program synthesis;

* program logics, type systems, and semantics for certified code;

* logics for certif= ying concurrent and distributed systems;

* mechanized metatheory, formalized programming la= nguage semantics, and logical frameworks;

* higher-order logics, dependent type theory, pro= of theory, logical systems, separation logics, and logics for security;

* verification of c= orrectness and security properties;

* formally verified blockchains and smart contracts;

* certificates for= decision procedures, including linear algebra, polynomial systems, SAT, SM= T, and unification in algebras of interest;

* certificates for semi-decision procedures, i= ncluding equality, first-order logic, and higher-order unification;<= /p>

* certificates for prog= ram termination;

* formal models of computation;

* mechanized (un)decidability and computational complexity= proofs;

* forma= lly certified methods for induction and coinduction;

* integration of interactive and auto= mated provers;

*= logical foundations of proof assistants;

* applications of AI and machine learning to form= al certification;

* user interfaces for proof assistants and theorem provers;

* teaching mathematics and co= mputer science with proof assistants.


SUBMISSION GUIDELINES


Prior to the paper submission deadlin= e, the authors should upload their anonymized paper in PDF format through t= he HotCRP system at


https://cpp2021.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 opt= ion, which provides a two-column style, using 10 point font for the main te= xt, and a header for double blind review submission, i.e.,


\documentclass[sigplan,10pt,= anonymous,review]{acmart}\settopmatter{printfolios=3Dtrue,printccs=3Dfalse,= printacmref=3Dfalse}


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 t= o the requirements concerning format and maximum length may be rejected wit= hout further consideration.


CPP 2021 will employ a lightweight double-blind reviewing p= rocess. To facilitate this, the submissions must adhere to two rules:

(1) author names and = institutions must be omitted, and

(2) references to authors=E2=80=99 own related work shoul= d be in the third person (e.g., not "We build on our previous work ...= " but rather "We build on the work of ...").


<= p dir=3D"ltr" style=3D"line-height:1.38;margin-top:0pt;margin-bottom:0pt"><= span style=3D"font-size:11pt;font-family:Arial;color:rgb(0,0,0);background-= color:transparent;font-variant-numeric:normal;font-variant-east-asian:norma= l;vertical-align:baseline;white-space:pre-wrap">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 anonymi= ty that weakens the submission or makes the job of reviewing it more diffic= ult. In particular, important background references should not be omitted o= r anonymized. In addition, authors are free to disseminate their ideas or d= raft versions of their papers as usual. For example, authors may post draft= s of their papers on the web or give talks on their research ideas. POPL ha= s answers to frequently asked questions addressing many common concerns: https://popl20.sigpla= n.org/track/POPL-2020-Research-Papers#Submission-and-Reviewing-FAQ


We encourage the= authors to provide any supplementary material that is required to support = the claims made in the paper, such as proof scripts or experimental data. T= his 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 mate= rial is made available to the reviewers before they submit their first-draf= t reviews.

(2) N= on-anonymous supplementary material is made available to the reviewers afte= r they have submitted their first-draft reviews and have learned the identi= ty of the authors.


Please use anonymous supplementary material whenever possible, so th= at it can be taken into account from the beginning of the reviewing process= .


The submit= ted 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/polici= es/plagiarism).= Concurrent submissions to other conferences, journals, workshops with proc= eedings, or similar forums of publication are not allowed. The PC chairs sh= ould be informed of closely related work submitted to a conference or journ= al in advance of submission. One author of each accepted paper is expected = to present it at the (possibly virtual) conference.


PUBLICATION, COPYRIGHT AND OPEN ACC= ESS


The CPP = 2021 proceedings will be published by the ACM, and authors of accepted pape= rs 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 ret= ains copyright of the work and grants ACM an exclusive permission-to-publis= h license.

(3) A= uthor transfers copyright of the work to ACM.


For authors who can afford it, we recomme= nd option (1), which will make the paper Gold Open Access, and also encoura= ge such authors to license their work under the CC-BY license. ACM will cha= rge you an article processing fee for this option (currently, US$700), whic= h you have to pay directly with the ACM.


For everyone else, we recommend option (2), wh= ich is free and allows you to achieve Green Open Access, by uploading a pre= print 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 import= ant for this edition, since, because of the very tight schedule, the offici= al proceedings might not be available in time for CPP.


The official CPP 2021 proceeding= s will also be available via SIGPLAN OpenTOC (http://www.sigplan.org/= OpenTOC/#cpp).<= /span>


For ACM=E2= =80=99s take on this, see their Copyright Policy (http://www.acm.org/publications/policies/copyright-policy) and Author Rights (http://aut= hors.acm.org/main.html).


PR= OGRAM COMMITTEE=C2=A0


C=C4=83t=C4=83lin Hri=C5=A3cu, Inria Paris, France (co-chair)

Andrei Popescu, Mid= dlesex University London, UK (co-chair)=C2=A0

Reynald Affeldt, National Institute of Advanc= ed Industrial Science and Technology (AIST), Japan

June Andronick, CSIRO's Data61 and U= NSW, Australia

A= rthur Azevedo de Amorim, Carnegie Mellon University, USA

Joachim Breitner, DFINITY Founda= tion, Germany

Je= sper Cockx, TU Delft, Netherlands

Cyril Cohen, Universit=C3=A9 C=C3=B4te d=E2=80=99Azur, In= ria, France

Nils= Anders Danielsson, University of Gothenburg / Chalmers University of Techn= ology, Sweden

Br= ijesh Dongol, University of Surrey, UK

Floris van Doorn, University of Pittsburgh, USA

Yannick Forster, Saa= rland University, Germany

Shilpi Goel, Centaur Technology, Inc., USA

Chung-Kil Hur, Seoul National Univers= ity, South Korea=C2=A0

Moa Johansson, Chalmers University of Technology, Sweden

<= p dir=3D"ltr" style=3D"line-height:1.38;margin-top:0pt;margin-bottom:0pt"><= span style=3D"font-size:11pt;font-family:Arial;color:rgb(0,0,0);background-= color:transparent;font-variant-numeric:normal;font-variant-east-asian:norma= l;vertical-align:baseline;white-space:pre-wrap">Ekaterina Komendantskaya, H= eriot-Watt University, UK

Angeliki Koutsoukou-Argyraki, University of Cambridge, UK<= /p>

Robert Y. Lewis, Vrije = Universiteit Amsterdam, Netherlands

Hongjin Liang, Nanjing University, China

Andreas Lochbihler, Digital As= set GmbH, Switzerland

Petar Maksimovi=C4=87, Imperial College London, UK

William Mansky, University of Il= linois at Chicago, USA

Anders M=C3=B6rtberg, Stockholm University, Sweden

Sam Owre, SRI International, USA=

Karl Palmskog, = KTH Royal Institute of Technology, Sweden

Johannes =C3=85man Pohjola, CSIRO's Data61 / = University of New South Wales, Australia

Damien Pous, CNRS, ENS Lyon, France

Tahina Ramananandro, Microsoft= Research, USA=C2=A0

Ilya Sergey, Yale-NUS College and National University of Singapore, Si= ngapore

Nataraja= n Shankar, SRI International, USA

Kathrin Stark, Princeton University, USA

Ren=C3=A9 Thiemann, University o= f Innsbruck, Austria

Amin Timany, Aarhus University, Denmark

Josef Urban, Czech Technical University in Pra= gue, Czech Republic

Christoph Weidenbach, MPI-INF, Germany

Freek Wiedijk, Radboud University Nijmegen, Ne= therlands

Yannic= k Zakowski, University of Pennsylvania, USA


CONTACT


For any questions please contact the two PC ch= airs:

C=C4=83t= =C4=83lin Hri=C5=A3cu <catalin.hritcu@gmail.com>,

Andrei Popescu <andrei.h.popescu@gmail.com>


--0000000000002db4ae05a36d0053--