Write a Blog >>
POPL 2019
Sun 13 - Sat 19 January 2019 Cascais/Lisbon, Portugal

Certified Programs and Proofs (CPP) is an international forum on theoretical and practical topics in all areas, including computer science, mathematics, and education, that consider certification as an essential paradigm for their work. Certification here means formal, mechanized verification of some sort, preferably with production of independently checkable certificates.

Follow this link for more information about the CPP series.

CPP 2019 is co-located with POPL 2019, in Cascais/Lisbon, Portugal. Registration and accommodation information will mostly be available on that site. CPP 2018 will be held on 14-15 January, 2019.

CPP’19 is sponsored by ACM SIGPLAN, and in cooperation with ACM SIGLOG.

We are delighted to announce that:

  • Jasmin Blanchette (Vrije Universiteit Amsterdam, The Netherlands)
  • Amy Felty (University of Ottawa, Canada)

will be invited speakers at CPP’19.

Mon 14 Jan

CPP-2019
09:00 - 10:30: CPP 2019 - Keynote 1 and Research Paper at CPP
CPP-201909:00 - 10:00
Talk
Amy FeltyUniversity of Ottawa
CPP-201910:00 - 10:30
Research paper
Yannick ForsterSaarland University, Dominique Larchey-WendlingCNRS, LORIA
CPP-2019
11:00 - 12:30: CPP 2019 - Research Papers: Proof Theory, Theory of Programming Languages at CPP
CPP-201911:00 - 11:30
Research paper
Kaustuv ChaudhuriInria, France, Matteo ManighettiInria & École Polytechnique, Dale MilerINRIA Saclay and LIX
CPP-201911:30 - 12:00
Research paper
Yannick ForsterSaarland University, Steven Schäfer, Simon Spies, Kathrin StarkSaarland University, Germany
CPP-201912:00 - 12:30
Research paper
Theo WinterhalterGallinette / Inria / LS2N, Nicolas TabareauInria, Matthieu SozeauInria
CPP-2019
14:00 - 15:30: CPP 2019 - Research Papers: Program Verification at CPP
CPP-201914:00 - 14:30
Research paper
Ian RoessleVirginia Tech, USA, Freek VerbeekOpen University of the Netherlands, The Netherlands, Binoy RavindranVirginia Tech
CPP-201914:30 - 15:00
Research paper
Sandrine BlazyUniv Rennes- IRISA, Rémi Hutin
CPP-201915:00 - 15:30
Research paper
Nicolas Koh, Yao LiUniversity of Pennsylvania, Yishuai LiUniversity of Pennsylvania, Li-yao Xia, Lennart BeringerPrinceton University, Wolf Honore, William ManskyUniversity of Illinois at Chicago, Benjamin C. PierceUniversity of Pennsylvania, Steve ZdancewicUniversity of Pennsylvania
CPP-2019
16:00 - 17:30: CPP 2019 - Research Papers: Formalization of Mathematics and Computer Algebra at CPP
CPP-201916:00 - 16:30
Research paper
Robert Y. LewisVrije Universiteit Amsterdam
CPP-201916:30 - 17:00
Research paper
Wenda LiUniversity of Cambridge, Lawrence PaulsonUniversity of Cambridge
CPP-201917:00 - 17:30
Research paper

Tue 15 Jan

