CPP 2017 - POPL 2017 (original) (raw)

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 2017 is co-located with POPL 2017, in Paris, France. Registration and accommodation information will mostly be available on that site.

The program is currently displayed in (GMT+01:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna.

Use conference time zone: (GMT+01:00) Amsterdam, Berlin, Bern, Rome, Stockholm, ViennaSelect other time zone

The GMT offsets shown reflect the offsets at the moment of the conference.

By setting a time band, the program will dim events that are outside this time window. This is useful for (virtual) conferences with a continuous program (with repeated sessions).
The time band will also limit the events that are included in the personal iCalendar subscription service.

Display full programSpecify a time band

-

You're viewing the program in a time zone which is different from your device's time zone change time zone

10:30 - 12:00 Verified programming toolsCPP at Auditorium
10:3030mTalk **Verified compilation of CakeML to multiple machine-code targets**CPP Anthony Fox University of Cambridge, UK, Magnus O. Myreen Chalmers University of Technology, Sweden, Yong Kiam Tan IHPC at A*STAR, Singapore, Ramana Kumar
11:0030mTalk **COMPLX: a verification framework for concurrent imperative programs**CPP Sidney Amani UNSW, Australia, June Andronick Data61,CSIRO (formerly NICTA) and UNSW, Maksym Bortin , Corey Lewis , Christine Rizkallah University of Pennsylvania, USA, Joseph Tuong
11:3030mTalk **Verifying dynamic race detection**CPP William Mansky University of Pennsylvania, Yuanfeng Peng University of Pennsylvania, Steve Zdancewic University of Pennsylvania, Joseph Devietti University of Pennsylvania
14:00 - 15:30 Homotopy type theoryCPP at Auditorium
14:0030mTalk **The HoTT library: a formalization of homotopy type theory in Coq**CPP Andrej Bauer University of Ljubljana, Jason Gross MIT CSAIL, Peter Lefanu Lumsdaine , Michael Shulman , Matthieu Sozeau Inria, Bas Spitters Pre-print
14:3030mTalk **Lifting proof-relevant unification to higher dimensions**CPP Jesper Cockx iMinds, Belgium, Dominique Devriese iMinds - Distrinet, KU Leuven
15:0030mTalk **The Next 700 Syntactical models of type theory**CPP Simon Boulier , Pierre-Marie Pédrot , Nicolas Tabareau Inria, France

Accepted Papers

Title
A Coq Formal Proof of the Lax–Milgram theoremCPP Sylvie Boldo, François Clément, Florian Faissole, Vincent Martin, Micaela Mayero
A Formalization of the Berlekamp-Zassenhaus Factorization AlgorithmCPP Jose Divasón, Sebastiaan Joosten, René Thiemann, Akihisa Yamada
A Reflexive Tactic for Polynomial Positivity using Numerical Solvers and Floating-Point ComputationsCPP Erik Martin-Dorel, Pierre Roux
Automatic Cyclic Termination Proofs for Recursive Procedures in Separation LogicCPP Reuben Rowe, James Brotherston
BliStrTune: Hierarchical Invention of Theorem Proving StrategiesCPP Jan Jakubuv, Josef Urban
COMPLX: a verification framework for concurrent imperative programsCPP Sidney Amani, June Andronick, Maksym Bortin, Corey Lewis, Christine Rizkallah, Joseph Tuong
Equivalence of System F and λ2 in Coq based on context morphism lemmasCPP Jonas Kaiser, Tobias Tebbi, Gert Smolka
Formal foundations of 3D geometry for modeling robot manipulatorsCPP Reynald Affeldt, Cyril Cohen
Formalising Real Numbers in Homotopy Type TheoryCPP Gaetan Gilbert
Formalization of Karp-Miller Tree Construction on Petri NetsCPP Mitsuharu Yamamoto, Shogo Sekine, Saki Matsumoto
Formally verified differential dynamic logicCPP Brandon Bohrer, Vincent Rahli, Ivana Vukotic, Marcus Voelp, André Platzer
Lifting proof-relevant unification to higher dimensionsCPP Jesper Cockx, Dominique Devriese
Markov Processes in Isabelle/HOLCPP Johannes Hölzl DOI Pre-print File Attached
The HoTT library: a formalization of homotopy type theory in CoqCPP Andrej Bauer, Jason Gross, Peter Lefanu Lumsdaine, Michael Shulman, Matthieu Sozeau, Bas Spitters Pre-print
The Next 700 Syntactical models of type theoryCPP Simon Boulier, Pierre-Marie Pédrot, Nicolas Tabareau
Type-and-scope safe programs and their proofsCPP Guillaume Allais, James Chapman, Conor McBride, James McKinna
Verified compilation of CakeML to multiple machine-code targetsCPP Anthony Fox, Magnus O. Myreen, Yong Kiam Tan, Ramana Kumar
Verifying a hash table and its iterators in higher-order separation logicCPP François Pottier
Verifying dynamic race detectionCPP William Mansky, Yuanfeng Peng, Steve Zdancewic, Joseph Devietti

Call for Papers

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.

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.

Submission guidelines

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

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

Submitted papers must be formatted following the ACM SIGPLAN Proceedings format using 10 point font for the main text (not the default 9pt font).

Papers should should not exceed 12 pages including all tables, figures, and bibliography. Shorter papers are very welcome and will be given equal consideration.

Abstracts must be submitted by October 5, 2016 (AOE). The deadline for full papers is October 12, 2016 (AOE), and authors have the option to withdraw their papers during the window between the two.

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.

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.

Important dates

Abstract submission October 5, 2016
Full paper submission October. 2016
Notification November 16, 2016
Conference dates January 16–17, 2016

Program committee