Certified Programs and Proofs

CPP 2020


Physics & Mathematics (General)



**1st CFP for Certified Programs and Proofs (CPP 2020)**
Certified Programs and Proofs (CPP) is an international conference on
practical and theoretical topics in all areas that consider
certification as an essential paradigm for their work. Certification
here means formal, mechanized verification of some sort, preferably
with the production of independently checkable certificates.
CPP spans areas of computer science, mathematics, logics, and education.
CPP 2020 will be held on 20-21 January 2020 in New Orleans, Louisiana,
United States and will be co-located with POPL 2020. CPP 2020 is
sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG.
For more information about this edition and the CPP series please visit:
https://popl20.sigplan.org/home/CPP-2020
### Important Dates
- Abstract Deadline: 16 October 2019 at 23:59 AoE (UTC-12h)
- Paper Submission Deadline: 21 October 2019 at 23:59 AoE (UTC-12h)
- Conference: 20 - 21 January 2020
### 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 interests to CPP:
- certified or certifying programming, compilation, linking, OS
kernels, runtime systems, and security monitors;
- certified mathematical libraries and mathematical theorems;
- proof assistants (e.g, ACL2, Agda, Coq, Dafny, F*, HOL,
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;
- user interfaces for proof assistants and theorem provers
- teaching mathematics and computer science with proof assistants.
### Program Committee Members
- Jasmin Christian Blanchette (VU Amsterdam, Netherlands -- co-chair)
- Catalin Hritcu (Inria Paris, France -- co-chair)
- Nada Amin (Harvard University - USA)
- Jesús María Aransay Azofra (Universidad de La Rioja - Spain)
- Mauricio Ayala-Rincon (Universidade de Brasilia - Brazil)
- Liron Cohen (Cornell University - USA)
- Dominique Devriese (Vrije Universiteit Brussel - Belgium)
- Jean-Christophe Filliâtre (CNRS - France)
- Adam Grabowski (University of Bialystok - Poland)
- Warren Hunt (University of Texas - USA)
- Ori Lahav (Tel Aviv University - Israel)
- Peter Lammich (The University of Manchester - UK)
- Dominique Larchey-Wendling (Univ. de Lorraine, CNRS, LORIA - France)
- Hongjin Liang (Nanjing University - China)
- Assia Mahboubi (Inria and VU Amsterdam - France)
- Cesar Munoz (NASA - USA)
- Vivek Nigam (fortiss GmbH - Germany)
- Benjamin Pierce (University of Pennsylvania - USA)
- Vincent Rahli (University of Luxembourg, SnT - Luxembourg)
- Christine Rizkallah (UNSW Sydney - Australia)
- Ilya Sergey (Yale-NUS College and National University of Singapore)
- Kathrin Stark (Saarland University - Germany)
- Nikhil Swamy (Microsoft Research - USA)
- Nicolas Tabareau (Inria - France)
- Dmitriy Traytel (ETH Zürich - Switzerland)
- Floris van Doorn (University of Pittsburgh - USA)
- Akihisa Yamada (National Institute of Informatics - Japan)
- Roberto Zunino (University of Trento - Italy)
### Submission Guidelines
Submission guidelines will be made available in due course.
### Contact
For any questions please contact the two PC chairs:
Jasmin Christian Blanchette (j.c.blanchette@vu.nl),
Catalin Hritcu (catalin.hritcu@gmail.com)