[TYPES/announce] HCVS 2023 - Last Call for Papers

[Jose F. Morales]

10th Workshop on Horn Clauses for Verification and Synthesis (HCVS)
Co-located with ETAPS 2023

23rd April 2023 - Paris, France

https://urldefense.com/v3/__https://www.sci.unich.it/hcvs23/__;!!IBzWLUs!Q8Gbv9mIOlmII4R_otgR2m30hWOYeiRun8xfos7_cd4qixc-QEcAHfSWgCseZxfzZAosz4mUlhEltkEFrf2-muhi6xRVsnlWpGPHPQ$ 

Important dates:

 - Paper submission deadline: Feb 22, 2023
 - Paper notification: Mar 22, 2023
 - Workshop: Apr 23, 2023

Many Program Verification and Synthesis problems of interest can be
modeled directly using Horn clauses and many recent advances in the
CLP and CAV communities have centered around efficiently solving
problems presented as Horn clauses.

This series of workshops aims to bring together researchers working in
the two communities of Constraint/Logic Programming (e.g., ICLP and
CP), Program Verification (e.g., CAV, TACAS, and VMCAI), and Automated
Deduction (e.g., CADE, IJCAR), on the topic of Horn clause based
analysis, verification, and synthesis.

Horn clauses for verification and synthesis have been advocated by
these communities in different times and from different perspectives
and HCVS is organized to stimulate interaction and a fruitful exchange
and integration of experiences.

The workshop follows previous meetings: HCVS 2022 in Munich, Germany
(ETAPS 2022), HCVS 2021, online (ETAPS 2021), HCVS 2020, online (ETAPS
2020), HCVS 2019 in Prague, Czech Republic (ETAPS 2019), HCVS 2018 in
Oxford, UK (CAV, ICLP and IJCAR at FLoC 2018), HCVS 2017 in
Gothenburg, Sweden (CADE 2017), HCVS 2016 in Eindhoven, The
Netherlands (ETAPS 2016), HCVS 2015 in San Francisco, CA, USA (CAV
2015), and HCVS 2014 in Vienna, Austria (VSL).

Topics of interest include, but are not limited to the use of Horn
clauses, constraints, and related formalisms in the following areas:

 - Analysis and verification of programs and systems of various kinds
   (e.g., imperative, object-oriented, functional, logic, higher-order,
   concurrent, transition systems, petri-nets, smart contracts)
 - Program synthesis
 - Program testing
 - Program transformation
 - Constraint solving
 - Type systems
 - Machine learning and automated reasoning
 - CHC encoding of analysis and verification problems
 - Resource analysis
 - Case studies and tools
 - Challenging problems

We solicit regular papers describing theory and implementation of
Horn-clause based analysis and tool descriptions. We also solicit
extended abstracts describing work-in-progress, as well as
presentations covering previously published results, extended
abstracts of doctoral theses, and overviews of research projects that
are of interest to the workshop.

At least one author of each accepted paper will be required to attend
the workshop to present the contribution.

CHC Competition:

HCVS 2023 will host the 6th competition on constraint Horn clauses
(CHC-COMP https://urldefense.com/v3/__https://chc-comp.github.io/__;!!IBzWLUs!Q8Gbv9mIOlmII4R_otgR2m30hWOYeiRun8xfos7_cd4qixc-QEcAHfSWgCseZxfzZAosz4mUlhEltkEFrf2-muhi6xRVsnn3Q7-y8g$  ), which will compare
state-of-the-art tools for CHC solving for performance and
effectiveness on a set of publicly available benchmarks. A report on
CHC-COMP will be part of the workshop's proceedings. The report also
contains tool descriptions of the participating solvers.

Program Chairs:

David Monniaux, VERIMAG, CNRS, Grenoble, France
José F. Morales, IMDEA Software, Madrid, Spain

Program Committee:

Nikolaj Bjørner, Microsoft, USA
Evelyne Contejean, LRI, CNRS, Univ Paris-Sud, France
Stefania Dumbrava, ENSIIE Paris-Evry, France
Fabio Fioravanti, University of Chieti-Pescara, Italy
Pierre-Loic Garoche, ENAC, France
Dejan Jovanović, Amazon Web Services, USA
Ekaterina Komendantskaya, Heriot-Watt University, UK
Jorge A. Navas, Certora, USA
Philipp Rüemmer, Uppsala University, Sweden
Hiroshi Unno, University of Tsukuba, Japan

Submission has to be done in one of the following formats:

 - Regular papers (up to 12 pages plus bibliography in EPTCS
   (https://urldefense.com/v3/__http://www.eptcs.org/__;!!IBzWLUs!Q8Gbv9mIOlmII4R_otgR2m30hWOYeiRun8xfos7_cd4qixc-QEcAHfSWgCseZxfzZAosz4mUlhEltkEFrf2-muhi6xRVsnmaRTPafA$ ) format), which should present previously
   unpublished work (completed or in progress), including descriptions
   of research, tools, and applications.

 - Tool papers (up to 4 pages in EPTCS format), including the papers
   written by the CHC-COMP participants, which can outline the
   theoretical framework, the architecture, the usage, and experiments
   of the tool.

 - Extended abstracts (up to 3 pages in EPTCS format), which describe
   work in progress or aim to initiate discussions.

 - **Presentation-only papers**, i.e., papers already submitted or
   presented at a conference or another workshop. Such papers can be
   submitted in any format, and will not be included in the workshop
   post-proceedings.

 - Posters that are of interest to the workshop

All submitted papers will be refereed by the program committee and
will be selected for inclusion in accordance with the referee
reports. Accepted regular papers and extended abstracts will be
published electronically as a volume in the Electronic Proceedings in
Theoretical Computer Science (EPTCS) series, see https://urldefense.com/v3/__http://www.eptcs.org/__;!!IBzWLUs!Q8Gbv9mIOlmII4R_otgR2m30hWOYeiRun8xfos7_cd4qixc-QEcAHfSWgCseZxfzZAosz4mUlhEltkEFrf2-muhi6xRVsnmaRTPafA$ 
(provided that enough regular papers are accepted).  The publication
of a paper is not intended to preclude later publication.  Full
versions of extended abstracts published in EPTCS, or substantial
revisions, may later be published elsewhere.

Papers must be submitted through the EasyChair system using the web
page: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=hcvs2023__;!!IBzWLUs!Q8Gbv9mIOlmII4R_otgR2m30hWOYeiRun8xfos7_cd4qixc-QEcAHfSWgCseZxfzZAosz4mUlhEltkEFrf2-muhi6xRVsnmZXwd9fA$ 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://LISTS.SEAS.UPENN.EDU/pipermail/types-announce/attachments/20230217/34dc94e5/attachment-0001.htm>