ETAPS 2019
Sat 6 - Thu 11 April 2019 Prague, Czech Republic

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

This workshop aims to bring together researchers working in the communities of Automated Deduction (e.g CADE), 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 communities in different times and from different perspectives and this workshop is organized to stimulate interaction and a fruitful exchange and integration of experiences.

Call for Papers

This is a placeholder text.

You can expect more information about the call for papers soon.

This page will have information about the submission and selection process and list the important dates.