*** Call for Participation and Lightning Talks ***
*** Certified Programs and Proofs (CPP 2021) ***
#### Executive Summary
* Conference dates: 17-19 January 2021 (extended to 3 days!)
* Lightning talks submission deadline: 8 January 2021 (AoE)
* Lightning talks session: 18 January 2021 at 20:00 CET
* Registration: https://popl21.sigplan.org/attending/Registration
- Early registration deadline: 10 January 2021 (!)
- Discounted registration available (see below)
* Long pre-recorded talks available by: 11 January 2021 (AoE)
#### General Information
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. CPP spans
areas of computer science, mathematics, logic, and education. CPP is
sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG. For more
information please visit https://popl21.sigplan.org/home/CPP-2021
CPP 2021 will be co-located with POPL 2021 and will take place on
17-19 January 2021, as a virtual meeting, where all papers are
presented online. For more information about virtual conference
organization have a look here:
https://popl21.sigplan.org/venue/POPL-2021-venue
CPP will also have both long and short versions of presentations,
just that for us the short versions are 10 minutes long (not 5).
#### Call for Lightning Talks
CPP 2021 will include a session of 5-minute talks where attendees can
present work-in-progress, preliminary research results, and emerging
topics. Submission of such lightning talks proposals is lightweight:
all we need is a title, an abstract, and the author names,
affiliations, and contact information.
- Lightning talks submission deadline: 8 January 2021 (AoE)
- Lightning talks session: 18 January 2021 at 20:00 CET
- Submission information coming up in the next couple of days at:
https://popl21.sigplan.org/home/CPP-2021#Call-for-Participation-and-Lightni…
#### Discounted Registration
We offer a $10 alternative registration fee for anyone for whom the
normal registration fees could be an impediment to participation.
#### Industrial Supporters
Warm thanks to our generous industrial supporters:
- Gold supporter: JetBrains
- Silver supporters: Algorand, IOHK, and Nomadic Labs
- Bronze supporters: Arm, BedRock Systems Inc, Digital Asset,
Galois, Informal Systems Inc, and Zilliqa
#### Invited Talks
- Tobias Nipkow (Technische Universität München):
Teaching Algorithms and Data Structures with a Proof Assistant
- Peter Sewell (University of Cambridge):
Underpinning the foundations: Sail-based semantics, testing,
and reasoning, for production and CHERI-enabled architectures
#### Accepted Papers, Program, and Distinguished Paper Awards
The list of papers accepted at CPP 2021 is available at
https://popl21.sigplan.org/home/CPP-2021#event-overview
A preliminary program is also available:
https://popl21.sigplan.org/home/CPP-2021#program
Starting with this edition we introduced the CPP Distinguished Paper
Awards, aimed at accepted submissions that stand out with respect to
originality, significance, and clarity. The three Distinguished Papers
selected for CPP 2021 are:
- A Minimalistic Verified Bootstrapped Compiler (Proof Pearl)
by Magnus O. Myreen
- Formalizing the Ring of Witt Vectors
by Johan Commelin and Robert Y. Lewis
- Machine-Checked Semantic Session Typing
by Jonas Kastberg Hinrichsen, Daniel Louwrink, Robbert Krebbers and
Jesper Bengtson
#### Contact
For any questions please contact the chairs:
Catalin Hritcu <catalin.hritcu(a)gmail.com>,
Andrei Popescu <a.popescu(a)sheffield.ac.uk>,
Lennart Beringer <eberinge(a)cs.princeton.edu>
(Apologies for multiple copies of this announcement. Please circulate.)
==================================================================
Updated information on: invited speakers, affiliated workshops
==================================================================
CALL FOR PAPERS
Sixth International Conference on
Formal Structures for Computation and Deduction (FSCD 2021)
July 17 - July 24, 2021, Buenos Aires, Argentina
https://fscd2021.dc.uba.ar/
In-cooperation with ACM SIGLOG and SIGPLAN
NOTE: Due to the Covid 19 pandemic situation, the 2021 edition of FSCD and its satellite workshops will be held online.
IMPORTANT DATES
---------------
All deadlines are midnight anywhere-on-earth (AoE); late submissions will not be considered.
Abstract: February 12, 2021
Submission: February 15, 2021
Rebuttal: April 2-5, 2021
Notification: April 19, 2021
Final version: May 3, 2021
INVITED SPEAKERS
----------------
- Zena M. Ariola, University of Oregon
https://ix.cs.uoregon.edu/~ariola/
- Nao Hirokawa, JAIST
https://www.jaist.ac.jp/~hirokawa/
- Elaine Pimentel, Federal University of Rio Grande do Norte
https://sites.google.com/site/elainepimentel/
- Sam Staton, University of Oxford
https://www.cs.ox.ac.uk/people/samuel.staton/main.html
AFFILIATED WORKSHOPS
--------------------
- HoTT/UF: 6th Workshop on Homotopy Type Theory/Univalent Foundations
- ITRS: 10th Workshop on Intersection Types and Related Systems
- WPTE: 7th International Workshop on Rewriting Techniques for Program Transformations and Evaluation
- UNIF: 35th International Workshop on Unification
- LSFA: 16th Logical and Semantics Frameworks with Applications
- IWC: 10th International Workshop on Confluence
- IFIP WG 1.6: 24th meeting of the IFIP Working Group 1.6: Rewriting
FSCD (http://fscd-conference.org/) covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logics, models of computation, semantics and verification in new challenging areas.
The suggested, but not exclusive, list of topics for submission is:
1. Calculi:
- Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.);
- Lambda calculus;
- Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.);
- Proof theory (natural deduction, sequent calculus, proof nets, etc.);
- Type theory and logical frameworks;
- Homotopy type theory;
- Quantum calculi.
2. Methods in Computation and Deduction:
- Type systems (polymorphism, dependent, recursive, intersection, session, etc.);
- Induction, coinduction;
- Matching, unification, completion, orderings;
- Strategies (normalization, completeness, etc.);
- Tree automata;
- Model building and model checking;
- Proof search and theorem proving;
- Constraint solving and decision procedures.
3. Semantics:
- Operational semantics and abstract machines;
- Game Semantics and applications;
- Domain theory and categorical models;
- Quantitative models (timing, probabilities, etc.);
- Quantum computation and emerging models in computation.
4. Algorithmic Analysis and Transformations of Formal Systems:
- Type Inference and type checking;
- Abstract Interpretation;
- Complexity analysis and implicit computational complexity;
- Checking termination, confluence, derivational complexity and related properties;
- Symbolic computation.
5. Tools and Applications:
- Programming and proof environments;
- Verification tools;
- Proof assistants and interactive theorem provers;
- Applications in industry;
- Applications of formal systems in other sciences.
6. Semantics and Verification in new challenging areas:
- Certification;
- Security;
- Blockchain protocols;
- Data Bases;
- Deep learning and machine learning algorithms;
- Planning.
PUBLICATION
-----------
The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl. All LIPIcs proceedings are open access.
SPECIAL ISSUE
-------------
Authors of selected papers will be invited to submit an extended version to a special issue of Logical Methods in Computer Science.
SUBMISSION GUIDELINES
---------------------
The submission site is:
https://easychair.org/conferences/?conf=fscd2021
Submissions can be made in two categories. Regular research papers are limited to 15 pages, excluding references and appendices. They must present original research which is unpublished and not submitted elsewhere. System descriptions are limited to 15 pages (including references) and must present new software tools in which FSCD topics play an important role, or significantly new versions of such tools. An archive of the code with instructions on how to install and run the tool must be submitted. In addition, a webpage where the system can be experimented with should be provided. Complete instructions on submitting a paper can be found on the conference web site:
https://fscd2021.dc.uba.ar/
One author of an accepted paper is expected to present it at the conference
BEST PAPER AWARD BY JUNIOR RESEARCHERS
--------------------------------------
The program committee will select a paper in which at least one author is a junior researcher, i.e. either a student or whose PhD award date is less than three years from the first day of the meeting. Other authors should declare to the PC Chair that at least 50% of contribution is made by the junior researcher(s).
PROGRAM COMMITTEE CHAIR
-----------------------
Naoki Kobayashi, The University of Tokyo
fscd2021(a)easychair.org
PROGRAM COMMITTEE
-----------------
M. Ayala-Rincón, Universidade de Brasília
S. Berardi, University of Torino
F. Blanqui, INRIA
E. Bonelli, Stevens Institute of Technology
É. Contejean, CNRS, Université Paris-Saclay
T. Coquand, University of Gothenburg
T. Ehrhard, Université de Paris, CNRS
S. Escobar, Univ. Politècnica de València
J. Espírito Santo, University of Minho
C. Faggian, Université de Paris, CNRS
A. Felty, University of Ottawa
S. Figueira, Universidad de Buenos Aires
M. Fiore, University of Cambridge
M. Gaboardi, Boston University
S. Ghilezan, University of Novi Sad
I. Hasuo, National Institute of Informatics
D. Kesner, Université de Paris
R. Krebbers, Radboud University Nijmegen
T. Kutsia, Johannes Kepler University Linz
B. König, University of Duisburg-Essen
M. Lenisa, University of Udine
N. Nishida, Nagoya University
L. Ong, University of Oxford
P. Parys, University of Warsaw
J. Rehof, TU Dortmund University
C. Rocha, Pontificia Univ. Javeriana Cali
A. Silva, University College London
N. Szasz, Universidad ORT Uruguay
A. Tiu, Australian National University
S. Winkler, University of Verona
H. Yang, KAIST, South Korea
CONFERENCE CHAIR
----------------
Alejandro Díaz-Caro, Quilmes Univ. & ICC/CONICET
WORKSHOP CHAIRS
--------------
Mauricio Ayala-Rincón, Universidade de Brasília
Carlos López Pombo, Universidad de Buenos Aires
STEERING COMMITTEE WORKSHOP CHAIR
--------------------------------
Jamie Vicary, Oxford University
PUBLICITY CHAIR
---------------
Carsten Fuhs, Birkbeck, University of London
FSCD STEERING COMMITTEE
-----------------------
Z. Ariola, University of Oregon
M. Ayala-Rincón, University of Brasilia
C. Fuhs, Birkbeck, University of London
H. Geuvers, Radboud University
S. Ghilezan, University of Novi Sad
S. Guerrini, University of Paris 13
D. Kesner (Chair), University of Paris Diderot H. Kirchner, Inria
C. Kop, Radboud University
D. Mazza, University of Paris 13
L. Ong, Oxford University
J. Rehof, TU Dortmund
J. Vicary, Oxford University
======================================================================
WST 2021 - Call for Papers
17th International Workshop on Termination
http://costa.fdi.ucm.es/wst2021
July 16, 2021, Pittsburgh, PA, United States
Co-located with CADE-28
======================================================================
The Workshop on Termination (WST) traditionally brings together, in an
informal setting, researchers interested in all aspects of
termination, whether this interest be practical or theoretical,
primary or derived. The workshop also provides a ground for
cross-fertilization of ideas from the different communities interested
in termination (e.g., working on computational mechanisms, programming
languages, software engineering, constraint solving, etc.). The
friendly atmosphere enables fruitful exchanges leading to joint
research and subsequent publications.
IMPORTANT DATES:
* submission deadline: April 18, 2021
* notification: May 23, 2021
* final version due: June 13, 2021
* workshop: July 16, 2021
TOPICS:
The 17th International Workshop on Termination welcomes contributions
on all aspects of termination. In particular, papers investigating
applications of termination (for example in complexity analysis,
program analysis and transformation, theorem proving, program
correctness, modeling computational systems, etc.) are very welcome.
Topics of interest include (but are not limited to):
* abstraction methods in termination analysis
* certification of termination and complexity proofs
* challenging termination problems
* comparison and classification of termination methods
* complexity analysis in any domain
* implementation of termination methods
* non-termination analysis and loop detection
* normalization and infinitary normalization
* operational termination of logic-based systems
* ordinal notation and subrecursive hierarchies
* SAT, SMT, and constraint solving for (non-)termination analysis
* scalability and modularity of termination methods
* termination analysis in any domain (lambda calculus, declarative
programming, rewriting, transition systems, etc.)
* well-founded relations and well-quasi-orders
SUBMISSION GUIDELINES:
Submissions are short papers/extended abstracts which should not
exceed 5 pages. There will be no formal reviewing. In particular, we
welcome short versions of recently published articles and papers
submitted elsewhere. The program committee checks relevance and
provides additional feedback for each submission. The accepted papers
will be made available electronically before the workshop.
Papers should be submitted electronically via the submission page:
https://easychair.org/conferences/?conf=wst2021
Please, use LaTeX and the LIPIcs style file
http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz
to prepare your submission.
PROGRAM COMMITTEE:
* Martin Avanzini - INRIA Sophia, Antipolis
* Carsten Fuhs - Birkbeck, U. of London
* Samir Genaim (chair) - U. Complutense de Madrid
* Jürgen Giesl - RWTH Aachen
* Matthias Heizmann - U. of Freiburg
* Cynthia Kop - Radboud U. Nijmegen
* Salvador Lucas - U. Politècnica de València
* Étienne Payet - U. de La Réunion
* Albert Rubio - U. Complutense de Madrid
* René Thiemann - U. of Innsbruck
* Johannes Waldmann - HTWK Leipzig
