==============================
CONCUR 2022: second call for papers
==============================
September 13-16, 2022 at the University of Warsaw, Poland
Website: https://concur2022.mimuw.edu.pl/
Co-located with QEST, FORMATS, FMICS (under the joint name CONFEST)
The purpose of CONCUR 2022, the 33rd International Conference on Concurrency Theory, is to bring together researchers, developers, and students in order to advance the theory of concurrency, and promote its applications.
IMPORTANT NOTE CONCERNING THE COVID-19 PANDEMIC
CONCUR 2022 is planned as a physical, in-person event, with certain support for remote presence, both for speakers and for other participants who are unable or unwilling to come. Depending on the pandemic situation, we may have to make a decision whether to cancel the physical component of the event or not. This should be definitely decided by the end of June 2022.
INVITED SPEAKERS
Wojciech Czerwiński, University of Warsaw, Poland
Philippa Gardner, Imperial College London, UK
Rupak Majumdar, Max Planck Institute for Software Systems, Germany
Sergio Rajsbaum, Universidad Nacional Autonoma de Mexico, Mexico
CO-LOCATED CONFERENCES
19th International Conference on Quantitative Evaluation of SysTems (QEST 2022)
20th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2022)
27th International Conference on Formal Methods for Industrial Critical Systems (FMICS 2022)
Website: https://concur2022.mimuw.edu.pl/
IMPORTANT DATES (all dates are AoE)
Abstract Submission: April 18, 2022
Paper Submission: April 25, 2022
Author Response: June 6-8, 2022
Notification: June 25, 2022
Camera Ready: July 9, 2022
Conference(s): September 13-16, 2022
Workshops: September 12 and 17, 2022
PAPER SUBMISSION
CONCUR 2022 solicits high quality papers reporting research results and/or experience related to the topics mentioned below. All papers must be original, unpublished, and not submitted for publication elsewhere.
Each paper will undergo a thorough review process. The paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee.
The CONCUR 2022 proceedings will be published by LIPIcs.
Papers must be submitted electronically as PDF files via EasyChair:
https://easychair.org/conferences?conf=concur2022
Papers must not exceed 14 pages (excluding references and clearly marked appendices) using the LIPIcs style.
TOPICS
Submissions are solicited in semantics, logics, verification and analysis of concurrent systems. The principal topics include (but are not limited to):
* Basic models of concurrency such as abstract machines, domain-theoretic models, game-theoretic models, process algebras, graph transformation systems, Petri nets, hybrid systems, mobile and collaborative systems, probabilistic systems, real-time systems, biology-inspired systems, and synchronous systems;
* Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics;
* Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving, type systems, and security analysis;
* Distributed algorithms and data structures: design, analysis, complexity, correctness, fault tolerance, reliability, availability, consistency, self-organization, self-stabilization, protocols;
* Theoretical foundations of architectures, execution environments, and software development for concurrent systems such as geo-replicated systems, communication networks, multiprocessor and multi-core architectures, shared and transactional memory, resource management and awareness, compilers and tools for concurrent programming, programming models such as component-based, object- and service-oriented.
AWARDS
In 2022, CONCUR Test-of-Time and best paper awards will be given for the third time. The winners will be announced at the conference.
ORGANIZATION COMMITTEE
Lorenzo Clemente (workshop chair)
Piotrek Hofman
Bartek Klin
Sławek Lasota
Radek Piórkowski (webmaster)
PROGRAM COMMITTEE
C. Aiswarya, Chennai Mathematical Institute, India
S. Akshay, IIT Bombay, India
Shaull Almagor, Technion, Israel
Nathalie Bertrand, INRIA, France
Ilaria Castellani, INRIA, France
Constantin Enea, IRIF, Université de Paris, France
Bernd Finkbeiner, CISPA Helmholtz Center for Information Security, Germany
Blaise Genest, CNRS, France
Rob van Glabbeek, CSIRO, Sydney, Australia
Daniele Gorla, University of Rome La Sapienza, Italy
Jean Goubault-Larrecq, ENS Paris-Saclay, France
Ichiro Hasuo, National Institute of Informatics, Japan
Marcin Jurdzinski, The University of Warwick, UK
Stefan Kiefer, University of Oxford, UK
Bartek Klin, University of Oxford, UK (co-chair)
Barbara König, University of Duisburg-Essen, Germany
Sławomir Lasota, University of Warsaw, Poland (co-chair)
Martin Leucker, University of Lübeck, Germany
Bas Luttik, Eindhoven University of Technology, The Netherlands
P. Madhusudan, University of Illinois at Urbana-Champaign, US
Hernan Melgratti, Universidad de Buenos Aires, Argentina
Anca Muscholl, Bordeaux University, France (co-chair)
Jan Otop, University of Wrocław, Poland
Joel Ouaknine, Max Planck Institute for Software Systems, Germany
Jean-François Raskin, Université libre de Bruxelles, Belgium
Grigore Rosu, University of Illinois at Urbana-Champaign, US
Jurriaan Rot, Radboud University, The Netherlands
Davide Sangiorgi, University of Bologna, Italy
Alexandra Silva, University College London, UK and Cornell University, US
Paweł Sobociński, Tallinn University of Technology, Estonia
Ana Sokolova, University of Salzburg, Austria
Alwen Tiu, The Australian National University, Australia
Frits Vaandrager, Radboud University, The Netherlands
Nobuko Yoshida, Imperial College London, UK
Lijun Zhang, Chinese Academy of Sciences, China
STEERING COMMITTEE
Javier Esparza, TU München, Germany (chair)
Pedro D’Argenio, National University of Cordoba, Argentina
Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands
Joost-Pieter Katoen, RWTH, Germany
Catuscia Palamidessi, INRIA and Ecole Polytechnique, France
Davide Sangiorgi, University of Bologna, Italy
Jiri Srba, Aalborg University, Denmark
apologies for multiple postings.
***********************************************************************
*********
VerifyThis Verification Competition 2022
CALL FOR PARTICIPATION -- TRAVEL GRANTS
Competition to be held at ETAPS 2022
http://verifythis.ethz.ch
***********************************************************************
*********
IMPORTANT DATES
Grant application deadline: March 7, 2022
Competition: April 2 and 3, 2022
ABOUT
VerifyThis 2022 is a program verification competition taking place as
part of the European Joint Conferences on Theory and Practice of
Software (ETAPS 2022) on April 2-3, 2022 in Munich, Germany.
It is the 10th event in the VerifyThis competition series.
The competition will offer a number of challenges presented in natural
language and pseudo code.
Participants have to formalize the requirements, implement a solution,
and formally verify the implementation for adherence to the
specification.
There are no restrictions on the programming language and verification
technology used.
The correctness properties posed in problems will have the input-output
behaviour of programs in focus. Solutions will be judged for
correctness, completeness, and elegance.
PARTICIPATION
Participation is open for anybody interested.
Teams of up to two people are allowed.
Registration for ETAPS workshops and physical presence on site is
required.
We particularly encourage participation of:
- student teams (this includes PhD students)
- non-developer teams using a tool someone else developed
- several teams using the same tool
TRAVEL GRANTS
The competition has funds for a limited number of travel grants.
A grant covers the incurred travel and accommodation costs up to a
certain limit. The expected limit is EUR 350 for those coming from
Europe and EUR 600 for those coming from outside Europe.
To apply for a travel grant, send an email to
verifythis(a)googlegroups.com by March 7, 2022. The application should
include:
- your name
- your affiliation
- the verification system(s) you plan to use at the competition
- the planned composition of your team (and whether you are
developers of the tools you'll be using)
- a short letter of motivation explaining your involvement with
formal verification so far
- if you are a student, please state the academic degree you are
seeking and have your supervisor send a brief letter of support to
verifythis(a)googlegroups.com
ORGANIZERS
* Marie Farrell, Maynooth University, Ireland
* Peter Lammich, University of Twente, The Netherlands
CONTACT
Email: verifythis(a)googlegroups.com
Web: http://verifythis.ethz.ch
The School of Computing here at Newcastle University is growing. We
are advertising *five* faculty positions at Lecturer / Senior Lecturer
levels (deadline on 27 February 2022):
https://jobs.ncl.ac.uk/job/Newcastle-LecturerSenior-Lecturer-in-Computing-S…
Two of these are specifically in the area of *formal methods*. Please
do not hesitate to reach out to me if you are interested in applying
and would like to learn more about the School.
Thanks, Sergiy
=================================================================
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)