=================================================================
Final Call for Participation
LCC 2022
22nd International Workshop on Logic and Computational Complexity
February 20, 2022, Online
Collocated with CSL 2022
http://www.cs.swansea.ac.uk/lcc/
=================================================================
* The programme is now available online on the workshop’s web page:
http://www.cs.swansea.ac.uk/lcc/
* Invited speakers:
Stephan Kreutzer (TU Berlin)
Carsten Lutz (University of Bremen)
Isabel Oitavem (Nova University Lisbon)
* Registration is free, but necessary for organisation reasons. Please register on CSL’s website:
http://csl2022.uni-goettingen.de/
LCC meetings are aimed at the foundational interconnections between
logic and computational complexity, as present, for example, in
implicit computational complexity (descriptive and type-theoretic
methods); deductive formalisms as they relate to complexity
(e.g. ramification, weak comprehension, bounded arithmetic, linear
logic and resource logics); complexity aspects of finite model theory
and databases; complexity-mindful program derivation and verification;
computational complexity at higher type; and proof complexity. The
program will consist of invited lectures as well as contributed talks
selected by the Program Committee.
PROGRAM COMMITTEE:
Patrick Baillot (CNRS, University of Lille, France, co-chair)
Meghyn Bienvenu (CNRS, University of Bordeaux, France)
Juha Kontinen (University of Helsinki, Finland, co-chair)
Cynthia Kop (Radboud University Nijmegen, The Netherlands)
Barnaby Martin (Durhan University, UK)
Nicole Schweikardt (Humboldt-University Berlin, Germany)
CONTACT:
To contact the workshop organizers, please send e-mail to lcc22(a)easychair.org<mailto:lcc22@easychair.org>
*******************************************************
* PhD position in Logical Approach to Verification of Hyperproperties
* University of Sheffield, UK
* Fully funded for 3.5 years for students applicable for UK Home rates
* Possible times to start: ASAP/Autumn 2022
*******************************************************
I am looking for a motivated PhD student to join the Verification group (https://www.sheffield.ac.uk/dcs/research/groups/verification <https://www.sheffield.ac.uk/dcs/research/groups/verification>) of The University of Sheffield (https://www.sheffield.ac.uk/dcs <https://www.sheffield.ac.uk/dcs>). The topic of the PhD project is quite flexible, but should relate to logical theory of verification (for more details: https://www.sheffield.ac.uk/dcs/postgraduate/studentships <https://www.jobs.ac.uk/job/CLH126/phd-studentship-logical-approach-to-verif…>).
The Studentship will cover tuition fees at the UK rate and provide a tax-free stipend at the standard UKRC rate (currently £15,609 for 2021/22) for three and a half years. International students are eligible to apply, however will have to pay the difference between the UK and Overseas tuition fees.
There is a separate (highly competitive) funding option available for one outstanding Overseas student in the department of computer science. If you are interested in applying for this for a related topic, please contact me ASAP and I can tell you more details.
Interested candidates are encouraged to contact me directly by email for further details (j.t.virtema(a)sheffield.ac.uk). For more details on the topic, the candidate may refer to the subsection “Logics for Verification” at http://www.virtema.fi/ <http://www.virtema.fi/>.
Best wishes,
Jonni
==========================================================
First Call for Contributions
FOMEO'22 Formal Methods Education Online: Tips, Tricks & Tools
Collocated with FLoC'22
https://www7.in.tum.de/~kretinsk/fomeo22.html
==========================================================
Online instruction of formal methods has gained more and more importance
over the last years, including teaching of basics of logics and automata
theory, formal verification, theorem proving, knowledge representation
etc. This
workshop brings together instructors of formal methods as well as
developers of teaching support systems for formal methods to
(a) present teaching support systems for formal methods education, and
(b) discuss experiences with and concepts for developing online courses and
tools.
*IMPORTANT DATES:*
* decision physical/hybrid/online workshop May 1st, 2022
* submission deadline May 10th,
2022 (AoE)
* acceptance notification May 31st,
2021
* preliminary workshop date July 31st
and/or August 1st, 2021
*FORMAT:*
We plan to have short presentations of the tools and concepts, advertising
the key functionality, as well as discussion sessions, to allow for
detailed questions, demos and exchanging experiences.
Depending on the decision of FLoC on May 1st, we will either offer a
physical or hybrid workshop or have it completely online.
*SUBMISSION:*
You can submit your contribution at
https://easychair.org/conferences/?conf=fomeo22
We allow submission about tools that were already presented in the previous
edition of FOMEO.
Submissions should provide a short abstract (at most 1 page pdf in free
format) and fill in the basic information according to the following
template:
- Name:
- Link:
- Area:
- Content (3-5 lines):
- Usage (3-5 lines):
There will be no formal proceedings, but the PDF and the basic tool
information will be included in the regularly amended list of all tools on
the FOMEO website.
Please feel very welcome to ask any questions!
*ORGANIZERS:*
Jan Křetínský (TU Munich, jan.kretinsky(a)tum.com)
Josje Lodder (Open Universiteit Nederland, josje.lodder(a)ou.nl)
Francois Schwarzentruber (ENS Rennes, francois.schwarzentruber(a)ens-rennes.fr
)
Maximilian Weininger (TU Munich, maxi.weininger(a)tum.de)
Thomas Zeume (Ruhr University Bochum, thomas.zeume(a)rub.de)
==================================================================
Updated information on: Abstract and Submission dates
==================================================================
CALL FOR PAPERS
Seventh International Conference on
Formal Structures for Computation and Deduction (FSCD 2022)
August 2 - 5, 2022, Haifa, Israel
https://fscd2022.github.io
In-cooperation with ACM SIGLOG and SIGPLAN
IMPORTANT DATES
---------------
All deadlines are midnight anywhere-on-earth (AoE); late submissions will not be considered.
Abstract: February 12, 2022 *** extended
Submission: February 18, 2022 *** extended
Rebuttal: March 29-April 1, 2022
Notification: April 15, 2022
Final version: April 30, 2022
INVITED SPEAKERS
----------------
- Cynthia Kop, Radboud University Nijmegen (FSCD Invited Speaker)
- Alwen Tiu, The Australian National University (FSCD Invited Speaker)
- Orna Kupferman, Hebrew University (FLoC Plenary Speaker)
- Catuscia Palamidessi, INRIA Saclay and LIX (FLoC Keynote Speaker)
AFFILIATED WORKSHOPS
--------------------
- IFIP-WG1.6: Annual Meeting of the IFIP Working Group 1.6 on Term Rewriting (July 31, Invited talks only)
https://ifip-wg-rewriting.cs.ru.nl/
- HoTT/UF: 7th Workshop on Homotopy Type Theory/Univalent Foundations (July 31-August 1)
https://hott-uf.github.io/2022/
- IWC: 11th International Workshop on Confluence (August 1)
http://cl-informatik.uibk.ac.at/iwc/2022/
- LFMTP: International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (August 1)
https://lfmtp.org/workshops/2022/
- Linearity-TLLA: 3rd Joint International Workshop on Linearity in Logic and Computer science and its Applications (July 31-August 1)
- TERMGRAPH: 12th International Workshop on Computing with Terms and Graphs (August 1)
http://www.termgraph.org.uk/2022/
- WiL: 6th Workshop on Women in Logic (July 31)
https://sites.google.com/view/womeninlogic/workshops
- WPTE: 9th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (July 31)
https://wpte2022.github.io/
OVERVIEW
--------
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=fscd2022
Submissions must be formatted using the LIPIcs style files (https://submission.dagstuhl.de/series/details/5#author).
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, excluding references. They must present new software tools, or significantly new versions of such tools, in which FSCD topics play an important role. 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.
One author of an accepted paper is expected to present it at the (physical) conference, unless Covid restrictions prevent travel.
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
-----------------------
Amy Felty, University of Ottawa
fscd2022 at easychair.org
PROGRAM COMMITTEE
-----------------
Amal Ahmed, Northeastern University
Thorsten Altenkirch, Nottingham University
Takahito Aoto, Niigata University
Kazuyuki Asada, Tohoku University
Franz Baader, TU Dresden
James Cheney, University of Edinburgh
Agata Ciabattoni, Vienna University of Technology
Horatiu Cirstea, Loria
Nachum Dershowitz, Tel Aviv University
Gilles Dowek, Inria & ENS Paris-Saclay
Carsten Fuhs, Birkbeck, University of London
Hugo Herbelin, Inria & Université de Paris
Patricia Johann, Appalachian State University
Daniel Licata, Wesleyan University
Salvador Lucas, Universitat Politècnica de València
Christopher Lynch, Clarkson University
Ralph Matthes, IRIT, CNRS, TU Toulouse
Paul-André Melliès, CNRS, Université de Paris
Alexandre Miquel, Universidad de la República
Georg Moser, Universität Innsbruck
Daniele Nantes, Universidade de Brasília
Vivek Nigam, Huawei ERC & UFPB
Carlos Olarte, UFRN
Valeria de Paiva, Topos Institute
Giselle Reis, CMU Qatar
Masahiko Sakai, Nagoya University
Renate Schmidt, University of Manchester
Martina Seidl, Johannes Kepler University
Sam Staton, University of Oxford
Christine Tasson, Sorbonne Université
Benoît Valiron, LRI & Université de Paris
Stephanie Weirich, University of Pennsylvania
CONFERENCE CHAIR
----------------
Nachum Dershowitz, Tel Aviv University
WORKSHOP CHAIRS
--------------
Shaull Almagor, Technion
Guillermo A. Pérez, University of Antwerp
STEERING COMMITTEE WORKSHOP CHAIR
--------------------------------
Jamie Vicary, Oxford University
PUBLICITY CHAIR
---------------
Carsten Fuhs, Birkbeck, University of London
FSCD STEERING COMMITTEE
-----------------------
Zena Ariola, University of Oregon
Alejandro Díaz-Caro, Quilmes University & ICC/CONICET
Carsten Fuhs, Birkbeck, University of London
Herman Geuvers (Chair), Radboud University
Silvia Ghilezan, University of Novi Sad
Stefano Guerrini, Université de Paris 13
Delia Kesner, Université de Paris Diderot
Naoki Kobayashi, The University of Tokyo
Luigi Liquori, Inria
Damiano Mazza, Université de Paris 13
Jakob Rehof, TU Dortmund
Jamie Vicary, Oxford University
--------------------------------------------------------------------------------------------
Call for Participation
LMW@CSL 2022
1st Edition of Logic Mentoring Workshop @ CSL
https://lmw.mpi-sws.org/csl/
February 14, 2022
associated with Computer Science Logic (CSL) conference 2022
Registration is free but mandatory!
https://events.gwdg.de/event/95/
--------------------------------------------------------------------------------------------
The Logic Mentoring Workshop introduces young researchers to the technical and practical aspects of a career in logic research. It is targeted at students, from senior undergraduates to doctoral students, and will include tutorials and plenary talks as well as a panel discussion, where experienced researchers from the field answer career-related questions from the audience.
The workshop will happen virtually via Zoom. Details will be sent to the registered participants. Talks will be given live and include a Q&A session. Participants who cannot attend the whole workshop, for instance because of time-zone conflicts, are encouraged to join selected sessions.
SPEAKERS
- Shaull Almagor (Technion, Israel)
- Dmitry Chistikov (University of Warwick, UK)
- Liron Cohen (Ben-Gurion University, Israel)
- Daniele Nantes (Universidade de Brasília, Brazil)
- Michał Pilipczuk (University of Warsaw, Poland)
- Elaine Pimentel (University College London, UK)
- Monica VanDieren (Robert Morris University, USA)
PANELISTS
- Isolde Adler (University of Leeds, UK)
- Andrew Kent (Galois Inc., USA)
- Cláudia Nalon (Universidade de Brasília, Brazil)
- Stanislav Živný (University of Oxford, UK)
ORGANIZING COMMITTEE
Sandra Kiefer (RWTH Aachen University, Germany)
Filip Mazowiecki (University of Warsaw, Poland)
PROGRAM
The detailed program is available on the LMW@CSL website
https://lmw.mpi-sws.org/csl/program.html
Workshop on Advances in Separation Logics (ASL 2022), Haifa, Israel, July 31st 2022
https://asl-workshop.github.io/asl22/
The past two decades have witnessed important progress in static
analysis and verification of code with low-level pointer and heap
manipulations, mainly due to the development of Separation Logic
(SL). SL is a resource logic, a dialect of the logic of Bunched
Implications (BI) designed to describe models of the heap memory and
the mutations that occur in the heap as the result of low-level
pointer updates. The success of SL in program analysis is due to the
support for local reasoning, namely the ability of describing only the
resource(s) being modified, instead of the entire state of the
system. This enables the design of compositional analyses that
synthesize specifications of the behavior of small parts of the
program before combining such local specifications into global
verification conditions. Another interesting line of work consists in
finding alternatives to the underlying semantic domain of SL, namely
heaps with aggregative composition, in order to address other fields
in computing, such as self-adapting distributed networks, blockchain
and population protocols, social networks or biological systems.
We consider submissions on topics including:
* decision procedures for SL and other resource logics,
* computational complexity of decision problems such as satisfiability, entailment and abduction for SL and other resource logics,
* axiomatisations and proof systems for automated or interactive theorem proving for SL and other resource logics,
* verification conditions for real-life interprocedural and concurrent programs, using SL and other resource logics,
* alternative semantics and computation models based on the notion of resource,
* application of separation and resource logics to different fields, such as sociology and biology.
ASL 2022 is a workshop affiliated to IJCAR 2022 at FLOC 2022.
Keynote Speakers
* Philippa Gardner, Imperial College London
* Ralf Jung, MIT CSAIL
Important Dates
* Papers due: May 10, 2022 (AoE)
* Authors notification: June 15, 2022 (AoE)
* Workshop: July 31, 2022
Program Committee
Nadia Polikarpova (UCSD, San Diego, USA)
James Brotherston (UCL, London, UK)
Qinxiang Cao (Shanghai Jiaotong University)
Dan Frumin (University of Groningen, The Netherlands)
Lennart Beringer (Princeton University, USA)
Arthur Charguéraud (INRIA Strasbourg, France)
Radu Iosif (Verimag, CNRS, Univ. Grenoble Alpes, France)
Le Quang Loc (UCL, London, UK)
Alessio Mansutti (University of Oxford, UK)
Christoph Matheja (DTU, Lyngby, Denmark)
Daniel Méry (University of Loraine, France)
Koji Nakazawa (Nagoya University, Japan)
Nicolas Peltier (LIG, CNRS, Grenoble, France)
Adam Rogalewicz (Brno University of Technology, Czech Republic)
Mihaela Sighireanu (LMF, ENS Paris-Saclay, France)
Florian Zuleger (Vienna University of Technology, Austria)
Organizing committee
Radu Iosif (Verimag, CNRS, Univ. Grenoble Alpes, France)
Nikos Gorogiannis (Meta, London, UK)
Robbert Krebbers (Radboud Univ. Nijmegen, The Netherlands)
Mihaela Sighireanu (LMF, ENS Paris-Saclay, France)
Makoto Tatsuta (NII, Tokyo, Japan)
Thomas Noll (RWTH, Aachen, Germany)
*** ICALP 2022 Errata ***
The submission deadline in the previous call for paper was incorrect.
The correct submission deadline is
February 10, 2022 AoE
as indicated on the conference website https://icalp2022.irif.fr/
***Errata: the submission deadline in the previous message was incorrect***
==================================
ICALP 2022 - Final Call for Papers
==================================
The 49th International Colloquium on Automata, Languages, and Programming
(ICALP) will take place
** in Paris, France, and online on 4-8 July 2022. **
The 2022 edition has the following special features:
- Submissions are anonymous, and there is a rebuttal phase.
- The conference is hybrid.
- This will be the 50th birthday of the conference and some special events are
planned.
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 4. The 2022 edition will be
the occasion to celebrate the 50th anniversary of both EATCS and the first
ICALP, which was first held in 1972 in Rocquencourt, in the Paris area.
============= Important dates and information =============
Submissions: February 10, 2022 AoE
Rebuttal: March 21-23
Notification: April 11
Camera-ready version: April 25
Early registration: April 25
Conference: 4-8 July, 2022
Deadlines are firm; late submissions will not be considered.
Conference website: https://icalp2022.irif.fr/
Submission (track A): https://easychair.org/my/conference?conf=icalp2022#
Submission (track B): https://easychair.org/my/conference?conf=icalp2022#
============= Invited Speakers =============
Albert Atserias, Universitat Politècnica de Catalunya
Constantinos Daskalakis, MIT
Leslie Ann Goldberg, Oxford University
Madhu Sudan, Harvard
Stéphan Thomassé, ENS Lyon
Santosh Vempala, Georgia Tech
============= 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 not include obvious references that reveal their own identity,
and 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
(https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/) are
mandatory: papers that deviate significantly from the required format risk
rejection without consideration of merit.
5) During the rebuttal phase, authors will have three days, March 21-23, to view
and respond to initial reviews. Further instructions will be sent to authors of
submitted papers before that time.
6) One author per accepted paper is expected to present the work in Paris,
unless there are strong reasons not to do so, including high environmental cost
of travel or impossibility to travel. We will be monitoring the current
situation and are aware of possible travel restrictions, but we aim to organize
the conference as a hybrid event with a strong in-person attendance. If no
speaker can attend, a remote presentation and participation to the discussion
session are mandatory.
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 (https://eatcs.org/index.php/eatcs-award),
- the Gödel prize (https://eatcs.org/index.php/goedel-prize),
- the Presburger award (https://eatcs.org/index.php/presburger),
- the EATCS distinguished dissertation award
(https://eatcs.org/index.php/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 2022 Programme Committee =============
Track A: Algorithms, Complexity and Games
-----------------------------
Petra Berenbrink - University of Hamburg
Sergio Cabello - University of Ljubljana
Yixin Cao - Hong Kong Polytechnic University
Sitan Chen - University of California Berkeley
Xi Chen - Columbia University
Ilias Diakonikolas - University of Wisconsin-Madison
David Doty - University of California Davis
Yuval Filmus - Technion
Cyril Gavoille - Université de Bordeaux
Sevag Gharibian - Paderborn University
Seth Gilbert - National University of Singapore
Nick Gravin - Shanghai University of Finance and Economics
Kasper Green Larsen - Aarhus University
Abhradeep Guha Thakurta - Google Research
Hamed Hatami - McGill University
Sandy Irani - University of California Irvine
Yuval Ishai - Technion
Aayush Jain - NTT Research/CMU
Ken-ichi Kawarabayashi - National Institute of Informatics
Yuqing Kong - Peking University
Michal Koucky - Charles University
Stefano Leonardi - Sapienza Universita di Roma
Nutan Limaye - IT University of Copenhagen
Frederic Magniez - CNRS
Audra Mcmillan - Apple
Slobodan Mitrovic - MIT / University of California Davis
Wolfgang Mulzer - Freie Universitat Berlin
Cameron Musco - University of Massachusetts Amherst
Anand Natarajan - MIT
Jelani Nelson - University of California Berkeley
Evdokia Nikolova - University of Texas at Austin
Debmalya Panigrahi - Duke University
Richard Peng - Georgia Tech
Vijaya Ramachandran - University of Texas at Austin
Saket Saurabh - Institute of Mathematical Sciences, Chennai
Christian Sohler - University of Cologne
Thomas Steinke - Google Research
Vasilis Syrgkanis - Microsoft Research
Emanuele Viola - Northeastern University
Adrian Vladu - CNRS
Jan Vondrak - Stanford
Hoeteck Wee - NTT Research / ENS
David Woodruff - CMU (chair)
Christian Wulf-Nilsen - University of Copenhagen
Track B: Automata, Logic, Semantics, and Theory of Programming
---------------------------------
Luca Aceto - Reykjavik University
Isolde Adler - University of Leeds
Antoine Amarilli - Télécom Paris
Pablo Barcelo - Catholic University of Chile
Libor Barto - Charles University
Mikołaj Bojańczyk - University of Warsaw (chair)
Laura Ciobanu - Heriot-Watt University
Erich Grädel - RWTH Aachen University
Christoph Haase - University of Oxford
Marcin Jurdziński - University of Warwick
Benjamin Kaminski - University College London
Joost-Pieter Katoen - RWTH Aachen University
Bartek Klin - University of Oxford
Naoki Kobayashi - University of Tokyo
Dexter Kozen - Cornell University
Orna Kupferman - Hebrew University
Jérôme Leroux - CNRS / University of Bordeaux
Nathan Lhote - Aix-Marseille University
Markus Lohrey - University of Siegen
Joël Ouaknine - Max Planck Institute
Prakash Panangaden - McGill University
Michael Pinsker - Vienna University of Technology
Sven Schewe - University of Liverpool
Jeffrey Shallit - University of Waterloo
Mahsa Shirmohammadi - CNRS / University of Paris
Sebastian Siebertz - University of Bremen
Alex Simpson - University of Ljubljana
Lidia Tendera - University of Opole
============= ICALP 2022 Workshop Chairs =============
Track A: Valia Mitsou
Track B: Mahsa Shirmohammadi
============= ICALP 2022 Proceedings Chairs =============
Emanuela Merelli
============= ICALP 2022 Organizing Committee =============
Sandrine Cadet,
Olivier Carton
Thomas Colcombet
Geoffroy Couteau
Hugo Férée
Irène Guessarian
Natalia Hacquart
Florian Horn
Simon Mauras
Valia Mitsou
Sylvain Perifel
Amaury Pouly
Arnaud Sangnier
Sylvain Schmitz
Mahsa Shirmohammadi
==================================
ICALP 2022 - Second Call for Papers
==================================
The 49th International Colloquium on Automata, Languages, and Programming
(ICALP) will take place
** in Paris, France, and online on 4-8 July 2022. **
The 2022 edition has the following special features:
- Submissions are anonymous, and there is a rebuttal phase.
- The conference is hybrid.
- This will be the 50th birthday of the conference and some special events are
planned.
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 4. The 2022 edition will be
the occasion to celebrate the 50th anniversary of both EATCS and the first
ICALP, which was first held in 1972 in Rocquencourt, in the Paris area.
============= Important dates and information =============
Submissions: February 9, 2022 AoE
Rebuttal: March 21-23
Notification: April 11
Camera-ready version: April 25
Early registration: April 25
Conference: 4-8 July, 2022
Deadlines are firm; late submissions will not be considered.
Conference website: https://icalp2022.irif.fr/
Submission (track A): https://easychair.org/my/conference?conf=icalp2022#
Submission (track B): https://easychair.org/my/conference?conf=icalp2022#
============= Invited Speakers =============
Albert Atserias, Universitat Politècnica de Catalunya
Constantinos Daskalakis, MIT
Leslie Ann Goldberg, Oxford University
Madhu Sudan, Harvard
Stéphan Thomassé, ENS Lyon
Santosh Vempala, Georgia Tech
============= 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 not include obvious references that reveal their own identity,
and 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
(https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/) are
mandatory: papers that deviate significantly from the required format risk
rejection without consideration of merit.
5) During the rebuttal phase, authors will have three days, March 21-23, to view
and respond to initial reviews. Further instructions will be sent to authors of
submitted papers before that time.
6) One author per accepted paper is expected to present the work in Paris,
unless there are strong reasons not to do so, including high environmental cost
of travel or impossibility to travel. We will be monitoring the current
situation and are aware of possible travel restrictions, but we aim to organize
the conference as a hybrid event with a strong in-person attendance. If no
speaker can attend, a remote presentation and participation to the discussion
session are mandatory.
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 (https://eatcs.org/index.php/eatcs-award),
- the Gödel prize (https://eatcs.org/index.php/goedel-prize),
- the Presburger award (https://eatcs.org/index.php/presburger),
- the EATCS distinguished dissertation award
(https://eatcs.org/index.php/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 2022 Programme Committee =============
Track A: Algorithms, Complexity and Games
-----------------------------
Petra Berenbrink - University of Hamburg
Sergio Cabello - University of Ljubljana
Yixin Cao - Hong Kong Polytechnic University
Sitan Chen - University of California Berkeley
Xi Chen - Columbia University
Ilias Diakonikolas - University of Wisconsin-Madison
David Doty - University of California Davis
Yuval Filmus - Technion
Cyril Gavoille - Université de Bordeaux
Sevag Gharibian - Paderborn University
Seth Gilbert - National University of Singapore
Nick Gravin - Shanghai University of Finance and Economics
Kasper Green Larsen - Aarhus University
Abhradeep Guha Thakurta - Google Research
Hamed Hatami - McGill University
Sandy Irani - University of California Irvine
Yuval Ishai - Technion
Aayush Jain - NTT Research/CMU
Ken-ichi Kawarabayashi - National Institute of Informatics
Yuqing Kong - Peking University
Michal Koucky - Charles University
Stefano Leonardi - Sapienza Universita di Roma
Nutan Limaye - IT University of Copenhagen
Frederic Magniez - CNRS
Audra Mcmillan - Apple
Slobodan Mitrovic - MIT / University of California Davis
Wolfgang Mulzer - Freie Universitat Berlin
Cameron Musco - University of Massachusetts Amherst
Anand Natarajan - MIT
Jelani Nelson - University of California Berkeley
Evdokia Nikolova - University of Texas at Austin
Debmalya Panigrahi - Duke University
Richard Peng - Georgia Tech
Vijaya Ramachandran - University of Texas at Austin
Saket Saurabh - Institute of Mathematical Sciences, Chennai
Christian Sohler - University of Cologne
Thomas Steinke - Google Research
Vasilis Syrgkanis - Microsoft Research
Emanuele Viola - Northeastern University
Adrian Vladu - CNRS
Jan Vondrak - Stanford
Hoeteck Wee - NTT Research / ENS
David Woodruff - CMU (chair)
Christian Wulf-Nilsen - University of Copenhagen
Track B: Automata, Logic, Semantics, and Theory of Programming
---------------------------------
Luca Aceto - Reykjavik University
Isolde Adler - University of Leeds
Antoine Amarilli - Télécom Paris
Pablo Barcelo - Catholic University of Chile
Libor Barto - Charles University
Mikołaj Bojańczyk - University of Warsaw (chair)
Laura Ciobanu - Heriot-Watt University
Erich Grädel - RWTH Aachen University
Christoph Haase - University of Oxford
Marcin Jurdziński - University of Warwick
Benjamin Kaminski - University College London
Joost-Pieter Katoen - RWTH Aachen University
Bartek Klin - University of Oxford
Naoki Kobayashi - University of Tokyo
Dexter Kozen - Cornell University
Orna Kupferman - Hebrew University
Jérôme Leroux - CNRS / University of Bordeaux
Nathan Lhote - Aix-Marseille University
Markus Lohrey - University of Siegen
Joël Ouaknine - Max Planck Institute
Prakash Panangaden - McGill University
Michael Pinsker - Vienna University of Technology
Sven Schewe - University of Liverpool
Jeffrey Shallit - University of Waterloo
Mahsa Shirmohammadi - CNRS / University of Paris
Sebastian Siebertz - University of Bremen
Alex Simpson - University of Ljubljana
Lidia Tendera - University of Opole
============= ICALP 2022 Workshop Chairs =============
Track A: Valia Mitsou
Track B: Mahsa Shirmohammadi
============= ICALP 2022 Proceedings Chairs =============
Emanuela Merelli
============= ICALP 2022 Organizing Committee =============
Sandrine Cadet,
Olivier Carton
Thomas Colcombet
Geoffroy Couteau
Hugo Férée
Irène Guessarian
Natalia Hacquart
Florian Horn
Simon Mauras
Valia Mitsou
Sylvain Perifel
Amaury Pouly
Arnaud Sangnier
Sylvain Schmitz
Mahsa Shirmohammadi