CPP-2019
09:00 - 10:30: CPP 2019 - Keynote 2 and Research Paper at CPP
CPP-201909:00 - 10:00
Talk
Jasmin Christian BlanchetteVrije Universiteit Amsterdam
CPP-201910:00 - 10:30
Research paper
Anders SchlichtkrullTechnical University of Denmark, Jasmin Christian BlanchetteVrije Universiteit Amsterdam, Dmitriy TraytelETH Zurich
CPP-2019
11:00 - 12:30: CPP 2019 - Research Papers: Rewriting, Automated Reasoning at CPP
CPP-201911:00 - 11:30
Research paper
Kathrin StarkSaarland University, Germany, Steven Schäfer, Jonas Kaiser
CPP-201911:30 - 12:00
Research paper
Alexander Lochmann, Christian SternagelUniversity of Innsbruck, Austria
CPP-201912:00 - 12:30
Research paper
CPP-2019
14:00 - 15:30: CPP 2019 - Research Papers: Program Verification at CPP
CPP-201914:00 - 14:30
Research paper
Qianchuan YePurdue University, Benjamin DelawarePurdue University
CPP-201914:30 - 15:00
Research paper
Véronique BenzakenLRI, Université Paris-Sud, Evelyne Contejean
CPP-201915:00 - 15:30
Research paper
Susannah Mansky, Elsa GunterUniversity of Illinois
CPP-2019
16:00 - 17:30: CPP 2019 - Research Papers: Formalization of Mathematics and Computer Algebra at CPP
CPP-201916:00 - 16:30
Research paper
Yannick ForsterSaarland University, Dominik KirstSaarland University, Gert SmolkaSaarland University
CPP-201916:30 - 17:00
Research paper
Manuel EberlTechnische Universität München
CPP-201917:00 - 17:30
Meeting
Assia MahboubiINRIA, Magnus O. MyreenChalmers University of Technology, Sweden

Call for Papers

Certified Programs and Proofs (CPP) is an international forum on theoretical and practical topics in all areas, including computer science, mathematics, and education, that consider certification as an essential paradigm for their work. Certification here means formal, mechanized verification of some sort, preferably with production of independently checkable certificates.

Important Dates (AoE, UTC-12h)

  • Abstract Deadline: 11 October 2018
  • Paper Submission Deadline: 18 October 2018
  • Author Notification: 22 November 2018

Topics of interest:

We welcome submissions in research areas related to formal certification of programs and proofs. The following is a suggested list of topics of interests to CPP. This is a non-exhaustive list and should be read as a guideline rather than a requirement.

  • certified or certifying programming, compilation, linking, OS kernels, runtime systems, and security monitors;
  • program logics, type systems, and semantics for certified code;
  • certified decision procedures, mathematical libraries, and mathematical theorems;
  • proof assistants and proof theory;
  • new languages and tools for certified programming;
  • program analysis, program verification, and proof-carrying code;
  • certified secure protocols and transactions;
  • 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;
  • logics for certifying concurrent and distributed programs;
  • higher-order logics, logical systems, separation logics, and logics for security;
  • teaching mathematics and computer science with proof assistants.

Submission Guidelines

Papers should be submitted in PDF format through the EasyChair submission page at

https://easychair.org/conferences/?conf=cpp2019

Submitted papers must be formatted following the ACM SIGPLAN Proceedings format using the acmart format with the sigplan option, using 10 point font for the main text, and a header for single blind review submission, e.g.,

\documentclass[sigplan,10pt,review]{acmart}\settopmatter{printfolios=true,printccs=false,printacmref=false}

Submitted papers should not exceed 12 pages, including tables and figures, but excluding bibliography. Shorter papers are welcome and will be given equal consideration.

Submissions must be written in English and provide sufficient detail to allow the program committee to assess the merits of the paper. They should begin with a succinct statement of the issues, a summary of the main results, and a brief explanation of their significance and relevance to the conference, all phrased for the non-specialist. Technical and formal developments directed to the specialist should follow. References and comparisons with related work should be included. Papers not conforming to the above requirements concerning format and length may be rejected without further consideration.

Whenever appropriate, the submission should come along with a formal development, using whatever prover, e.g., Agda, Coq, Dafny, Elf, HOL, HOL-Light, Isabelle, Lean, Matita, Mizar, NQTHM, PVS, Vampire, etc. Such formal developments must be submitted together with the paper as auxiliary material, and will be taken into account during the reviewing process. Please do so by including a link to your files in the text of your paper, or by sending a zip or tar file to the PC chairs at cpp2019@easychair.org with your paper number included in the subject of your email.

