ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

ADSL 2018 - First Workshop on Automated Deduction for Separation Logics (ADSL)

Date2018-07-07 - 2018-07-09

Deadline2018-05-10

VenueOxford, UK - United Kingdom UK - United Kingdom

Keywords

Websitehttps://www.floc2018.org/workshops

Topics/Call fo Papers

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.

Last modified: 2017-12-13 10:07:59