Skip to main content

Coinduction for Verification and Certification

Searching for OpenAIRE data...

Publications

Regular Language Representations in the Constructive Type Theory of Coq

Author(s): Christian Doczkal, Gert Smolka
Published in: Journal of Automated Reasoning, Issue 61/1-4, 2018, Page(s) 521-553, ISSN 0168-7433
DOI: 10.1007/s10817-018-9460-x

Petri Automata

Author(s): Brunet, Paul; Pous, Damien
Published in: Logical Methods in Computer Science, 2017, ISSN 1860-5974
DOI: 10.23638/LMCS-13(3:33)2017

A general account of coinduction up-to

Author(s): Filippo Bonchi, Daniela Petrişan, Damien Pous, Jurriaan Rot
Published in: Acta Informatica, Issue 54/2, 2017, Page(s) 127-190, ISSN 0001-5903
DOI: 10.1007/s00236-016-0271-4

Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)

Author(s): Das , Anupam; Pous , Damien
Published in: Computer Science Logic, 2018
DOI: 10.4230/LIPIcs.CSL.2018.18

Allegories - decidability and graph homomorphisms

Author(s): Damien Pous, Valeria Vignudelli
Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, 2018, Page(s) 829-838
DOI: 10.1145/3209108.3209172

Completeness and decidability of converse PDL in the constructive type theory of Coq

Author(s): Christian Doczkal, Joachim Bard
Published in: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018, 2018, Page(s) 42-52
DOI: 10.1145/3167088

Completeness for Identity-free Kleene Lattices

Author(s): Doumane , Amina; Pous , Damien
Published in: The 29th International Conference on Concurrency Theory (CONCUR), 2018
DOI: 10.4230/LIPIcs.CONCUR.2018.18

Eager Functions as Processes

Author(s): Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi
Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, 2018, Page(s) 364-373
DOI: 10.1145/3209108.3209152

Divergence and unique solution of equations

Author(s): Durier, Adrien; Hirschkoff, Daniel; Sangiorgi, Davide
Published in: 28th International Conference on Concurrency Theory - CONCUR 2017, 2017
DOI: 10.4230/LIPIcs.CONCUR.2017.7

Treewidth-Two Graphs as a Free Algebra

Author(s): Christian Doczkal ; Damien Pous
Published in: Mathematical Foundations of Computer Science (MFCS), 2018
DOI: 10.4230/LIPIcs.MFCS.2018.60

A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs

Author(s): Christian Doczkal, Guillaume Combette, Damien Pous
Published in: International Conference on Interactive Theorem Proving (ITP), 2018, Page(s) 178-195
DOI: 10.1007/978-3-319-94821-8_11

Büchi Good-for-Games Automata Are Efficiently Recognizable

Author(s): Bagnol , Marc; Kuperberg , Denis
Published in: FSTTCS, 2018
DOI: 10.4230/LIPIcs.FSTTCS.2018.16

Left-Handed Completeness for Kleene algebra, via Cyclic Proofs

Author(s): Anupam Das, Amina Doumane, Damien Pous
Published in: EPiC Series in Computing volume 57, 2018, Page(s) 271-251
DOI: 10.29007/hzq3

On the Positive Calculus of Relations with Transitive Closure

Author(s): Damien Pous
Published in: STACS, 2018
DOI: 10.4230/lipics.stacs.2018.3

Coinductive algorithms for Büchi automata

Author(s): Kuperberg, Denis; Pinault, Laureline; Pous, Damien
Published in: Developments in Language Theory, 2019

The Theory of Traces for Systems with Probability and Nondeterminism

Author(s): Filippo Bonchi, Ana Sokolova, Valeria Vignudelli
Published in: Logic in Computer Science, 2019

A cut-free cyclic proof system for Kleene algebra

Author(s): Das, Anupam; Pous, Damien
Published in: 26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2017), 2017
DOI: 10.1007/978-3-319-66902-1_16

Companions, Codensity and Causality

Author(s): Pous, Damien; Rot, Jurriaan
Published in: 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017), 2017
DOI: 10.1007/978-3-662-54458-7_7

Monoidal Company for Accessible Functors *

Author(s): Basold, Henning; Pous, Damien; Rot, Jurriaan
Published in: 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), 2017
DOI: 10.4230/LIPIcs.CALCO.2017.5

Coinduction All the Way Up

Author(s): Damien Pous
Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16, 2016, Page(s) 307-316
DOI: 10.1145/2933575.2934564

Fully abstract encodings of λ-calculus in HOcore through abstract machines

Author(s): Malgorzata Biernacka, Dariusz Biernacki, Serguei Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt
Published in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, Page(s) 1-12
DOI: 10.1109/LICS.2017.8005118

K4-free Graphs as a Free Algebra

Author(s): Cosme-Llópez, Enric; Pous, Damien
Published in: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 2017
DOI: 10.4230/LIPIcs.MFCS.2017.76

A formal exploration of Nominal Kleene Algebra

Author(s): Brunet, Paul; Pous, Damien
Published in: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS), 2016
DOI: 10.4230/LIPIcs.MFCS.2016.22

On Decidability of Concurrent Kleene Algebra

Author(s): Brunet, Paul; Pous, Damien; Struth, Georg
Published in: 28th International Conference on Concurrency Theory (CONCUR 2017), 2017
DOI: 10.4230/LIPIcs.CONCUR.2017.24

Cardinalities of Finite Relations in Coq

Author(s): Paul Brunet, Damien Pous, Insa Stucke
Published in: 7th international conference on Interactive Theorem Proving (ITP), 2016, Page(s) 466-474
DOI: 10.1007/978-3-319-43144-4_29

Kleene Algebra with Hypotheses

Author(s): Amina Doumane, Denis Kuperberg, Damien Pous, Pierre Pradic
Published in: Foundations of Software Science and Computation Structures - 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings, Issue 11425, 2019, Page(s) 207-223
DOI: 10.1007/978-3-030-17127-8_12

Coinduction in Uniform: Foundations for Corecursive Proof Search with Horn Clauses

Author(s): Henning Basold, Ekaterina Komendantskaya, Yue Li
Published in: Programming Languages and Systems - 28th European Symposium on Programming, ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings, Issue 11423, 2019, Page(s) 783-813
DOI: 10.1007/978-3-030-17184-1_28

Automata for relation algebra and formal proofs

Author(s): Pous, Damien
Published in: HdR thesis, ENS Lyon, 2016, 2016