Coinduction for Verification and Certification

Bisimulation and Coinduction Enhancements: A Historical Perspective

Author(s): Damien Pous; Davide Sangiorgi
Published in: Formal Aspects of Computing, Issue 11, 2019, ISSN 0934-5043
Publisher: Springer Verlag
DOI: 10.1007/s00165-019-00497-w

Towards 'up to context' reasoning about higher-order processes

Author(s): Adrien Durier; Adrien Durier; Daniel Hirschkoff; Davide Sangiorgi
Published in: Theoretical Computer Science, Issue 30, 2019, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2019.09.036

Enhanced coalgebraic bisimulation

Author(s): Jurriaan Rot, Filippo Bonchi, Marcello M. Bonsangue, Damien Pous, Jan Rutten, Alexandra Silva
Published in: Mathematical Structures in Computer Science, 2017, ISSN 0960-1295
Publisher: Cambridge University Press
DOI: 10.1017/s0960129515000523

Modular coinduction up-to for higher-order languages via first-order transition systems

Author(s): Madiot, Jean-Marie; Pous, Damien; Sangiorgi, Davide
Published in: Logical Methods in Computer Science, Issue 10, 2021, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-17(3:25)2021

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
Publisher: Kluwer Academic Publishers
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
Publisher: Technischen Universitat Braunschweig
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
Publisher: Springer Verlag
DOI: 10.1007/s00236-016-0271-4

Cyclic Proofs, System T, and the Power of Contraction

Author(s): Denis Kuperberg; Laureline Pinault; Damien Pous
Published in: Proceedings of the ACM on Programming Languages, Issue 21, 2021, ISSN 2475-1421
Publisher: ACM
DOI: 10.1145/3434282

Companions, Causality and Codensity

Author(s): Pous, Damien; Rot, Jurriaan
Published in: Logical Methods in Computer Science, Issue 33, 2019, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-15(3:14)2019

Graph Theory in Coq: Minors, Treewidth, and Isomorphisms

Author(s): Doczkal, Christian; Pous, Damien
Published in: Journal of Automated Reasoning, Issue 15, 2020, ISSN 0168-7433
Publisher: Kluwer Academic Publishers
DOI: 10.1007/s10817-020-09543-2

Coinductive Algorithms for Büchi Automata

Author(s): Denis Kuperberg; Laureline Pinault; Damien Pous
Published in: Fundamenta Informatica, Issue 7, 2021, ISSN 0169-2968
Publisher: IOS Press
DOI: 10.1007/978-3-030-24886-4_15

Proof Theory of Riesz Spaces and Modal Riesz Spaces

Author(s): Lucas, Christophe; Mio, Matteo
Published in: Proc. RAMiCS, Issue 2, 2021
Publisher: Springer
DOI: 10.1007/978-3-030-88701-8_17

Towards a Structural Proof Theory of Probabilistic mu-Calculi

Author(s): Christophe Lucas, Matteo Mio
Published in: Proc. FoSSaCS, 2019
Publisher: Springer
DOI: 10.1007/978-3-030-17127-8_24

Completeness of an axiomatization of graph isomorphism via graph rewriting in Coq

Author(s): Christian Doczkal; Damien Pous
Published in: Proc. CPP, Issue 13, 2020
Publisher: ACM Press
DOI: 10.1145/3372885.3373831

Presenting Convex Sets of Probability Distributions by Convex Semilattices and Unique Bases

Author(s): Filippo Bonchi, Ana Sokolova, Valeria Vignudelli
Published in: Proc. CALCO, 2021
Publisher: Schloss Dagstuhl
DOI: 10.4230/lipics.calco.2021.11

Non Axiomatisability of Positive Relation Algebras with Constants, via Graph Homomorphisms

Author(s): Doumane, Amina; Pous, Damien
Published in: Proc. CONCUR, Issue 23, 2020
Publisher: Schloss Dagstuhl
DOI: 10.4230/lipics.concur.2020.29

