HCVS 2015: Horn Clauses for Verification and Synthesis

July 19, 2015 · San Francisco, USA

Call for papers     ( Programme)

Most 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 workshop aims to bring together researchers working in the two communities of Constraint/Logic Programming (e.g., ICLP and CP) and Program Verification community (e.g., CAV, TACAS, and VMCAI) on the topic of Horn clause based analysis, verification and synthesis.

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

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 in various programming paradigms (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 and presentations covering previously published results that are of interest to the workshop.

Invited speakers

Program Committee

Important Dates

  • Paper submission: May 22, 2015 May 28, 2015
  • Paper notification: June 10, 2015
  • Paper presentation: July 19, 2015 · San Francisco, USA


  • Submission Format: up to 12 pages plus bibliography for regular papers and 1 to 3 pages (for work-in-progress), both in EPTCS format.
  • Original accepted papers will be published electronically as a volume in the Electronic Proceedings in Theoretical Computer Science (EPTCS) series, see http://www.eptcs.org/
  • 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=hcvs2015


The workshop will be held on July 19 in San Francisco, California, at the Grand Hyatt in Union Square. The room will be Warfield.


8:45 - 9:00 Welcome
Session chair :Andrey Rybalchenko  
9:00 - 9:30 Daniel Schwartz-Narbonne, Martin Schäf, Philipp Ruemmer, Ashish Tiwari and Thomas Wies  
  Non-Monotonic Program Analysis  
9:30 - 10:00 Rémy Haemmerlé, Manuel V. Hermenegildo, Maximiliano Klemen, Umer Liqat and Pedro López-García 
  Energy Analysis and Verification by Translation to Horn Clauses and Abstract Interpretation 
10:00 - 10:30 Break 
Session chair: Nikolaj Bjorner  
10:30 - 11:00 Subash Shankar and Neng-Fa Zhou 
  Toward an Efficient Modelling Language for State Machines 
11:00 - 12:00 Joxan Jaffar 
  Invited talk:Horn Clauses for Data Structures  
12:00 - 13:30 Lunch 
Session chair: Manuel Hermenegildo  
13:30 - 14:30 Ranjit Jhala 
  Invited talk: Modular Specification and Verification with Horn Clauses 
14:30 - 15:00 Grigory Fedyukovich, Arie Gurfinkel and Natasha Sharygina 
  AE-VAL: Horn clause-based Skolemizer for forall-exists formulas 
15:00 - 15:30 Break 
Session chair: Temesghen Kashai  
15:30 - 16:00 Andrew Reynolds, Morgan Deters, Viktor Kuncak, Cesare Tinelli and Clark Barrett 
  CounterExample-Guided Quantifier Instantiation for Synthesis in SMT 
16:00 - 16:30 Neda Saeedloei and Gopal Gupta 
  Model Checking Timed LTL: A Logic Programming-based Approach  
16:30 - 17:00 Benchmarks discussion 




Last update: Arie Gurfinkel 25/12/2014

Disclaimer | Based on the EasyChair Smart Program