HCVS 2017: 4th Workshop on Horn Clauses for Verification and Synthesis

Workshop affiliated with CADE 2017

CADE 2017

August 7, 2017 · Gothenburg, Sweden
Local info and registration via CADE

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), 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 three previous meetings: HCVS 2016 in Eindhoven, The Netherlands (ETAPS), HCVS 2015 in San Francisco, CA, USA (CAV), and HCVS 2014 in Vienna, Austria (VSL).


9:00 - 9:05 Welcome (Alberto Griggio and Manuel Hermenegildo)
9:05 - 10:00 Invited talk: Christoph Weidenbach
  The Role of Horn Clauses in Automatic Reasoning. 
  Session chair: Alberto Griggio
10:00 - 10:30 Coffee Break 
  Paper session 1 - Session chair: Philipp Rümmer
10:30 - 11:00 Satoshi Matsuoka  
  Direct Encodings of NP-Complete Problems into Horn Sequents of Multiplicative Linear Logic (slides).  
11:00 - 11:30 Toby Cathcart Burn, Luke Ong, and Steven Ramsay  
  Higher-Order Constrained Horn Clauses and Refinement Types (slides).  
11:30 - 12:00 Alexey Bakhirkin and David Monniaux  
  Combining Forward and Backward Abstract Interpretation of Horn Clauses. 
12:00 - 14:00 Lunch Break 
14:00 - 15:00 Invited talk: Arie Gurfinkel
  Solving Constrained Horn Clauses by Property Directed Reachability (slides).
  Session chair: Manuel Hermenegildo
15:00 - 15:30 Coffee Break 
  Paper session 2 - Session chair: John Gallagher
15:30 - 16:00 Maximiliano Cristia, Gianfranco Rossi, and Claudia Frydman  
  Using a Set Constraint Solver for Program Verification  (slides).
16:00 - 16:30 Temesghen Kahsai, Rody Kersten, Philipp Rümmer, and Martin Schäf  
  Quantified Heap Invariants for Object-Oriented Programs. 
16:30 - 17:00 Open discussion:  
  Should we have a Constrained Horn Clauses competition?

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.

Invited Speakers

Important Dates (tentative)

   Paper submission:    June 11, 2017 Extended: June 18, 2017
   Paper notification:    July 3, 2017
   Workshop:    August 7, 2017

Program Chairs

Program Committee


Submission has to be done in one of the following formats:
  • Regular papers (up to 12 pages plus bibliography, typeset in EPTCS format), which should present previously unpublished work (completed or in progress), including descriptions of research, tools, and applications.
  • 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 refereed by the program committee and will be selected for inclusion in accordance with the referee reports.

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://www.easychair.org/conferences/?conf=hcvs2017


Microsoft Research         Association for Logic Programming         IMDEA Software Institute

Hosted by the IMDEA Software Institute | Based on the EasyChair Smart Program