The results must be unpublished and not submitted for publication elsewhere, including the proceedings of other published conferences or workshops. The PC chairs should be informed of closely related work submitted to a conference or journal in advance of submission. Original formal proofs of known results in mathematics or computer science are welcome. One author of each accepted paper is expected to present it at the conference.

For any questions about the formatting or submission of papers, please consult the PC chairs (cpp2019@easychair.org).

Accepted Papers

Title

Previous CPP conferences

  • CPP 2018, Los Angeles, USA, January 7-13, 2018 (co-located with POPL’18)
  • CPP 2017, Paris, France, January 16-17, 2017 (co-located with POPL’17)
  • CPP 2016, Saint Petersburg, Florida, USA, January 18-19, 2016 (co-located with POPL’16)
  • CPP 2015, Mumbai, India, January 13-14, 2015 (co-located with POPL’15)
  • CPP 2013, Melbourne, Australia, December 11-13, 2013 (co-located with APLAS’13)
  • CPP 2012, Kyoto, Japan, December 13-15, 2012 (collocation with APLAS’12)
  • CPP 2011, Kenting, Taiwan, December 7-9, 2011 (co-located with APLAS’11)

The CPP Manifesto (from 2011)

In this manifesto, we advocate for the creation of a new international conference in the area of formal methods and programming languages, called Certified Programs and Proofs (CPP). Certification here means formal, mechanized verification of some sort, preferably with the production of independently checkable certificates. CPP would target any research promoting formal development of certified software and proofs, that is:

  • The development of certified or certifying programs
  • The development of certified mathematical theories
  • The development of new languages and tools for certified programming
  • New program logics, type systems, and semantics for certified code
  • New automated or interactive tools and provers for certification
  • Results assessed by an original open source formal development
  • Original teaching material based on a proof assistant

Software today is still developed without precise specification. A developer often starts the programming task with a rather informal specification. After careful engineering, the developer delivers a program that may not fully satisfy the specification. Extensive testing and debugging may shrink the gap between the two, but there is no assurance that the program accurately follows the specification. Such inaccuracy may not always be significant, but when a developer links a large number of such modules together, these “noises” may multiply, leading to a system that nobody can understand and manage. System software built this way often contains hard-to-find “zero-day vulnerabilities” that become easy targets for Stuxnet-like attacks. CPP aims to promote the development of new languages and tools for building certified programs and for making programming precise.

Certified software consists of an executable program plus a formal proof that the software is free of bugs with respect to a particular dependability claim. With certified software, the dependability of a software system is measured by the actual formal claim that it is able to certify. Because the claim comes with a mechanized proof, the dependability can be checked independently and automatically in an extremely reliable way. The formal dependability claim can range from making almost no guarantee, to simple type safety property, or all the way to deep liveness, security, and correctness properties. It provides a great metric for comparing different techniques and making steady progress in constructing dependable software.

The conventional wisdom is that certified software will never be practical because any real software must also rely on the underlying runtime system which is too low-level and complex to be verifiable. In recent years, however, there have been many advances in the theory and engineering of mechanized proof systems applied to verification of low-level code, including proof-carrying code, certified assembly programming, local reasoning and separation logic, certified linking of heterogeneous components, certified protocols, certified garbage collectors, certified or certifying compilation, and certified OS-kernels. CPP intends to be a driving force that would facilitate the rapid development of this exciting new area, and be a natural international forum for such work.

The recent development in several areas of modern mathematics requires mathematical proofs containing enormous computation that cannot be verified by mathematicians in an entire lifetime. Such development has puzzled the mathematical community and prompted some of our colleagues in mathematics and computer science to start developing a new paradigm, formal mathematics, which requires proofs to be verified by a reliable theorem prover. As particular examples, such an effort has been made for the four-color theorem and has started for the sphere packing problem and the classification of finite groups. We believe that this emerging paradigm is the beginning of a new era. No essential existing theorem in computer science has yet been considered worth a similar effort, but it could well happen in the very near future. For example, existing results in security would often benefit from a formal development allowing us to exhibit the essential hypotheses under which the result really holds. CPP would again be a natural international forum for this kind of work, either in mathematics or in computer science, and would participate strongly in the emergence of this paradigm.

