CALL FOR PAPERS
27th INTERNATIONAL CONFERENCE ON DATABASE THEORY (ICDT 2024)
Paestum, Italy 25th-28th March 2024
For more info check https://dastlab.github.io/edbticdt2024/
*About ICDT*
ICDT is a series of international scientific conferences on research of
data management theory
(https://databasetheory.org/icdt-pages). Since 2009, it is annually
and jointly held with EDBT (Extending DB Technology). The 27th edition
of ICDT, in 2024, will take place in Paestum, Italy.
Topics of Interest
We welcome research papers on *every* topic related to the principles
and theory of data management, provided that there is a clear connection
to foundational aspects. This includes, for example, articles on
"classical" data management topics such as:
The design and study of data models and query languages
The development and analysis of algorithms for data management
The theoretical investigation of various aspects underlying data
management systems (indexes, concurrency, distributed computation,
privacy and security, ...)
but also includes papers exploring existing or identifying new
connections between data management and other areas, such as the areas of:
knowledge representation, semantic web
information retrieval and data mining
machine learning/AI
distributed computing
theoretical computer science.
In all of the above, a clear emphasis on foundational aspects is
expected. You may want to check https://dblp.org/db/conf/icdt/index.html
to get an overview of previous editions of ICDT. The Program Committee
reserves the right to desk reject a submission when it is regarded to be
out of scope.
*Important dates*
ICDT will have two submission cycles for 2024, with deadlines as follows:
ICDT Submission Cycle 1 =======================
Abstract deadline: March 20, 2023
Full Submission due: March 27, 2023
Notification: June 5, 2023
ICDT Submission Cycle 2
=======================
Abstract deadline: September 13, 2023
Full Submission due : September 20, 2023
Notification: November 29, 2023
* Program Committee *
Program Committee Chair:
Graham Cormode (University of Warwick)
Program Committee Members:
Mahmoud Abo Khamis (Relational.AI)
Antoine Amarilli (Telecom Paris)
Yael Amsterdamer (Bar Ilan University)
Pablo Barceló (PUC Chile)
Vladimir Braverman (Rice University)
Marco Calautti (Università degli Studi di Milano)
Hubie Chen (King's College London)
Cristina Feier (University of Warsaw)
Diego Figueira (Université de Bordeaux)
Dominik Freydenberger (Loughborough University)
Martin Grohe (RWTH Aachen University)
Daniel Kifer (Penn State University)
Benny Kimelfeld (Technion)
Paraschos Koutris (University of Wisconsin-Madison)
Stefan Mengel (CNRS)
Frank Neven (Hasselt University)
Matthias Niewerth (Bayreuth University)
Jeff M. Phillips (University of Utah)
Reinhard Pichler (TU Wien)
Cristian Riveros (PUC Chile)
Francesco Scarcello (Università della Calabria)
Markus Schmid (Humboldt-Universität)
Yufei Tao (CUHK)
Jef Wijsen (University of Mons)
*Submission Instructions*
All submissions will be electronic via EasyChair
at https://easychair.org/conferences/?conf=icdt2024
Papers must be written in English and provide sufficient detail to allow
the program committee to assess their merits. The results must be
unpublished and not submitted for publication elsewhere, including the
proceedings of other symposia or workshops.
Papers must be submitted as PDF documents, using the LIPIcs style
(http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors).
Papers must be at most 15 pages, excluding references. Additional
details may be included in a clearly marked appendix, which, however,
will be read at the discretion of the program committee (online
appendices are not allowed). Papers not conforming to these requirements
may be rejected without further consideration.
The proceedings will appear in the Leibniz International Proceedings in
Informatics (LIPIcs) series, based at Schloss Dagstuhl. This guarantees
that the proceedings will be available online and free of charge, while
the authors retain the rights over their work.
At least one author of each accepted paper is expected to register at
the conference and to present the paper.
**ANONYMOUS SUBMISSION**
For 2024, ICDT will adopt anonymous submission, in line with other
leading conferences in the database community such as SIGMOD and PODS.
The intent of anonymous submission is to ensure that the identity of the
authors is not presented to the reviewers during the review process.
Specifically, submitted papers should not list authors or affiliations,
and should not include acknowlegments to funding sources, or other
colleagues or collaborators. References to the authors' own prior work
should not be distinguished from other references. Where this is not
possible (for instance, when referring to a specific system to which the
authors have privileged access), anonymized citations are permissible.
For more background on the motivation for anonymous submissions, and the
mechanisms to achieve it, please consult [Snodgrass, 2007]
https://www2.cs.arizona.edu/~rts/pubs/TODS07.pdf
Simultaneously, we encouage authors to make their submissions available
to the community via pre-print services such as ArXiv and through talks.
We do require that work is not labeled as "under submission at ICDT"
or indicates that it is under review, but otherwise place no
restrictions on sharing results. This does not conflict with the
anonymous submission requirement.
*Awards*
An award will be given to the Best Paper. Also, an award will be given
to the Best Newcomer Paper written by newcomers to the field of database
theory. The latter award will preferentially be given to a paper written
only by students; in that case the award will be called Best
Student-Paper Award. The program committee reserves the following
rights: not to give any award; to split an award among several papers;
and to define the notion of a newcomer. Papers authored or co-authored
by program committee members are not eligible for any award.
** Apologies if you receive multiple copies of these open positions **
Applications are invited for a fully funded postdoc/research associate
post in Computer Science at the University of Sheffield.
Job Reference Number: UOS035797
Job Title: Research Associate in Quantitative Verification
Contract Type: Fixed term until 30.11.2024
Faculty: Faculty of Engineering
Department: Department of Computer Science
Salary: Grade 7
£35,333 per annum
Closing Date: 4th February 2023
The post is supported by the EPSRC funded project “Quantitative
verification of software families based on coalgebraic modal logic and
games” (EP/X019373/1) headed by the PI
Dr. Harsh Beohar. For any queries, please do not hesitate to contact
me at h.beohar(a)sheffield.ac.uk; for a more detailed advertisement,
please visit the department website
(https://www.sheffield.ac.uk/dcs/about/jobs) and search using the
reference number: UOS035797.
Applications are invited for the post of Post-Doctoral Research Assistant in the Computer Science Department at Royal Holloway, University of London.
The post holder will have an exciting opportunity to work on the EPSRC-funded "Verification of Hardware Concurrency via Model Learning" (CLeVer) project,
led by Prof. Alexandra Silva (UCL/Cornell) and Matteo Sammartino (RHUL), in collaboration with ARM, world-leading designer of multi-core chips.
For an informal discussion about the post, please contact Matteo Sammartino on matteo.sammartino(a)rhul.ac.uk.
# Brief description of the project
Digital devices are increasingly complex, therefore there is a pressing need to automate the assessment of their correctness. Formal verification provides highly effective techniques to assess the correctness of systems. However, formal models are usually built by humans, and as such can be error-prone and inaccurate.
The project aims to develop a novel verification framework for hardware, which combines learning, testing and model-checking. Not all models are suitable for this purpose and hence specific classes of models will need to be developed, depending on the task at hand. Subsequently, learning and verification techniques for these classes need to be devised and tested in realistic case studies. We have an industrial partner, ARM, that will provide valuable guidance on the design and development of the aforementioned tasks.
# The ideal candidate
We are looking for candidates with a PhD in one of the following areas: model-based testing and verification, model learning, automated analysis of hardware systems. Experience in multiple areas will be valued. Candidates ideally should also have strong programming skills.
# Where to apply
Additional details and a link to the application can be found here:
https://jobs.royalholloway.ac.uk/0922-411-R-R
<https://jobs.royalholloway.ac.uk/0922-411-R>
The deadline is 20 Jan 2023 (midnight).
Best wishes,
Matteo Sammartino
==============================
Matteo Sammartino, Lecturer
Royal Holloway University of London
Department of Computer Science
Tel.: (+44) (0) 1784 44 3690
Office: 2-07, Bedford Building
https://matteosammartino.com/
This email, its contents and any attachments are intended solely for the addressee and may contain confidential information. In certain circumstances, it may also be subject to legal privilege. Any unauthorised use, disclosure, or copying is not permitted. If you have received this email in error, please notify us and immediately and permanently delete it. Any views or opinions expressed in personal emails are solely those of the author and do not necessarily represent those of Royal Holloway, University of London. It is your responsibility to ensure that this email and any attachments are virus free.
[apologies for cross-postings]
The Oxford Department of Computer Science has a vacancy for a full-time
Postdoctoral Research Associate position on the ERC-funded project
“ARiAT: Advanced Reasoning in Arithmetic Theories”:
http://www.cs.ox.ac.uk/news/2116-full.html
The goal of this project is to develop novel algorithms for reasoning in
arithmetic theories. Further information, including representative
publications that have so far arisen in the context of the project, can
be found under the following URL:
http://www.cs.ox.ac.uk/people/christoph.haase/home/project/ariat/
The position is for 18 months, with a flexible starting date around
April 2023. The post is advertised at Grade 7 with a salary range of
£34,308 - £42,155 p.a. The post may be under-filled at Grade 6 £30,502 -
£36,386 p.a. The application deadline is noon 25 January 2023.
Applicants are welcome to informally discuss this position with Dr.
Christoph Haase (christoph.haase(a)cs.ox.ac.uk).
*Two Assistant Professors in Mathematical and Computational Logic*
The *Institute for Logic, Language and Computation
<https://www.illc.uva.nl/>* (ILLC) at the University of Amsterdam (UvA) is
seeking to hire two new faculty members in the area of *Mathematical and
Computational Logic*. These appointments are envisaged at the assistant
professor level, but, in the case of an exceptionally strong candidate, one
of the appointments could be made at the associate professor level. The
closing date for applications is January 22, 2023.
For more information, see
https://vacatures.uva.nl/UvA/job/Two-Assistant-Professors-in-Mathematical-a…
========================================================
ICALP 2023 - Second Call for papers
========================================================
The 50th EATCS International Colloquium on Automata, Languages, and Programming
(ICALP) will take place in:
Paderborn, Germany, on 10-14 July 2023.
ICALP is the main conference and annual meeting of the European Association for
Theoretical Computer Science
(EATCS). As usual, ICALP will be preceded by a series of workshops, which will
take place on July 10.
The 2023 edition has the following features:
- Submissions are anonymous, and there is a rebuttal phase.
- The conference is planned as a physical, in-person event.
- This will be the 50th ICALP conference and some special events are planned.
========================================================
Important dates and information
========================================================
Submissions: February 11, 2023 at 11am CET
Rebuttal: March 22-25, 2023
Author notification: April 21, 2023
Camera-ready version: May 5, 2023
Early registration: TBA
Conference: July 10-14, 2023 (Workshops on July 10, 2023)
Deadlines are firm; late submissions will not be considered.
Conference website: https://icalp2023.cs.upb.de/
Twitter: @ICALPconf
Submission (tracks A and B): https://easychair.org/conferences/?conf=icalp2023
========================================================
Invited Speakers
========================================================
Anna Karlin - University of Washington, USA
Rasmus Kyng - ETH Zurich, Switzerland
Rupak Majumdar - Max Planck Institute for Software Systems, Germany
Thomas Vidick - California Institute of Technology, USA, and Weizmann Institute
of Science, Israel
James Worrell - University of Oxford, UK
========================================================
Submission guidelines
========================================================
1) Papers must present original research on the theory of computer science. No
prior publication and no
simultaneous submission to other publication outlets (either a conference or a
journal) is allowed. Authors are
encouraged to also make full versions of their submissions freely accessible in
an on-line repository such as
ArXiv, HAL, ECCC.
2) Submissions take the form of an extended abstract of no more than 15 pages,
excluding references and a clearly
labelled appendix. The appendix may consist either of omitted proofs or of a
full version of the submission, and
it will be read at the discretion of program committee members. The extended
abstract has to present the merits
of the paper and its main contributions clearly, and describe the key concepts
and technical ideas used to obtain
the results. Submissions must provide the proofs which can enable the main
mathematical claims of the paper to be
fully verified.
3) Submissions are anonymous. The conference will employ a fairly lightweight
double-blind reviewing process.
Submissions should not reveal the identity of the authors in any way. In
particular, authors’ names,
affiliations, and email addresses should not appear at the beginning or in the
body of the submission. Authors
should ensure that any references to their own related work are in the third
person (e.g., not “We build on our
previous work …” but rather “We build on the work of …”).
The purpose of this double-blind process is to help PC members and external
reviewers come to an initial judgment
about the paper without bias, and not to make it impossible for them to
discover who the authors are if they were
to try. Nothing should be done in the name of anonymity that weakens the
submission or makes the job of reviewing
the paper more difficult. In particular, important references should not be
omitted or anonymized. In addition,
authors should feel free to disseminate their ideas or draft versions of their
paper as they normally would. For
example, authors may post drafts of their papers on the web, submit them to
arXiv, and give talks on their
research ideas.
4) The submissions are done via Easychair to the appropriate track of the
conference (see topics below). The use
of pdflatex and the LIPIcs style are mandatory: papers that deviate
significantly from the required format risk
rejection without consideration of merit.
5) During the rebuttal phase, authors will have from March 22-25 to view and
respond to initial reviews. Further
instructions will be sent to authors of submitted papers before that time.
6) At least one author of each accepted paper is required to register for the
conference, and all talks are
in-person. In exceptional cases, there may be support for remotely presenting a
talk.
7) Papers authored only by students should be marked as such upon submission in
order to be eligible for the best
student paper awards of the track.
========================================================
Awards
========================================================
During the conference, the following awards will be given:
– the EATCS award,
- the Church prize,
– the Presburger award,
– the EATCS distinguished dissertation award,
– the best papers for Track A and Track B,
– the best student papers for Track A and Track B (see submission guidelines).
========================================================
Proceedings
========================================================
ICALP proceedings are published in the Leibniz International Proceedings in
Informatics (LIPIcs) series. This is
a series of high-quality conference proceedings across all fields in
informatics established in cooperation with
Schloss Dagstuhl – Leibniz Center for Informatics. LIPIcs volumes are published
according to the principle of
Open Access, i.e., they are available online and free of charge.
========================================================
Topics
========================================================
Papers presenting original research on all aspects of theoretical computer
science are sought. Typical but not
exclusive topics of interest are:
Track A: Algorithms, Complexity and Games
-----------------------------------------------------------
Algorithmic and Complexity Aspects of Network Economics
Algorithmic Aspects of Biological and Physical Systems
Algorithmic Aspects of Networks and Networking
Algorithmic Aspects of Security and Privacy
Algorithmic Game Theory and Mechanism Design
Approximation and Online Algorithms
Combinatorial Optimization
Combinatorics in Computer Science
Computational Complexity
Computational Geometry
Computational Learning Theory
Cryptography
Data Structures
Design and Analysis of Algorithms
Distributed and Mobile Computing
Foundations of Machine Learning
Graph Mining and Network Analysis
Parallel and External Memory Computing
Parameterized Complexity
Quantum Computing
Randomness in Computation
Sublinear Time and Streaming Algorithms
Theoretical Foundations of Algorithmic Fairness
Track B: Automata, Logic, Semantics, and Theory of Programming
----------------------------------------------------------------------------------------
Algebraic and Categorical Models of Computation
Automata, Logic, and Games
Database Theory, Constraint Satisfaction Problems, and Finite Model Theory
Formal and Logical Aspects of Learning
Formal and Logical Aspects of Security and Privacy
Logic in Computer Science and Theorem Proving
Models of Computation: Complexity and Computability
Models of Concurrent, Distributed, and Mobile Systems
Models of Reactive, Hybrid, and Stochastic Systems
Principles and Semantics of Programming Languages
Program Analysis, Verification, and Synthesis
Type Systems and Typed Calculi
========================================================
ICALP 2023 Programme Committee
========================================================
Track A: Algorithms, Complexity and Games
Amir Abboud (Weizmann Institute, Israel)
Mikkel Abrahamsen (University of Copenhagen, Denmark)
Sepehr Assadi (Rutgers University, USA)
Aditya Bhaskara (University of Utah, USA)
Arnab Bhattacharyya (National University of Singapore, Singapore)
Greg Bodwin (University of Michigan, USA)
Karl Bringmann (Saarland University, Germany)
Clément Canonne (University of Sydney, Australia)
Vincent Cohen Addad (Google Research, Zurich)
Amin Coja Oghlan (TU Dortmund, Germany)
Michael (Mike) Dinitz (Johns Hopkins University, USA)
Uriel Feige (Chair) (Weizmann Institute and MSR, Israel)
Moran Feldman (University of Haifa, Israel)
Sebastian Forster (University of Salzburg, Austria)
Sumegha Garg (Harvard University, USA)
Parikshit Gopalan (Apple, USA)
Russell Impagliazzo (University of California, San Diego, USA)
Karthik C.S.(Rutgers University, USA)
Yin Tat Lee (University of Washington, USA)
Stefano Leonardi (Sapienza Universita di Roma, Italy)
Sepideh Mahabadi (MSR Redmond, USA)
Giulio Malavolta (Max Planck Institute for Security and Privacy, Germany)
Jesper Nederlof (Utrecht University, Netherlands)
Vianney Perchet (Ensae and Criteo AI Lab, France)
Will Perkins (Georgia Institute of Technology, USA)
Marcin Pilipczuk (University of Warsaw, Poland, and IT University of
Copenhagen, Denmark)
Aviad Rubinstein (Stanford University, USA)
Barna Saha (University of California San Diego, USA)
Rahul Santhanam (University of Oxford, UK)
Thatchaphol Saranurak (University of Michigan, USA)
Igor Shinkar (Simon Fraser University, Canada)
Mohit Singh (Georgia Institute of Technology, USA)
David Steurer (ETH Zurich, Swizerland)
Ola Svensson (EPFL, Switzerland)
Inbal Talgam-Cohen (Technion, Israel)
Kavitha Telikepalli (Tata Institute of Fundamental Research, Mumbai, India)
Vera Traub (University of Bonn, Germany)
Salil Vadhan (Harvard University, USA)
David Wajc (Google Research, USA)
Henry Yuen (Columbia University, USA)
Meirav Zehavi (Ben-Gurion University, Israel)
Track B: Automata, Logic, Semantics, and Theory of Programming
Shaull Almagor (Technion, Israel)
Albert Atserias (Universitat Politecnica de Catalunya, Barcelona, Spain)
Christel Baier (TU Dresden, Germany)
Véronique Bruyère (University of Mons, Belgium)
Thomas Colcombet (IRIF / CNRS / Université Paris Cité, France)
Andrei Bulatov (Simon Fraser University, Canada)
Wojciech Czerwiński (University of Warsaw, Poland)
Kousha Etessami (Chair) (University of Edinburgh, UK)
John Fearnley (University of Liverpool, UK)
Dana Fisman (Ben-Gurion University, Israel)
Rob van Glabbeek (University of New South Wales, Australia)
Chris Heunen (University of Edinburgh, UK)
Justin Hsu (Cornell University, USA)
Stefan Kiefer (University of Oxford, UK)
Kohei Kishida (University of Illinois Urbana-Champaign, USA)
Jan Kretinsky (Technical University of Munich, Germany)
Karoliina Lehtinen (CNRS, Université Aix Marseille et Université de Toulon,
LIS, France)
Anthony Widjaja Lin (TU Kaiserslautern & MPI-SWS, Germany)
Wim Martens (University of Bayreuth, Germany)
Joanna Ochremiak (CNRS, University of Bordeaux, France and University of
Warsaw, Poland)
Daniela Petrisan (Université Paris Cité, IRIF, France)
Sam Staton (University of Oxford, UK)
Ashutosh Trivedi (University of Colorado - Boulder, USA)
Takeshi Tsukada (Chiba University, Japan)
Mahesh Viswanathan (University of Illinois Urbana-Champaign, USA)
========================================================
ICALP 2023 Workshop Chair
========================================================
Track A and B: Matthias Fischer
Selection Committee:
Johannes Blömer
Christian Scheideler
Friedhelm Meyer auf der Heide
See more details on the Call for Workshops webpage:
https://icalp2023.cs.upb.de/workshops/
========================================================
ICALP 2023 Proceedings Chair
========================================================
Gabriele Puppis (University of Udine, Italy)
========================================================
ICALP 2023 Organizing Committee
========================================================
Ulrich Ahlers
Bernard Bauer
Johannes Blömer
Tanja Bürger
Nadija Carter
Fabian Eidens
Rainer Feldmann
Matthias Fischer
Sevag Gharibian (Chair)
Marion Hucke
Claudia Jahn
Friedhelm Meyer auf der Heide
Franziska Reichelt
Petra Schäfermeyer
Christian Scheideler
Ulf-Peter Schroeder
Christian Soltenborn
Anna Steinig
Thomas Thissen
Heinz Georg Wassing
The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th’ ann an Oilthigh Dhùn Èideann, clàraichte an Alba, àireamh clàraidh SC005336.
(Apologies for multiple posting)
CALL FOR SHORT CONTRIBUTIONS / POSTERS
20th International Conference on
Relational and Algebraic Methods in Computer Science
RAMiCS 2023
3 to 6 April 2023, Technologiezentrum Augsburg, Germany
https://ramics20.lis-lab.fr/
Additionally to the standard CfP, RAMiCS is also calling for short
contributions and posters. We are hence calling for presentations of
original, unfinished, already published, or otherwise interesting work
within the topics of the RAMiCS conferences. The submission can be in
the form of a poster, an abstract, a paper submitted to or published
at another conference, etc. Short contributions will *not* be
published in the conference proceedings.
IMPORTANT DATES:
Submission: January 27, 2023
Notification: February 03, 2023
RAMiCS 2023: April 03-06, 2023
INVITED SPEAKERS:
Alexander Knapp, Augsburg University, Germany
John Stell, University of Leeds, UK
Valeria Vignudelli, CNRS/ENS Lyon, France
GENERAL INFORMATION:
Since 1994, the RAMICS conference series has been the main venue for
research on relation algebras, Kleene algebras and similar algebraic
formalisms, and their applications as conceptual and methodological
tools in computer science and beyond.
TOPICS:
We invite short submissions in the general fields of algebras relevant
to computer science and applications of such algebras. Topics include
but are not limited to:
* Theory
- algebras such as semigroups, residuated lattices, semirings,
Kleene algebras, relation algebras and quantales
- their connections with program logics and other logics
- their use in the theories of automata, concurrency, formal languages,
games, networks and programming languages
- the development of algebraic, algorithmic, category-theoretic,
coalgebraic and proof-theoretic methods for these theories
- their formalisation with theorem provers
* Applications
- tools and techniques for program correctness, specification and
verification
- quantitative and qualitative models and semantics of computing
systems and processes
- algorithm design, automated reasoning, network protocol analysis,
social choice, optimisation and control
- industrial applications
SUBMISSION INSTRUCTIONS:
Please send your short submission as a single pdf file to
ramics2023(a)easychair.org<mailto:ramics2023@easychair.org>
by January 27, 2023.
ORGANIZERS:
Roland Glück, Deutsches Zentrum für Luft- und Raumfahrt, Germany
Luigi Santocanale, LIS, Aix-Marseille University, France
Michael Winter, Brock University, Canada
The next session of the Logica Universalis Webinar will be Wednesday
December 14 at 4pm CET.
Speaker:Šejla Dautović
http://www.mi.sanu.ac.rs/novi_sajt/members/fulltime/sejla.php
Title: A Probabilistic Logic Between LPP1 and LPP2
Abstract: An extension of the propositional probability logic LPP2 given in
Ognjanović et al. (Probability Logics. Probability-Based Formalization of
Uncertain Reasoning, Theoretical Springer, Cham, Switzerland, 2016) that
allows mixing of propositional formulas and probabilistic formulas is
introduced. We describe the corresponding class of models, and we show that
the problem of deciding satisfiability is in NP. We provide infinitary
axiomatization for the logic and we prove that the axiomatization is sound
and strongly complete.
https://link.springer.com/article/10.1007/s11787-022-00301-z
Associate Organization: Seminar for Mathematical Logic, Belgrade, Serbia
Presented by its chairman: Predrag Tanović
Chair: Raja Natarajan
Editorial Board Logica Universalis
Everybody is welcome to attend
https://www.springer.com/journal/11787/updates/20065848
Jean-Yves Beziau
Organizer of LUW and Editor-in-Chief LU
http://www.jyb-logic.org/
*** Call for Participation ***
*** Certified Programs and Proofs (CPP) 2023 ***
- Early registration deadline: 16 December 2022
- Registration: https://popl23.sigplan.org/attending/registration
- Further reduced student participation fee: see below
- Accommodation: Boston Park Plaza
https://popl23.sigplan.org/venue/POPL-2023-venue
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 2023 (https://popl23.sigplan.org/home/CPP-2023) will be held on
16-17 January 2023 and will be co-located with POPL 2023. CPP 2023 is
sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG, and
supported by a diverse set of industrial sponsors.
Similarly to other events collocated with POPL 2023, CPP will take
place as an in-person event at Boston Park Plaza, and will require
attendees to provide proof of vaccination (details will be available
soon). Virtual participation via Airmeet will also be available; look for
updated information about that option on the POPL web site.
For more information about this edition and the CPP series, please
visit https://popl23.sigplan.org/home/CPP-2023
### Invited Speakers
* Sandrine Blazy, University of Rennes and IRISA
* Cezary Kaliszyk, University of Innsbruck
### Accepted papers
The list of accepted papers is available at
https://popl23.sigplan.org/home/CPP-2023#event-overview
### Subsidized student registration
To facilitate in-person participation, CPP 2023 offers the opportunity
to waive
the registration fees for those that are in need of financial support to
attend
the conference. This support is particularly aimed at undergraduate and
graduate
students, postdocs, and those from marginalized groups.
If you wish to apply for support you may do so by sending an email to
the CPP
conference co-chairs (Dmitriy Traytel and Robbert Krebbers, see below
for their
email addresses), with a brief description of your situation. The
deadline for
applications is 11 December 2022, 23:59 AoE. Notifications will be sent
out at
most two days later; hence, those who cannot be supported will still
have the
opportunity to register with the regular early registration fee before 16
December. Applications arriving after 11 December will be considered only if
additional budget is remaining.
CPP's student support is made possible by our generous industrial
supporters:
https://popl23.sigplan.org/home/CPP-2023#About
### Contact
For any questions please contact the chairs:
Steve Zdancewic <stevez(a)seas.upenn.edu> (PC co-chair)
Brigitte Pientka <bpientka(a)cs.mcgill.ca> (PC co-chair)
Robbert Krebbers <mail(a)robbertkrebbers.nl> (conference co-chair)
Dmitriy Traytel <traytel(a)di.ku.dk> (conference co-chair)