ETAPS 2019 (series) / ESOP 2019 (series) / ESOP 2019 /
Coinduction in Uniform: Foundations for Corecursive Proof Search with Horn Clauses
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 AprDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
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 30mTalk | Data-Races and Static Analysis for Interrupt-Driven Kernels ESOP Link to publication | ||
11:00 30mTalk | An abstract domain for trees with numeric relations ESOP Link to publication | ||
11:30 30mTalk | A static higher-order dependency pair framework ESOP Link to publication | ||
12:00 30mTalk | 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 |