On the other hand, there is a recent trend in computer science to formally prove new results in highly technical subjects such as computational logic, at least in part. In whichever scientific area, formal proofs have three major advantages: no assumption can be missing, as is sometimes the case; the result cannot be disputed by a wrong counterexample, as sometimes happens; and more importantly, a formal development often results in a better understanding of the proof or program, and hence results in easier and better implementation. This new trend is becoming strong in computer science work, but is not recognized yet as it should be by traditional conferences. CPP would be a natural forum promoting this trend.

There are not many proof assistants around. There should be more, because progress benefits from competition. On the other hand, there is much theoretical work that could be implemented in the form of a proof assistant, but this does not really happen. One reason is that it is hard to publish a development work, especially when this requires a long-term effort as is the case for a proof assistant. It is even harder to publish work about libraries which, we all know, are fundamental for the success of a proof assistant. CPP would pay particular attention in publishing, publicizing, and promoting this kind of work.

Finally, CPP also aims to be a publication arena for innovative teaching experiences, in computer science or mathematics, using proof assistants in an essential way. These experiences could be submitted in an innovative format to be defined.

  • Alexander Lochmann and Christian Sternagel. Certified ACKBO
  • Anders Schlichtkrull, Jasmin Christian Blanchette and Dmitriy Traytel. A Verified Prover Based on Ordered Resolution
  • Bertram Felgenhauer, Aart Middeldorp, Prathamesh Turaga and Franziska Rapp. A Verified Ground Confluence Tool for Linear Variable-Separated Rewrite Systems in Isabelle/HOL
  • Fabian Immler and Bohua Zhan. Smooth Manifolds and Types to Sets for Linear Algebra in Isabelle/HOL
  • Ian Roessle, Freek Verbeek and Binoy Ravindran. Formally Verified Big Step Semantics out of x86-64 Binaries
  • Kathrin Stark, Steven Schäfer and Jonas Kaiser. Autosubst 2: Reasoning with Multi-Sorted de Bruijn Terms and Vector Substitutions
  • Kaustuv Chaudhuri, Matteo Manighetti and Dale Miller. A proof-theoretic approach to certifying skolemization
  • Manuel Eberl. Verified Solving and Asymptotics of Linear Recurrences
  • Nicolas Koh, Yao Li, Yishuai Li, Li-Yao Xia, Lennart Beringer, Wolf Honore, William Mansky, Benjamin C. Pierce and Steve Zdancewic. From C to Interaction Trees: Specifying, Verifying, and Testing a Networked Server
  • Qianchuan Ye and Benjamin Delaware. A Verified Protocol Buffer Compiler
  • Robert Lewis. A formal proof of Hensel’s lemma over the p-adic integers
  • Sandrine Blazy and Rémi Hutin. Formal Verification of a Program Obfuscation Based on Mixed Boolean-Arithmetic Expressions
  • Susannah Mansky and Elsa Gunter. Dynamic Class Initialization Semantics: a Jinja Extension
  • Théo Winterhalter, Nicolas Tabareau and Matthieu Sozeau. Eliminating Reflection from Type Theory
  • Véronique Benzaken and Evelyne Contejean. A Coq mechanised formal semantics for realistic SQL queries - Formally reconciling SQL and bag relational algebra
  • Wenda Li and Lawrence Paulson. Counting Polynomial Roots in Isabelle/HOL: A formal Proof of the Budan-Fourier Theorem
  • Yannick Forster and Dominique Larchey-Wendling. Certified Undecidability of Intuitionistic Linear Logic via Binary Stack Machines and Minsky Machines
  • Yannick Forster, Dominik Kirst and Gert Smolka. On Synthetic Undecidability in Coq, with an Application to the Entscheidungsproblem
  • Yannick Forster, Steven Schäfer, Simon Spies and Kathrin Stark. Call-By-Push-Value in Coq: Operational, Equational, and Denotational Theory