Join the Logica Universalis Webinar!
The next session will be held on Wednesday, November 10 at 4pm CET with the talk
Calculi for Many-Valued Logics<https://link.springer.com/article/10.1007/s11787-021-00274-5>
Michael Kaminski<https://urldefense.proofpoint.com/v2/url?u=https-3A__www.cs.technion.ac.il_…> and Nissim Francez<https://urldefense.proofpoint.com/v2/url?u=https-3A__www.cs.technion.ac.il_…> (Technion, Israel)
Chair: Anna Zamansky<https://is-web.hevra.haifa.ac.il/index.php/en/dr-anna-zamansky>, Editorial Board SUL
Associate Organization: Logic in Israel
presented by Liron Cohen<https://urldefense.proofpoint.com/v2/url?u=https-3A__in.bgu.ac.il_en_Pages_…>
The Logica Universalis Webinar is a World Seminar Series connected to the journal Logica Universalis<https://www.springer.com/journal/11787/>, the book series Studies in Universal Logic<https://www.springer.com/series/7391> and the Universal Logic Project<https://logica-universalis.org/>. It is an open platform for all scholars interested in the many aspects of logic. (See the full program here<https://www.springer.com/journal/11787/updates/18988758>.)
The sessions take place on Wednesdays at 4pm CET (click here<https://www.timeanddate.com/worldclock/fixedtime.html?msg=Logica+Universali…> to convert to your timezone). They are held via Zoom and are free to attend. Please register in advance.
Registration is now open!<https://springer.zoom.us/meeting/register/tJMvdu6vrzMiHda_iDhjxw9vA9d7we9gT…>
Each session of the webinar is chaired by a member of the editorial board of the journal Logica Universalis (LU), the book series Studies in Universal Logic (SUL) or an organizer of an event of the Universal Logic Project (ULP). Sessions will start with a short presentation of a logical organization related to the region of the speaker or the topic of the talk. The talk (30 min) will focus on a recently published paper in LU, on a book in SUL, on an event or on the ULP. Talks are followed by a discussion (15 min).
Video recordings of the seminars are uploaded on the YouTube channel Universal Logic Project<https://www.youtube.com/channel/UCPS1c5ApuwjuCV9UjXHUN4w>.
---
To unsubscribe from these notifications for the Logica Universalis Webinar please send a message with 'Unsubscribe' to this e-mail address (antje.herbst(a)springernature.com<mailto:antje.herbst@springernature.com>).
--
Antje Herbst
Associate Editor Mathematics
Journals
Springer Nature
Tiergartenstraße 17, 69121 Heidelberg, Germany
T +49 62214878984
antje.herbst(a)springernature.com<mailto:antje.herbst@springernature.com>
www.springernature.com<http://www.springernature.com/>
--
Springer Nature is a leading research, educational and professional publisher, providing quality content to our communities through a range of innovative platforms, products and services. Every day, around the globe, our imprints, books, journals and resources reach millions of people - helping researchers, students, teachers & professionals to discover, learn and achieve.
--
Branch of Springer-Verlag GmbH, Heidelberger Platz 3, 14197 Berlin, Germany
Registered Office: Berlin / Amtsgericht Berlin-Charlottenburg, HRB 91881 B
Directors: Martin Mos, Dr. Ulrich Vest, Dr. Niels Peter Thomas
VerifyThis 2022: Call for Problems
apologies for multiple postings.
VerifyThis<https://www.pm.inf.ethz.ch/research/verifythis.html> is a series of program verification competitions, which has taken place annually since 2011 (with the exception of 2020). Previous competitions in the series have been held at FoVeOOS 2011, FM 2012, Dagstuhl (April 2014), and ETAPS 2015—2021.
To extend the problem pool and tend better to the needs of the participants, we are soliciting verification problems for the competition:
* A problem should contain an informal statement of the algorithm to be implemented (optionally with complete or partial pseudo code) and the requirement(s) to be verified.
* A problem should be suitable for a 60—90 minute time slot.
* Submission of reference solutions is strongly encouraged.
* Problems with an inherent language- or tool-specific bias should be clearly identified as such.
* Problems that contain several subproblems or other means of difficulty scaling are especially welcome.
* The organizers reserve the right (but no obligation) to use the problems in the competition, either as submitted or with modifications.
* Submissions from (potential) competition participants are allowed.
Problems from previous competitions can be seen at the archive<http://www.pm.inf.ethz.ch/research/verifythis/Archive.html>.
Please send submissions via email to verifythis(a)googlegroups.com<mailto:verifythis@googlegroups.com> by January 31, 2022.
The most suitable submission for competition will receive a prize.
A postdoctoral research position is available at Birkbeck, University of
London. The successful candidate will be hosted by Hubie Chen and will
work on the computational complexity of database query evaluation and
related topics. The position, which is funded by a grant from UK's
EPSRC, is offered for 1 year, with the possibility of a 1-year
extension.
Key dates: the application deadline is November 26, 2021; the starting
date is flexible.
For more information and to apply, please see:
https://cis7.bbk.ac.uk/vacancy/postdoctoral-research-assistant-462654.html.
The University of Sheffield has an opening for a Lecturer in Theoretical Computer Science. Researchers in the area of computational complexity, where the interests of the Algorithms and Verification groups in the Department overlap, are particularly encouraged to apply.
Application deadline: November 16, 2021
Further details: https://www.jobs.ac.uk/job/CKB031/lecturer-in-theoretical-computer-science
Sincerely,
Jonni Virtema
CALL FOR PAPERS
extended deadline
Symposium
Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021)
13 - 17 December 2021, online
https://staff.math.su.se/rloukanova/LACompLing2021-web/
LACompLing2021 is part of the week
Mathematical Linguistics (MALIN) 2021,
Université de Montpellier (UM),
Montpellier, France,
13 - 17 December 2021, Online
DESCRIPTION of LACompLing
Computational linguistics studies natural language in its various
manifestations from a computational point of view, both on the theoretical
level (modeling grammar modules dealing with natural language form and
meaning, and the relation between these two) and on the practical level
(developing applications for language and speech technology). Right from
the start in the 1950s, there have been strong links with computer science,
logic, and many areas of mathematics - one can think of Chomsky's
contributions to the theory of formal languages and automata, or Lambek's
logical modeling of natural language syntax. The symposium assesses the
place of logic, mathematics, and computer science in present day
computational linguistics. It intends to be a forum for presenting new
results as well as work in progress.
SCOPE of LACompLing
The symposium focuses mainly on logical approaches to computational
processing of natural language, and on the applicability of methods and
techniques from the study of artificial languages (programming/logic) in
computational linguistics. We invite participation and submissions from
other relevant approaches too, especially if they can inspire new work and
approaches.
The topics of LACompLing2021 include, but are not limited to:
- Computational theories of human language
- Computational syntax
- Computational semantics
- Computational syntax-semantics interface
- Interfaces between morphology, lexicon, syntax, semantics, speech, text,
pragmatics
- Computational grammar
- Logic and reasoning systems for linguistics
- Type theories for linguistics
- Models of computation and algorithms for linguistics
- Computational approaches of computational linguistics for domain specific
areas
- Language processing
- Parsing algorithms
- Generation of language from semantic representations
- Large-scale grammars of natural languages
- Multilingual processing
- Computational theories and systems of reasoning in natural language
- Data science in language processing
- Machine learning of language
- Interdisciplinary methods
- Integration of formal, computational, model theoretic, graphical,
diagrammatic, statistical, and other related methods
- Logic for information extraction or expression in written and / or spoken
language
- Language theories based on biological fundamentals of information and
languages
- Computational neuroscience of language
LACompLing2021 is especially interested in topics on the interconnections
between Logic, Language, and Argumentation, e.g.:
- Formal languages of reasoning and argumentation
- Algorithms related to natural language of argumentation - theories,
implementations, applications
- Formal models of argumentations
- Logic of preferences
- Beliefs, attitudes, persuasions - theories and applications
IMPORTANT DATES
Extended Submission and Notification
Submission: 14 November 2021 (was 30 October 2021)
Notification: 21 November 2021 (was 6 November 2021)
Final submissions: TBA ??
LACompLing2021: 13 - 17 December 2021
SUBMISSION INSTRUCTIONS
We welcome submissions of abstracts of presentations of original work. The
intended papers should not be submitted concurrently to another conference
or conference event and should not have been published or submitted for
publication consideration elsewhere.
NOTE: We will not accept submissions that are on work submitted to another
event at MALIN 2021, concurrently during the submission to LACompLing2021.
- Submission of abstracts of presentations:
limited to 1 page, including the title, other heading material, about half
of a page text, and references
- Authors can submit more than one abstract. Invited speakers can submit
invited and contributed abstracts
- The camera-ready submissions may require all the necessary typesetting
sources, which are not in the standard LaTeX distribution
Typesetting Instructions
For LaTeX, authors are required to use Springer LNCS package. Styles and
templates can be downloaded from Springer, for LaTeX (recommended!) and
Microsoft Word:
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…
For bibliography citations, please use BibTeX with:
\bibliographystyle{spmpsci}
SUBMISSIONS
The submission Web page for LACompLing2021 is:
https://easychair.org/conferences/?conf=lacompling2021
PUBLICATIONS
We will organize a post-conference, special volume after the symposium
LACompLing2021, for publication of extended papers based on accepted
abstracts with presentations at LACompLing2021. The submissions to the
special volume have to be original, unpublished, and not concurrently
submitted elsewhere. They will go through thorough peer reviews.
ORGANIZATION of LACompLing2021
CHAIRS of LACompLing2021
Roussanka Loukanova, IMI, BAS, Sofia, Bulgaria and Stockholm University,
Stockholm, Sweden
Reinhard Muskens, ILLC, Universiteit van Amsterdam, Amsterdam, The
Netherlands
PROGRAM CHAIRS of LACompLing2021
Roussanka Loukanova, IMI, BAS, Sofia, Bulgaria and Stockholm University,
Stockholm, Sweden
Richard Moot, LIRMM-CNRS, Montpellier, France
Christian Retoré, Université de Montpellier and LIRMM-CNRS, Montpellier,
France
ORGANISATION of LACompLing2021 at Stockholm University
Peter LeFanu Lumsdaine, Stockholm University, Stockholm, Sweden (local
organiser, publication chair)
Axel Ljungström, Stockholm University, Stockholm, Sweden (local organiser,
publication associate)
Roussanka Loukanova, IMI, BAS, Sofia, Bulgaria and Stockholm University,
Stockholm, Sweden (chair)
Contact
LACompLing 2021 <lacompling2021(a)easychair.org>
--------------------------------
(Apologies for multiple copies of this announcement. Please circulate.)
---------------
Call for Location for FSCD 2023
The FSCD conference covers all aspects of Formal Structures for Computation and Deduction from theoretical foundations to applications. The annual FSCD conference comprises the main conference and a considerable number of affiliated workshops (expectedly, more than ten).
We invite proposals for locations to host the 8th FSCD International Conference to be held during the summer of 2023. Previous (and upcoming) FSCD meetings include:
FSCD 2016 in Porto (Portugal);
FSCD 2017 in Oxford (UK) co-located with ICFP 2017;
FSCD 2018 in Oxford (UK) as part of FLoC 2018;
FSCD 2019 in Dortmund (Germany);
FSCD 2020 in Paris (France) co-located with IJCAR 2020;
FSCD 2021 in Buenos Aires (Argentina);
FSCD 2022 in Haifa (Israel) as part of FLoC 2022.
The deadline for proposals is *** 22nd January 2022 ***. Proposals should be sent to the FSCD Steering Committee Chair (see contact information below). We encourage proposers to register their intention informally as soon as possible.
The proposals will be put forward to the FSCD mailing list for an indicative vote (the results of which will not be made public), after which the final decision about hosting and organising of FSCD 2023 will be taken by the SC.
Proposals should address the following points:
* FSCD Conference Chair (complete name and current position), host institution, FSCD Local Committee (complete names and current positions), availability of student-volunteers.
* National, regional, and local government and industry support, both organizational and financial.
* Accessibility to the location (i.e., transportation) and attractiveness of the proposed site. Accessibility can include both information about local transportation and travel information to the location (flight and/or train connections), as well as estimated costs.
* Appropriateness of the proposed dates (including consideration of holidays/other events during the period), hotel prices, and access to dormitory facilities for students.
* Estimated costs on registration for the conference and workshops, both for regular and student participants.
* Conference and exhibit facilities for the anticipated number of registrants (typically around 200). For example: number, capacity and audiovisual equipment of meeting rooms; a large plenary session room that can hold all the registrants; enough rooms for parallel sessions/workshops/tutorials; internet connectivity and workstations for demos/competitions; catering services; and presence of professional staff.
* Residence accommodations and food services in a range of price categories and close to the conference venue, for example, number and cost range of hotels, and availability and cost of dormitory rooms (e.g., at local universities) and kind of services they offer.
* Other relevant information, which can include information about leisure activities and attractiveness of the location (e.g., cultural and historical aspects, touristic activities, etc...).
Contact information:
Herman Geuvers
herman(a)cs.ru.nl
FSCD SC Chair
Grant: Helmut Veith Stipend for Female Master’s Students in Computer Science - Scholarship for women in mathematics/computer science – Annual Deadline: November 30
The Vienna Center for Logic and Algorithms (VCLA) invites applications for the Helmut Veith Stipend from motivated and outstanding female master's students who plan to pursue one of the programs in Computer Science at TU Wien taught in English in one of the following semesters:
- winter semester 2021/2022
- summer semester 2022
-------------------------------------------------------------
HELMUT VEITH STIPEND
-------------------------------------------------------------
The Helmut Veith Stipend is awarded annually to exceptionally talented and motivated female students in the field of computer science who pursue (or plan to pursue) one of the master's programs in Computer Science at TU Wien taught in English and have (or have the interest to develop) a solid mathematical and technical background in at least one of the areas in which Austrian scientist Helmut Veith worked.
The Helmut Veith Stipend is dedicated to the memory of Helmut Veith (1971-2016), an outstanding computer scientist who worked in the fields of logic in computer science, computer-aided verification, software engineering, and computer security. The Helmut Veith Stipend's fund is set up by the TU Wien (Vienna University of Technology), the Wolfgang Pauli Institute, and the colleagues and friends of the late Prof. Veith.
-------------------------------------------------------------
Award
-------------------------------------------------------------
Students who are awarded the Helmut Veith Stipend receive:
-EUR 6000 annually for a duration of up to two years.
-Waiver of all tuition fees at TU Wien.
-------------------------------------------------------------
Eligibility
-------------------------------------------------------------
1. Applicants must be eligible for admission to one of the master's programs in computer science at TU Wien that are taught in English. In 2021/2022 those are:
• Logic and Computation
• Business Informatics
• Computer Engineering
• Data Science
• Media and Human-Centered Computing
2. While applications for funding can be filed before or in parallel with the admissions process, the funding will only be awarded to applicants who have been unconditionally admitted to the master's program. An application for funding does not replace the admissions process; neither does a conditional offer of funding entitle the applicant to study at TU Wien.
3. Female students who meet the following conditions are eligible to apply for the stipend:
• Bachelor's degree in Computer Science or Mathematics (Bologna first cycle) or equivalent degree
• Extensive mathematical and technical knowledge and interest in (at least one of) Helmut Veith's areas of research:
-Logic in Computer Science
-Formal Methods and Verification
-Foundations of Artificial Intelligence
-Algorithms and Complexity Theory
-Computer Security
• Proficiency in English
-------------------------------------------------------------
Conditions
-------------------------------------------------------------
• Recipients of funding must be committed to demonstrating good progress during their studies, i.e.:
-obtain at least 25 ECTS credits from the respective master's curriculum per term on average since the beginning of their master's studies (the deadlines are April 30 for the winter term and November 30 for the summer term), and
-achieve a grade average of at most 1.5.
• Recipients of funding have to reside in Austria during term time for the duration of their studies. Exceptions and temporary interruptions of the stay during term time (e.g., for internships or research visits) are subject to approval.
• The stipend is provided for the duration of the master's program (subject to the conditions listed above), for up to 2 years.
-------------------------------------------------------------
Application Process
-------------------------------------------------------------
Students are required to submit the following documents:
• Cover Letter, describing the type of funding the student is applying for, and all other aspects the student deems relevant for the application
• Curriculum Vitae
• Motivation Letter, describing why the student wants to study in the program Logic and Computation, why funding is necessary, and with which groups of the faculty the student would be interested to work with during their master's thesis and why.
• Reports on university examinations (transcripts)
• Diplomas and/or certificates (first degree, bachelor degree, or higher). If the final academic certificate is not yet available at the time of the application deadline, a preliminary certificate (indicating the type of degree and the expected graduation date) signed and stamped by the degree-awarding university must be provided.
• Contact details of two referees (for letters of recommendation)
• English language certificate (TOEFL or similar)
• Copy of passport
A certified translation needs to be provided for documents that are not in German or English. Your application must be submitted electronically to master(a)logic-cs.at<mailto:master@logic-cs.at> with the subject "Application" as a single PDF document. The name of the PDF file needs to be "document.pdf"
-------------------------------------------------------------
Application Deadline
-------------------------------------------------------------
The annual deadline for applications is November 30.
-------------------------------------------------------------
Questions?
-------------------------------------------------------------
Further Information on the Stipend: http://www.vcla.at/helmut-veith-stipend
Please do not hesitate to contact master(a)logic-cs.at<mailto:master@logic-cs.at>
CALL FOR PAPERS
Thirty-Seventh Annual ACM/IEEE Symposium on
LOGIC IN COMPUTER SCIENCE (LICS)
August 2022
Part of Federated Logic Conference 2022 (Haifa)
https://lics.siglog.org/lics22https://floc2022.org/
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.
COVID-19 etc..
For people who cannot travel to Israel, the possibility of remote participation will be ensured.
IMPORTANT DATES
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: 17 January 2022
Full Papers Due: 21 January 2022
Author Feedback/Rebuttal Period: 10-13 March 2022
Author Notification: 14 April 2022
Conference: 2-5 August 2022 (tentative)
FLOC: 31 July - 12 August 2022.
Submission deadlines are firm; late submissions will not be considered. All submissions will be electronic via https://www.easychair.org/conferences/?conf=lics2022.
SUBMISSION INSTRUCTIONS
Every full paper must be submitted in the ACM SIGPLAN 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/lics22/cfp.php.
LICS 2022 will use a lightweight double-blind reviewing process. Following this process means that reviewers will not see the authors’ names or affiliations as they initially review a paper. The authors’ names will then be revealed to the reviewers only once their reviews have been submitted. Please see the website for further details and requirements from the double-blind process.
LICS DISTINGUISHED PAPERS (NEW)
Around 10% of accepted LICS papers will be selected as distinguished papers. These are papers that, in the view of the LICS programme committee, make exceptionally strong contribution to the field and should be read by a broad audience due their relevance, originality, significance and clarity.
KLEENE AWARD FOR BEST STUDENT PAPER
An award in honour of the late Stephen C. Kleene will be given for the best student paper(s), as judged by the program committee.
SPECIAL ISSUES
Full versions of up to three accepted papers, to be selected by the program committee, will be invited for submission to the Journal of the ACM. Additional selected papers will be invited to a special issue of Logical Methods in Computer Science.
PUBLICATION
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.
von Havelund, Klaus (US 348B) via fm-announcements
NFM 2022 - SECOND CALL FOR PAPERS
The 14th NASA Formal Methods Symposium
https://gcc02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnfm2022.c…
May 24-27, 2022
Pasadena, California, USA
The symposium is planned to be held in person at California Institute of Technology, but potentially transitioning to fully virtual if the COVID situation persists. Virtual presentations will be possible even if the conference is held in-person.
The symposium has NO registration fee for presenting and attending.
IMPORTANT DATES
- Abstract Submission: December 3, 2021
- Paper Submission: December 10, 2021
- Paper Notifications: February 4, 2022
- Camera-ready Papers: March 4, 2022
- Symposium: May 24-27, 2022
THEME OF SYMPOSIUM
The widespread use and increasing complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry requires advanced techniques that address these systems' specification, design, verification, validation, and certification requirements. The NASA Formal Methods Symposium (NFM) is a forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry. NFM's goals are to identify challenges and to provide solutions for achieving assurance for such critical systems. The focus of the symposium will be on formal/rigorous techniques for software assurance, including their theory, current capabilities and limitations, as well as their potential application to aerospace during all stages of the software life-cycle.
The NASA Formal Methods Symposium is an annual event organized by the NASA Formal Methods (NFM) Research Group, composed of researchers spanning six NASA centers. The organization of NFM 2022 is being led by the Jet Propulsion Laboratory (JPL), located in Pasadena, California.
TOPICS ON INTEREST
Topics of interest include, but are not limited to, the following aspects of formal methods:
Advances in formal methods
- Interactive and automated theorem proving
- SMT and SAT solving
- Model checking
- Static analysis
- Runtime verification
- Automated testing
- Specification languages, textual and graphical
- Refinement
- Code synthesis
- Design for verification and correct-by-design techniques
- Requirements specification and analysis
Integration of formal methods techniques
- Integration of diverse formal methods techniques
- Use of machine learning and probabilistic reasoning techniques in formal methods
- Integration of formal methods into software engineering practices
- Combination of formal methods with simulation and analysis techniques
- Formal methods and fault tolerance, resilient computing, and self healing systems
- Formal methods and graphical modeling languages such as SysML, UML, MATLAB/Simulink
- Formal methods and autonomy, e.g., verification of systems and languages for planning and scheduling
(PDDL, Plexil, etc.), self-sufficient systems, and fault-tolerant systems.
Formal methods in practice
- Experience reports of application of formal methods on real systems, such as autonomous systems, safety-critical
systems, concurrent and distributed systems, cyber-physical, embedded, and hybrid systems, fault-detection,
diagnostics, and prognostics systems, and human-machine interaction analysis.
- Use of formal methods in systems engineering (including hardware components)
- Use of formal methods in education
- Reports on negative results in the development and the application for formal methods in practice.
- Usability of formal method tools, and their infusion into industrial contexts.
- Challenge problems for future reference by the formal methods community. The formulation of these papers can range
from plain English description of a problem over formal specifications, to specific implementations in a
programming language.
NASA OPEN SOURCE
Courageous authors, who want to delve in open source software being applied in real NASA missions, and find possible connections to and applications of Formal Methods, are invited to visit the open source repositories for the following two frameworks for programming flight software:
- F’ (https://gcc02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnasa.gith…)
- cFS (https://cfs.gsfc.nasa.gov/)
SUBMISSIONS
There are two categories of submissions:
- Regular papers describing fully developed work and complete results
(maximum 15 pages, excluding references);
- Short papers on tools, experience reports, or work in progress with preliminary results
(maximum 6 pages, excluding references).
Additional appendices can be submitted as supplementary material for reviewing purposes. They will not be included in the proceedings.
All papers must be in English and describe original work that has not been published.
All submissions will be reviewed by at least three members of the Program Committee. Reviewing is Single-blind.
We encourage authors to focus on readability of their submissions.
Papers will appear in the Formal Methods subline of Springer's Lecture Notes in Computer Science (LNCS) and must use LNCS style formatting (https://gcc02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fwww.sprin…);reserved=0). Papers must be submitted in PDF format at the EasyChair submission site:
https://gcc02.safelinks.protection.outlook.com/?url=https%3A%2F%2Feasychair…p;reserved=0.
Authors of selected best papers will be invited to submit an extended version to a special issue in Springer's Innovations in Systems and Software Engineering: A NASA Journal (https://gcc02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fwww.sprin…);reserved=0).
ARTIFACTS
Authors are encouraged, but not strictly required, to submit artifacts that support the conclusions of their work (if allowed by their institutions). Artifacts may contain software, mechanized proofs, benchmarks, examples, case studies and data sets. Artifacts will be evaluated by the Program Committee together with the paper.
ORGANIZERS
PC chairs
- Klaus Havelund, JPL, USA
- Jyo Deshmukh, USC, USA
- Ivan Perez, NIA, USA
Application Advisors
- Robert Bocchino, JPL, USA
- John Day, JPL, USA
- Maged Elasaar, JPL, USA
- Amalaye Oyake, Blue Origin, USA
- Nicolas Rouquette, JPL, USA
- Vandi Verma, JPL, USA
Application advisors advise the PC chairs to ensure a strong connection to the problems facing NASA.
Local Organizer
- Richard Murray, Caltech, USA
Scientific Advisor
- Mani Chandy, Caltech, USA
Program Committee
- Aaron Dutle, NASA, USA
- Alessandro Cimatti, Fondazione Bruno Kessler, Italy
- Anastasia Mavridou, SGT Inc. / NASA Ames Research Center, USA
- Anne-Kathrin Schmuck, Max-Planck-Institute for Software Systems, Germany
- Arie Gurfinkel, University of Waterloo, Canada
- Bardh Hoxha, Toyota Research Institute North America, USA
- Bernd Finkbeiner, CISPA Helmholtz Center for Information Security, Germany
- Betty H.C. Cheng, Michigan State University, USA
- Borzoo Bonakdarpour, Michigan State University, USA
- Carolyn Talcott, SRI International, USA
- Chuchu Fan, MIT, USA
- Constance Heitmeyer, Naval Research Laboratory, USA
- Corina Pasareanu, CMU, NASA, KBR, USA
- Cristina Seceleanu, Mälardalen University, Sweden
- Dejan Nickovic, Austrian Institute of Technology AIT, Austria
- Dirk Beyer, LMU Munich, Germany
- Doron Peled, Bar Ilan University, Israel
- Erika Abraham, RWTH Aachen University, Germany
- Ewen Denney, NASA, USA
- Gerard Holzmann, Nimble Research, USA
- Giles Reger, The University of Manchester, UK
- Huafeng Yu, TOYOTA InfoTechnology Center USA, USA
- Jean-Christophe Filliatre, CNRS, France
- Johann Schumann, NASA, USA
- John Day, Jet Propulsion Laboratory, USA
- Julia Badger, NASA, USA
- Julien Signoles, CEA LIST, France
- Kerianne Hobbs, Air Force Research Laboratory, USA
- Kristin Yvonne Rozier, Iowa State University, USA
- Leonardo Mariani, University of Milano Bicocca, Italy
- Lu Feng, University of Virginia, USA
- Marcel Verhoef, European Space Agency, The Netherlands
- Marie Farrell, Maynooth University, Ireland
- Marieke Huisman, University of Twente, The Netherlands
- Marielle Stoelinga, University of Twente, The Netherlands
- Martin Feather, Jet Propulsion Laboratory, USA
- Martin Leucker, University of Luebeck, Germany
- Michael Lowry, NASA, USA
- Misty Davies, NASA, USA
- Natasha Neogi, NASA, USA
- Nicolas Rouquette, Jet Propulsion Laboratory, USA
- Nikos Arechiga, Toyota Research Institute, USA
- Rajeev Joshi, Amazon Web Services, USA
- Stanley Bak, Stony Brook University, USA
- Sylvie Boldo, INRIA, France
- Vandi Verma, NASA, USA
- Willem Visser, Amazon Web Services, USA
CONTACT
Email: nfm2022 [at] easychair [dot] org
---
To opt-out from this mailing list, send an email to
fm-announcements-request(a)lists.nasa.gov
with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting
fm-announcements-owner(a)lists.nasa.gov
***Apologies for multiple receptions of this message***
==================================
ICALP 2022 - First 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: TBA
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