HCVS 2019 - 6th Workshop On Horn Clauses For Verification And ...

Many Program Verification and Synthesis problems of interest can be modeled directly using Horn clauses, and many recent advances in the Constraint/Logic Programming, Verification, and Automated Deduction communities have centered around efficiently solving problems presented as Horn clauses.

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

Horn clauses have been advocated by these communities at different times and from different perspectives, and this workshop is organized to stimulate interaction and a fruitful exchange and integration of experiences.

The workshop follows five previous meetings: HCVS 2018 in Oxford, UK (FLoC), HCVS 2017 in Gothenburg, Sweden (CADE), HCVS 2016 in Eindhoven, The Netherlands (ETAPS), HCVS 2015 in San Francisco, CA, USA (CAV), and HCVS 2014 in Vienna, Austria (VSL).

HCVS 2019 will host the 2nd CHC competition (CHC-COMP), which will compare state-of-the-art tools for CHC solving for performance and effectiveness on a set of publicly available benchmarks. More information can be found here.

Accepted Papers

Title
Challenges in the specialisation of smart Horn clause interpretersHCVSJohn P. Gallagher File Attached
Coinduction in Uniform: what's next?HCVSHenning Basold, Ekaterina Komendantskaya Link to publication
Decomposing Farkas InterpolantsHCVSMartin Blicha, Antti Hyvärinen, Jan Kofroň, Natasha Sharygina File Attached
HoCHC: A Refutationally Complete and Semantically Invariant System of Higher-order Logic Modulo TheoriesHCVSC.-H. Luke Ong, Dominik Wagner Pre-print File Attached
Proving Properties of Sorting Programs: A Case Study in Horn Clause VerificationHCVSEmanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti File Attached
Ultimate TreeAutomizerHCVSDaniel Dietsch, Matthias Heizmann, Jochen Hoenicke, Alexander Nutz, Andreas Podelski

Call for Papers

Many Program Verification and Synthesis problems of interest can be modeled directly using Horn clauses, and many recent advances in the Constraint/Logic Programming, Verification, and Automated Deduction communities have centered around efficiently solving problems presented as Horn clauses.

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

Horn clauses have been advocated by these communities at different times and from different perspectives, and this workshop is organized to stimulate interaction and a fruitful exchange and integration of experiences.

The workshop follows five previous meetings: HCVS 2018 in Oxford, UK (FLoC), HCVS 2017 in Gothenburg, Sweden (CADE), HCVS 2016 in Eindhoven, The Netherlands (ETAPS), HCVS 2015 in San Francisco, CA, USA (CAV), and HCVS 2014 in Vienna, Austria (VSL).

Aims and Scope

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)
  • Program synthesis
  • Program testing
  • Program transformation
  • Constraint solving
  • Type systems
  • 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 that are of interest to the workshop.

CHC-COMP

HCVS 2019 will host the 2nd CHC competition (CHC-COMP), which will compare state-of-the-art tools for CHC solving for performance and effectiveness on a set of publicly available benchmarks. More information can be found here. All participants of CHC-COMP are invited (but not obliged) to submit a tool description for publishing either online or at the proceedings through the EasyChair system for HCVS (the HCVS deadlines apply).

Submission

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

  • Regular papers (up to 12 pages plus bibliography in EPTCS format), which should present previously unpublished work (completed or in progress), including descriptions of research, tools, and applications.
  • Tool papers (up to 4 pages plus bibliography 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.

All submitted papers will be reviewed by the program committee and will be selected for inclusion in accordance with the referee reports. Accepted papers will be made available before the workshop on the HCVS website and will be published in a volume of the Electronic Proceedings in Theoretical Computer (EPTCS) series after the workshop (provided that enough regular and tool papers are accepted). Authors of accepted papers are required to ensure that at least one of them will be present at the workshop.

Papers must be submitted through the EasyChair system using the web page: https://easychair.org/conferences/?conf=hcvs2019

Từ khóa » H C V S