[PlanetKR] Last CFP - CPP 2026 - Certified Programs and Proofs

nicolas tabareau nicolas.tabareau at inria.fr
Fri Aug 29 08:10:23 UTC 2025


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 2026 (https://popl26.sigplan.org/home/CPP-2026) will be held on 12-13 January 2026 and will be co-located with POPL 2026 in Rennes, France. CPP 2026 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG.

CPP 2026 will welcome contributions from all members of the community. The CPP 2026 organizers will strive to enable both in-person and remote participation, in cooperation with the POPL 2026 organizers.

NEWS: CPP IS NOW 100% GOLD OPEN ACCESS <https://popl26.sigplan.org/home/CPP-2026#news-cpp-is-now-100-gold-open-access>
Starting in 2026 all articles published at CPP will be Gold Open Access. Authors should check the Open Access section below for more details on what to expect.

IMPORTANT DATES <https://popl26.sigplan.org/home/CPP-2026#important-dates>
Abstract Submission Deadline: 5 September 2025
Paper Submission Deadline: 12 September 2025
Notification (tentative): 13 November 2025
Camera Ready Deadline (tentative): 1 December 2025
Conference: 12-13 January 2026
Deadlines expire at the end of the day, anywhere on earth. Abstract and submission deadlines are strict and there will be no extensions.

AUTHORS TAKE NOTE: <https://popl26.sigplan.org/home/CPP-2026#authors-take-note>
The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work.

DISTINGUISHED PAPER AWARDS <https://popl26.sigplan.org/home/CPP-2026#distinguished-paper-awards>
Around 10% of the accepted papers at CPP 2026 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 <https://popl26.sigplan.org/home/CPP-2026#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, Dafny, F*, HOL4, HOL Light, Idris, Isabelle, Lean, Mizar, Nuprl, PVS, Rocq, 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;
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 verification;
user interfaces for proof assistants and theorem provers;
teaching mathematics and computer science with proof assistants.
Submissions will be reviewed based on the following criteria:

Thoroughly discuss the theory or design choices underpinning the formalization.
Provide a detailed explanation of the formalization decisions, including alternative approaches (e.g., in other proof assistants) and reasons for rejecting them.
Examine related literature on formalization choices and techniques.
Compare the design choices to those made in other libraries.
Offer feedback on the features of the computer proof assistant used, noting any that are missing.
Draw conclusions that can guide future formalization efforts in the same or other proof assistants.


OPEN ACCESS <https://popl26.sigplan.org/home/CPP-2026#open-access>
Important update on ACMs new open access publishing model for 2026 ACM Conferences

Starting January 1, 2026, ACM will fully transition to Open Access. All ACM publications, including those from ACM-sponsored conferences, will be 100% Open Access. Authors will have two primary options for publishing Open Access articles with ACM: the ACM Open institutional model or by paying Article Processing Charges (APCs). With over 1,800 institutions already part of ACM Open, the majority of ACM-sponsored conference papers will not require APCs from authors or conferences (currently, around 70-75%).

Authors from institutions not participating in ACM Open will need to pay an APC to publish their papers, unless they qualify for a geographic or discretionary waiver. To find out whether an APC applies to your article, please consult the list of participating institutions in ACM Open and review the APC Waivers and Discounts Policy.

To support a smooth transition and encourage broader ACM Open participation, ACM has introduced a temporary subsidy on APC pricing for 2026, funded directly by ACM. This pricing applies to all articles published in ACM and SIG sponsored conferences taking place in 2026. The subsidized conference pricing for 2026 is as follows:

Authors	No ACM or SIG members	At least 1 ACM or SIG member
ACM and SIG Sponsored Conference Article	$350	$250
From a lower-middle-income country	$175	$125
This represents a 65% discount, funded directly by ACM. Authors are encouraged to help advocate for their institutions to join ACM Open during this transition period.

If any of the authors is affiliated with an institution participating in ACM OPEN (https://libraries.acm.org/acmopen/open-participants), we recommend selecting that author as a “corresponding author”, so that you don’t have to pay an article processing charge (APC). The choice of “corresponding author” (in HotCRP and when submitting the camera-ready version) only impacts whether or not you have to pay an APC, and does not appear on your paper or in the Digital Library. Please use the institutional email address for the “corresponding author” to make it easier for ACM OPEN to kick in automatically.

For timely dissemination of CPP papers we also recommend uploading a preprint online (e.g., on arXiv) and linking it from the paper’s page on the CPP website, since the publishing schedule is very tight for CPP and we cannot guarantee that the proceedings will be ready on time for the conference. The official CPP proceedings from previous years are also available via SIGPLAN OpenTOC (http://www.sigplan.org/OpenTOC/#cpp).

Note, the authors retain copyright and license the work under a Creative Commons license (we recommend CC-BY).

ORGANIZERS <https://popl26.sigplan.org/home/CPP-2026#organizers>
Kathrin Stark, Heriot-Watt University (conference co-chair)
Yannick Zakowski, ENS Lyon (conference co-chair)
Nikhil Swamy, Microsoft Research (PC co-chair)
Nicolas Tabareau, Inria (PC co-chair)
CONTACT <https://popl26.sigplan.org/home/CPP-2026#contact>
For any questions please contact the two PC chairs:

Nikhil Swamy nswamy at microsoft.com <mailto:nswamy at microsoft.com>
Nicolas Tabareau nicolas.tabareau at inria.fr <mailto:nicolas.tabareau at inria.fr>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://kr.org/pipermail/planetkr/attachments/20250829/1a5c1cc7/attachment-0001.htm>


More information about the PlanetKR mailing list