ETAPS 2019
Sat 6 - Thu 11 April 2019 Prague, Czech Republic
Thu 11 Apr 2019 12:00 - 12:30 at SUN II - Program Analysis and Automated Verification Chair(s): Stephanie Balzer

We establish proof-theoretic, constructive and coalgebraic foundations for proof search in coinductive Horn clause theories. Operational semantics of coinductive Horn clause resolution is recast in terms of coinductive uniform proofs; its constructive content is exposed via soundness relative to an intuitionistic first-order logic with recursion controlled by the later modality; and soundness of both proof systems is proven relative to novel coalgebraic interpretation of complete Herbrand models.

Thu 11 Apr

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

10:30 - 12:30
Program Analysis and Automated VerificationESOP at SUN II
Chair(s): Stephanie Balzer Carnegie Mellon University
10:30
30m
Talk
Data-Races and Static Analysis for Interrupt-Driven Kernels
ESOP
Link to publication
11:00
30m
Talk
An abstract domain for trees with numeric relations
ESOP
Matthieu Journault , Antoine Miné UPMC, France, Abdelraouf Ouadjaout Sorbonne Université
Link to publication
11:30
30m
Talk
A static higher-order dependency pair framework
ESOP
Carsten Fuhs Birkbeck, University of London, Cynthia Kop Radboud University Nijmegen
Link to publication
12:00
30m
Talk
Coinduction in Uniform: Foundations for Corecursive Proof Search with Horn Clauses
ESOP
Henning Basold CNRS & ENS Lyon, Ekaterina Komendantskaya Heriot-Watt University, UK, Yue Li Heriot-Watt University, UK
Link to publication