CALL FOR PAPERS and WORKSHOP PROPOSALS.
Here is both a call for papers (18/23 Jan) and a call for workshop proposals (30 Nov) for LICS 2023 (June 2023).
Thirty-Eighth Annual ACM/IEEE Symposium on
LOGIC IN COMPUTER SCIENCE (LICS)
Boston, June 2023
https://lics.siglog.org/lics23
SCOPE
The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, foundations of probabilistic, real-time and hybrid systems, games and logic, higher-order logic, knowledge representation and reasoning, lambda and combinatory calculi, linear logic, logic programming, logical aspects of AI, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, process calculi, programming language semantics, proof theory, reasoning about security and privacy, rewriting, type systems, type theory, and verification.
IMPORTANT DATES FOR PAPERS
Authors are required to submit a paper title and a short abstract of about 100 words in advance of submitting the extended abstract of the paper. The exact deadline time on these dates is given by anywhere on earth (AoE).
Titles and Short Abstracts Due: 18 January 2023
Full Papers Due: 23 January 2023
Author Feedback/Rebuttal Period: 15-19 March 2023
Author Notification: 5 April 2023
Conference: 26-29 June 2023.
Submission deadlines are firm; late submissions will not be considered. All submissions will be electronic via easychair.
PAPER SUBMISSION INSTRUCTIONS
Every full paper must be submitted in the IEEE Proceedings 2-column 10pt format and may be at most 12 pages, excluding references. Latex style files and further submission information is at https://lics.siglog.org/lics23/cfp.php.
LICS 2023 will use a lightweight double-blind reviewing process. Please see the website for further details and requirements from the double-blind process.
The official publication date may differ from the first day of the conference. The official publication date may affect the deadline for any patent filings related to published work. We will clarify the official publication date in due course.
--
LICS 2023 Call for Workshop Proposals
Researchers and practitioners are invited to submit proposals for workshops on topics relating logic -- broadly construed -- to computer science or related fields. Typically, LICS workshops feature a number of invited speakers and a number of contributed presentations. LICS workshops do not usually produce formal proceedings. However, in the past there have been special issues of journals based in part on certain LICS workshops.
Proposals should include:
- A short scientific summary and justification of the proposed
topic. This should include a discussion of the particular
benefits of the topic to the LICS community.
- Potential invited speakers.
- Procedures for selecting participants and papers.
- Plans for dissemination (for example, special issues of journals).
- The proposed duration, which is one or two days.
- A discussion of the proposed format and agenda.
- Expected number of participants, providing data on previous years
if the workshop has already been organised in the past.
Proposals should be sent to Valentin Blot: lics23-workshops at valentinblot.org
IMPORTANT DATES FOR WORKSHOP PROPOSALS
- Submission deadline: November 30, 2022
- Notification: mid-December, 2022
- Program of the workshops ready: May 24, 2023
- Workshops: June 24-25, 2023
- LICS conference: June 26-29, 2023
The workshops selection committee consists of the LICS Workshops Chair, the LICS General Chair, the LICS PC Chair and the LICS Conference Chair.
Dear Colleagues,
Below please find the CALL FOR PAPERS for the ICALP 2023 conference.
ICALP 2023, the 50th ICALP conference, will take place in Paderborn, Germany,
July 10th-14th, 2023.
The deadline for submissions is ** February 11th, 2023 **.
We hope you will consider submitting your papers to ICALP 2023.
Best regards,
Kousha Etessami
(ICALP 2023--Track-B PC Chair)
========================================================
========================================================
ICALP 2023 - First 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.
The 5th edition of the World Logic Day will take place around the world
January 14, 2023.
The first edition was organized January 14, 2019 and unanimously approved
by the General Assembly of UNESCO the same year:
http://www.logica-universalis.org/wld3
See here how to organize a celebration:
https://wld.cipsh.international/organise_event.html
>----------------------------------------------------------------
Jean-Yves Beziau
Federal University of Rio de Janeiro, Brazil
Logica Universalis Association, Geneva, Switzerland
https://philpeople.org/profiles/jean-yves-beziau
Call for Course and Workshop Proposals
34th European Summer School in Logic, Language and Information – ESSLLI 2023
31 July–11 August, 2023, Ljubljana, Slovenia
https://2023.esslli.eu/
Important Dates
13 January 2023: Course Title submission deadline (mandatory)
20 January 2023: Final submission
3 March 2023: Notification
Introduction
Under the auspices of the Association for Logic, Language, and Information (FoLLI), the European Summer School in Logic, Language, and Information (ESSLLI) runs every year. Except for 2021, where the school was virtual, it runs in a different European country each year. It takes place over two weeks in the summer, hosts approximately 50 different courses at both introductory and advanced levels, and attracts around 400 participants from all over the world.
Since 1989, ESSLLI has been providing outstanding interdisciplinary educational opportunities in the fields of Computer Science, Cognitive Science, Linguistics, Logic, Philosophy, and beyond. It comes from a community which recognizes that advances in our common areas require the contributions of multiple interrelated disciplines.
The main focus of ESSLLI is the interface between linguistics, logic and computation, with special emphasis in human linguistic and cognitive ability. Courses, both introductory and advanced, cover a wide variety of topics within the combined areas of interest: Logic and Computation, Computation and Language, and Language and Logic. Workshops are also organized, providing opportunities for in-depth discussion of issues at the forefront of research, as well as a series of invited evening lectures.
Topics and Format
Proposals for courses and workshops at ESSLLI 2023 are invited in all areas of Logic, Linguistics and Computer Sciences. Cross-disciplinary and innovative topics are particularly encouraged.
Each course and workshop will consist of five 90 minute sessions, offered daily (Monday-Friday) in a single week. Proposals for two-week courses should be structured and submitted as two independent one-week courses, e.g. as an introductory course followed by an advanced one. In such cases, the ESSLLI program committee reserves the right to accept just one of the two proposals.
All instructional and organizational work at ESSLLI is performed completely on a voluntary basis, so as to keep participation fees to a minimum. However, organizers and instructors have their registration fees waived, and are reimbursed for travel and accommodation expenses up to a level to be determined and communicated with the proposal notification. ESSLLI can only guarantee reimbursement for at most one course/workshop organizer, and cannot guarantee full reimbursement of travel costs for lecturers or organizers from outside of Europe. The ESSLLI organizers would appreciate any help in controlling the School's expenses by seeking partial or complete coverage of travel and accommodation expenses from other sources.
Categories
Each proposal should fall under one of the following categories.
Foundational Courses
Such courses are designed to present the basics of a research area, to people with no prior knowledge in that area. They should be of elementary level, without prerequisites in the course's topic, though possibly assuming a level of general scientific maturity in the relevant discipline. They should enable researchers from related disciplines to develop a level of comfort with the fundamental concepts and techniques of the course's topic, thereby contributing to the interdisciplinary nature of our research community.
Introductory Courses
Introductory courses are central to ESSLLI's mission. They are intended to introduce a research field to students, young researchers, and other non-specialists, and to foster a sound understanding of its basic methods and techniques. Such courses should enable researchers from related disciplines to develop some comfort and competence in the topic considered. Introductory courses in a cross-disciplinary area may presuppose general knowledge of the related disciplines.
Advanced Courses
Advanced courses are targeted primarily to graduate students who wish to acquire a level of comfort and understanding in the current research of a field.
Workshops
Workshops focus on specialized topics, usually of current interest. Workshop organizers are responsible for soliciting papers and selecting the workshop program. They are also responsible for publishing proceedings if they decide to have proceedings.
Proposal Guidelines
Course and workshop proposals should closely follow these guidelines to ensure full consideration.
Course and Workshop proposals can be submitted by no more than two lecturers/organizers and they are presented by no more than these two lecturers/organizers. All instructors and organizers must possess a PhD or equivalent degree by the submission deadline.
Course proposals should mention explicitly the intended course category. Proposals for introductory courses should indicate the intended level, for example as it relates to standard textbooks and monographs in the area. Proposals for advanced courses should specify the prerequisites in detail.
Proposals of Courses given at ESSLLI the previous year will have a lower priority of being accepted in the current year.
Proposals must be in PDF format include all of the following:
1. Personal information for each proposer: Name, affiliation, contact address, email, homepage (optional)
2. General proposal information: Title, category
3. Contents information:
* Abstract of up to 150 words
* Motivation and description (up to two pages)
* Tentative outline
* Expected level and prerequisites
* Appropriate references (e.g. textbooks, monographs, proceedings, surveys)
1. Information on the proposer and course:
* Will your course appeal to students outside of the main discipline of the course?
* Include information on your experience in the intensive one-week interdisciplinary setting
* Include evidence that the course proposer is an excellent lecturer
1. Information from workshop organizers:
* Include information on relevant preceding meetings and events, if applicable
* Include information about potential external funding for participants
Submission Information
By January 13, 2023: You are asked to submit in EasyChair at least the name(s) of the instructor(s), the ESSLLI area+course level and a short abstract.
By January 20: Your submission must be completed by uploading a PDF with the actual proposal as detailed above.
Submission Portal
Please submit your proposals to
https://easychair.org/conferences/?conf=esslli2023 <https://easychair.org/conferences/?conf=esslli2023>
Childcare
If there is enough interest, ESSLLI will provide information on private child care services available during the summer school.
EACSL Sponsorship
The EACSL will support one Logic and Computation course or workshop addressing topics of interest to Computer Science Logic (CSL) conferences. The selected course or workshop will be designated an EACSL course/workshop in the programme. If you wish to be considered for this, please indicate so in your proposal.
Organizing Committee
Slavko Žitnik (University of Ljubljana) (chair)
Špela Vintar (University of Ljubljana)
Timotej Knez (University of Ljubljana)
Mojca Brglez (University of Ljubljana)
Matej Klemen (University of Ljubljana)
Aleš Žagar (University of Ljubljana)
Program Committee
Juha Kontinen (University of Helsinki) (chair)
Kaja Dobrovoljc (University of Ljubljana) (local co-chair)
Area Chairs Language and Computation (LaCo)
Kilian Evang (Heinrich Heine University Düsseldorf)
Miryam de Lhoneux (KU Leuven)
Shane Steinert-Threlkeld (University of Washington)
Area Chairs Language and Logic (LaLo)
Ivano Ciardelli (University of Padua)
Agata Renans (Ruhr-Universität Bochum)
Jacopo Romoli (Heinrich Heine University Düsseldorf)
Area Chairs Logic and Computation (LoCo)
Natasha Alechina (Utrecht University)
Alessandra Palmigiano (Vrije Universiteit Amsterdam)
Lutz Straßburger (Inria Saclay & École Polytechnique)
ESSLLI Steering Committee
Darja Fiser (University of Ljubljana) (chair)
Phokion Kolaitis (University of California, Santa Cruz) (vice-chair)
Roman Kuznets (TU Wien)
Petya Osenova (Bulgarian Academy of Sciences and Sofia University) (secretary)
Jakub Szymanik (University of Amsterdam)
CIE 2023: FIRST CALL FOR PAPERS
COMPUTABILITY IN EUROPE 2023
Batumi, Georgia
July 24-28, 2023
https://www.viam.science.tsu.ge/cie2023/
Submission link: https://easychair.org/conferences/?conf=cie2023
IMPORTANT DATES:
* Deadline for article registration (abstract submission): February
8, 2023 (AOE)
* Deadline for article submission: February 15, 2023 (AOE)
* Notification of acceptance: April 20, 2023
* Final versions due: May 1, 2023
* Deadline for informal presentations submission: June 8, 2023 (The
notifications of acceptance for informal presentations will be sent a
few days after submission.)
* Early registration before: June 10, 2023.
GENERAL INFORMATION
CiE 2023 is the 19th conference organized by CiE (Computability in
Europe), a European association of mathematicians, logicians, computer
scientists, philosophers, physicists and others interested in new
developments in computability and their underlying significance for the
real world.
Previous meetings have taken place in Amsterdam (2005), Swansea (2006),
Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010),
Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest
(2015), Paris (2016), Turku (2017), Kiel (2018), Durham (2019), Salerno
(2020, virtually), Ghent (2021, virtually), and Swansea (2022).
TUTORIAL SPEAKERS
* Ludovic Perret (Sorbonne University)
* Ludovic Patey (Université Paris Diderot)
INVITED SPEAKERS
* Andrei Bulatov (Simon Fraser University)
* Anne Condon (University of British Columbia)
* Stephanie Dick (University of Pennsylvania)
* Kirsten Eisenträger (Pennsylvania State University)
* Neil Lutz (Iowa State University)
* Mark Steedman (University of Edinburgh)
SPECIAL SESSIONS
We are going to have 6 special sessions.
The topics of the special sessions will be announced soon.
CONFERENCE TOPICS
The CiE conferences serve as an interdisciplinary forum for research in
all aspects of computability, foundations of computer science, logic,
and theoretical computer science, as well as the interplay of these
areas with practical issues in computer science and with other
disciplines such as biology, mathematics, philosophy, or physics.
PAPER SUBMISSION
THE PROGRAM COMMITTEE cordially invites all researchers, European and
non-European, to submit their papers in all areas related to the above
for presentation at the conference and inclusion in the proceedings of
CiE 2023 at https://easychair.org/conferences/?conf=cie2023
CONFERENCE PROCEEDINGS
Papers submitted to the conference proceedings should represent original
work, not simultaneously submitted to another journal or conference with
formal proceedings.
The Program Committee will rigorously review and select submitted
papers. Accepted papers will be published as a proceedings volume in the
Lecture Notes in Computer Science (LNCS) series from Springer-Verlag.
Papers to be considered in the conferences proceedings must be submitted
in PDF format, using the LNCS style (available at
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…)
and must have a maximum of 12 pages, including references but excluding
a possible appendix in which one can include proofs and other additional
material. Papers building bridges between different parts of the
research community are particularly welcome.
INFORMAL PRESENTATIONS
Continuing the tradition of past CiE conferences, we invite researchers
to present informal presentations of their recent work. A proposal for
an informal presentation must be submitted via EasyChair
(https://easychair.org/conferences/?conf=cie2023), using the LNCS style
file (available at
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…),
and be 1 page long; a brief description of the results suffices and an
abstract is not required. Informal presentations will not be published
in the LNCS conference proceedings. Results presented as informal
presentations at CiE 2023 may appear or may have appeared in other
conferences with formal proceedings and/or in journals.
PROGRAM COMMITTEE
Contributed papers will be selected from submissions received by the
PROGRAM COMMITTEE consisting of:
* Nikolay Bazhenov (Novosibirsk State University)
* Manuel Bodirsky (TU Dresden)
* Vasco Brattka (Munich)
* Liesbeth De Mol (University of Lille)
* Gianluca Della Vedova (University of Milano-Bicocca, co-chair)
* Besik Dundua (Kutaisi Intl University)
* Giudittta Franco (University of Verona)
* Juan Luis Gastaldi (ETH Zurich)
* Thomas Graf (Stony Brook University)
* Delaram Kahrobaei (CUNY)
* Ekaterina Komendantskaya (Heriot-Watt University Edinburgh)
* Angeliki Koutsoukou-Argyraki (Cambridge University)
* Steffen Lempp (University of Wisconsin-Madison, co-chair)
* Florin Manea (Goettingen University)
* Klaus Meer (University Cottbus)
* Isabel Oitavem (Nova University Lisbon)
* Roland Omanadze (Ivane Javakhishvili Tbilisi State University)
* Daniel Paulusma (Durham University)
* Elaine Pimentel (University College London)
* Markus Schmid (Humboldt University Berlin)
* Shinnosuke Seki (University Electro Comm Tokyo)
* Bas Terwjn (Nijmegen University)
* Dan Turetsky (Victoria University Wellington)
* Linda Westrick (Pennsylvania State University)
WOMEN IN COMPUTABILITY
We are very happy to announce that within the framework of the Women in
Computability program, we are able to offer some grants for junior women
researchers who want to participate in CiE 2023. Applications for this
grant should be sent to Liesbeth de Mol, liesbeth.de-mol(a)univ-lille.fr,
before May 15, 2023 and include a short cv (at most 2 pages) and contact
information for an academic reference. Preference will be given to
junior women researchers who are presenting a paper (including informal
presentations) at CiE 2023.
Association CiE [1]
CiE Conference Series [2]
HOSTED BY
Batumi Shota Rustaveli State University
Rustaveli str. 32, Batumi, Georgia
This conference is in cooperation with the Association for Women in
Mathematics and supports the Welcoming Environment Statement. We are
grateful for support from Batumi Shota Rustaveli State University and
Institute of Applied Mathematics, Tbilisi State University.
ORGANIZING COMMITTEE
* Davit Begashvili (Kutaisi International University)
* Mikheil Donadze (Batumi Shota Rustaveli State University)
* Besik Dundua (chair, Kutaisi International University and Institute
of Applied Mathematics, Tbilisi State University)
* Tsotne Mikadze (Kutaisi International University)
* Mikheil Rukhaia (co-chair, Institute of Applied Mathematics, Tbilisi
State University)
* Lela Turmanidze (Batumi Shota Rustaveli State University)
Links:
------
[1] https://www.acie.eu
[2] https://www.acie.eu/cie-conference-series/
ATVA 2022 Call For Participation
ATVA 2022 will be held virtually from October 25th (Tuesday) to October 28th (Friday), 2022.
The program of ATVA 2022 is available at https://atva-conference.org/2022/program/ <https://atva-conference.org/2022/program/>.
ATVA 2022 will include
— 2 tutorials by Constantin Enea (Ecole Polytechnique) and Mahesh Viswanathan (UIUC),
— 5 keynotes by Sanjit A. Seshia (UC Berkeley), Xinyu Feng (Nanjing University), Shaz Qadeer (Meta), Jean-François Raskin (Université Libre de Bruxelles), and Mohamed Faouzi Atig (Uppsala University),
— 8 sessions.
We invite and welcome you to attend ATVA 2022 and the registration is free.
If you would like to attend ATVA 2022, please register by filling in the registration form at https://jinshuju.net/f/XVerv0.
After the registration, the participation information will be sent to you by emails.
Best regards,
Ahmed, Lukas, Zhilin
** Apologies if you receive multiple copies of these open positions **
Up to three fully funded research and teaching assistant positions with the opportunity of undertaking a PhD are available within the Verification Group, Department of Computer Science, at the University of Sheffield:
https://www.sheffield.ac.uk/dcs/research/groups/verification <https://www.sheffield.ac.uk/dcs/research/groups/verification>
The verification group at Sheffield is growing rapidly. These posts provide excellent opportunities for graduate students (UK and overseas) to obtain a PhD in any active research area of the group, including semantics of concurrent and distributed systems, logics and complexity, algebraic and categorical approaches to program semantics, verification of multi-core programs and weak memory models, interactive theorem proving.
The posts are fully funded for 6 years with 60% devoted to research and 40% to teaching support..
For more detailed information (including roles and responsibilities), please see
https://www.jobs.ac.uk/job/CTM862/teaching-and-research-assistant-in-comput…
For details on possible supervisors and research projects, please contact our personal websites from our group webpage
https://www.sheffield.ac.uk/dcs/research/groups/verification <https://www.sheffield.ac.uk/dcs/research/groups/verification>
For informal enquiries, please do not hesitate to contact any group member by email.
Dr. Jonni Virtema is keen to supervise students in any area of his current research, which relate to the interplay of logic and complexity theory. Current topics include logics and complexity theory related to numerical data, and temporal logics designed to express so-called hyperproperties, which are important in information flow and security. A further emerging topic is to study foundations of neural networks using the machinery of logics and complexity theory related to numerical data. See http://www.virtema.fi/ <http://www.virtema.fi/> for further details.
Dr. Harsh Beohar is broadly interested in comparative concurrency semantics and in the interplay of category theory, logic, and semantics. Current topics include expressive modal logics, behavioural equivalence games, synthesising distinguishing/characteristic formulae all at the level of coalgebras. See https://dblp.org/pid/13/7482.html <https://dblp.org/pid/13/7482.html> for an uptodate list of publications.
Dr. Mike Stannett is interested in formal verification of physical theories, using Isabelle/HOL to verify first-order special and general relativity. Working with researchers at the Renyi Institute in Budapest he has successfully verified the “No Faster-than-Light Observers” theorem for special relativity; he is now collaborating on a locale-based extension of this proof to cover the corresponding theorem of general relativity. Other topics of interest include extending the Hungarian theories to generate a combined first-order quantum/relativistic theory. See https://scholar.google.com/citations?user=kppqMecAAAAJ <https://scholar.google.com/citations?user=kppqMecAAAAJ> for a list of publications.
The Department of Computer Science and Technology at the University of
Cambridge is currently advertising a number of new faculty positions.
These include a position in the area of Algorithms and Complexity:
https://www.jobs.cam.ac.uk/job/37368/
and a position in Logical Foundations and Formal Methods:
https://www.jobs.cam.ac.uk/job/37369/
which may be of interest to readers of this list.
--
Anuj.Dawar(a)cl.cam.ac.uk
Professor of Logic and Algorithms
Department of Computer Science and Technology
University of Cambridge Phone: +44 1223 334408
15 J.J. Thomson Avenue Fax: +44 1223 334678
Cambridge CB3 0FD, UK. http://www.cst.cam.ac.uk/people/ad260