First Workshop on Automated Deduction for Separation Logics (ADSL)
In recent times, program verification, and particularly deductive program verification, has made significant progress. This progress is in part due to the incorporation of logical backends such as SMT solvers and other automated theorem-proving technologies. In parallel to these developments, the verification of heap manipulating programs, and static analyses in particular, has met with substantial successes, largely due to the development of Separation Logics.
Separation Logics allow local reasoning by means of built-in spatial atoms (empty heap, points-to) and spatial connectives (separating conjunction and implication, also known as the star and the magic wand). Combining this power with induction/recursion allows
- writing elegant and concise specifications for a large class of recursive data structures, and,
- capturing the semantics of programs with pointer updates by rather simple Hoare-style calculi.
Such expressivity comes with the inherent difficulty of automating these logics. As a consequence, some deductive program verifiers based on separation logic do not offer automation for handling arbitrary recursive predicates. Other verifiers support inductive reasoning but with various compromises, such as restricted support for the ground theories, or tractability issues.
The goal of this workshop is to bring together academic researchers and industrial practitioners focused on improving the state of the art of automated deduction methods for Separation Logics. We will consider technical submissions presenting work on the following topics (the list is not exclusive):
- the integration of Separation Logics with SMT,
- proof search and automata-based decision procedures for Separation Logics and sister logics such as Bunched Implication Logic;
- computational complexity of logical problems such as satisfiability, entailment and abduction;
- 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.
All papers must be original and not simultaneously submitted to another journal or conference. The following paper categories are welcome:
Regular papers describing e.g. novel decision procedures, complexity results or applications for Separation Logic and related logics
Tool papers describing implementations of systems for e.g. theorem proving, satisfiability modulo theories or program analysis
Regular papers should have at most 20 pages written in LNCS format, not counting references and appendices. Tool papers are limited to 10 pages in LNCS format, not counting references. All papers must be submitted following this link.
ADSL2018 proceedings will be published in a special issue of Electronic Notes in Theoretical Computer Science.
Papers due: 20th of April 2018
Author notification: 18th of May 2018
Workshop: 13 July 2018
|James Brotherston||University College London|
|Stéphane Demri||CNRS, LSV, ENS Paris-Saclay|
|Nikos Gorogiannis||Middlesex University London|
|Christoph Haase||University of Oxford|
|Radu Iosif||VERIMAG, CNRS, University of Grenoble Alpes|
|Bart Jacobs||University of Leuven|
|Etienne Lozes||University of Nice|
|Daniel Méry||LORIA, Nancy|
|Peter O’Hearn||University College London, Facebook|
|Madhusudan Parthasarathy||University of Illinois|
|Nicolas Peltier||LIG, CNRS, University of Grenoble Alpes|
|Thomas Wies||Courant Institute, New York University|
As part of this workshop, we intend to organize a second edition of the Separation Logic Competition (SL-COMP) for solvers targeting fragments of Separation Logics. The first edition was held in 2014 as a spin-off of SMT-COMP and involved seven competitor tools running on a set of approximately 700 benchmarks.
|Mihaela Sighireanu||LIAFA, University of Paris Diderot|
|Radu Iosif||Nikos Gorogiannis|
|Université Grenoble Alpes (France)||Middlesex University (UK)|