On Tools for Completeness of Kleene Algebra with Hypotheses

Author(s): Pous, Damien; Rot, Jurriaan; Wagemaker, Jana
Published in: Proc. RAMiCS, Issue 8, 2021
Publisher: Springer
DOI: 10.1007/978-3-030-88701-8_23

Cyclic Proofs and Jumping Automata

Author(s): Kuperberg, Denis; Pinault, Laureline; Pous, Damien
Published in: Proc. FSTTCS, Issue 22, 2019
Publisher: Schloss Dagstuhl
DOI: 10.4230/lipics.fsttcs.2019.45

Coinduction: Automata, Formal Proof, Companions (Invited Paper)

Author(s): Pous, Damien
Published in: Proc. CALCO, Issue 6, 2019
Publisher: Schloss Dagstuhl
DOI: 10.4230/lipics.calco.2019.4

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

Author(s): Das , Anupam; Pous , Damien
Published in: Computer Science Logic, 2018
Publisher: Dagstuhl
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, ISBN 9781-450355834
Publisher: ACM Press
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, ISBN 9781-450355865
Publisher: ACM Press
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
Publisher: Dagstuhl
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, ISBN 9781-450355834
Publisher: ACM Press
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
Publisher: Dagstuhl
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
Publisher: Dagstuhl
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
Publisher: Springer International Publishing
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
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.FSTTCS.2018.16

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, ISBN 978-3-030-17126-1
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-17127-8_12

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
Publisher: EasyChair
DOI: 10.29007/hzq3

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, ISBN 978-3-030-17183-4
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-17184-1_28

On the Positive Calculus of Relations with Transitive Closure

Author(s): Damien Pous
Published in: STACS, 2018
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
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
Publisher: Springer

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
Publisher: IEEE

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
Publisher: Springer Verlag
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
Publisher: Springer Verlag
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
Publisher: LIPics - Dagstuhl
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, ISBN 9781-450343916
Publisher: ACM Press
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, ISBN 978-1-5090-3018-7
Publisher: IEEE
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
Publisher: LIPics - Dagstuhl
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
Publisher: LIPics Dagstuhl
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
Publisher: LIPics - Dagstuhl
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
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-43144-4_29

Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning

Author(s): Matteo Mio, Ralph Sarkis, Valeria Vignudelli
Published in: Proc. LICS, 2021
Publisher: IEEE
DOI: 10.1109/lics52264.2021.9470717

The Class of Representable Semilattice-Ordered Monoids Is Not a Variety

Author(s): Amina Doumane
Published in: Proc. RAMiCS, 2021
Publisher: Springer
DOI: 10.1007/978-3-030-88701-8_9

A certificate-based approach to formally verified approximations

Author(s): Bréhard, Florent; Mahboubi, Assia; Pous, Damien
Published in: Proc. ITP, Issue 29, 2019
Publisher: Schloss Dagstuhl
DOI: 10.4230/lipics.itp.2019.8

Monads and Quantitative Equational Theories for Nondeterminism and Probability

Author(s): Mio, Matteo; Vignudelli, Valeria
Published in: Proc. CONCUR, Issue 31, 2020
Publisher: Scchloss Dagstuhl
DOI: 10.4230/lipics.concur.2020.28

On the Representation of References in the Pi-Calculus

Author(s): Hirschkoff D.; Prebet E.; Sangiorgi D.
Published in: Proc. CONCUR, Issue 26, 2020
Publisher: Schloss Dagstuhl
DOI: 10.4230/lipics.concur.2020.34

Graph Characterization of the Universal Theory of Relations

Author(s): Amina Doumane
Published in: Proc. MFCS, 2021
Publisher: Schloss Dagstuhl
DOI: 10.4230/lipics.mfcs.2021.41

Short proof of Menger's Theorem in Coq (Proof Pearl)

Author(s): Doczkal, Christian
Published in: Issue 18, 2021
Publisher: HAL

Automata for relation algebra and formal proofs

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

Publications

Share this page

Download