Coinduction for Verification and Certification

Bisimulation and Coinduction Enhancements: A Historical Perspective

Autores: Damien Pous; Davide Sangiorgi
Publicado en: Formal Aspects of Computing, Edición 11, 2019, ISSN 0934-5043
Editor: Springer Verlag
DOI: 10.1007/s00165-019-00497-w

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

Autores: Adrien Durier; Adrien Durier; Daniel Hirschkoff; Davide Sangiorgi
Publicado en: Theoretical Computer Science, Edición 30, 2019, ISSN 0304-3975
Editor: Elsevier BV
DOI: 10.1016/j.tcs.2019.09.036

Enhanced coalgebraic bisimulation

Autores: Jurriaan Rot, Filippo Bonchi, Marcello M. Bonsangue, Damien Pous, Jan Rutten, Alexandra Silva
Publicado en: Mathematical Structures in Computer Science, 2017, ISSN 0960-1295
Editor: Cambridge University Press
DOI: 10.1017/s0960129515000523

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

Autores: Madiot, Jean-Marie; Pous, Damien; Sangiorgi, Davide
Publicado en: Logical Methods in Computer Science, Edición 10, 2021, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-17(3:25)2021

Regular Language Representations in the Constructive Type Theory of Coq

Autores: Christian Doczkal, Gert Smolka
Publicado en: Journal of Automated Reasoning, Edición 61/1-4, 2018, Página(s) 521-553, ISSN 0168-7433
Editor: Kluwer Academic Publishers
DOI: 10.1007/s10817-018-9460-x

Petri Automata

Autores: Brunet, Paul; Pous, Damien
Publicado en: Logical Methods in Computer Science, 2017, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.23638/LMCS-13(3:33)2017

A general account of coinduction up-to

Autores: Filippo Bonchi, Daniela Petrişan, Damien Pous, Jurriaan Rot
Publicado en: Acta Informatica, Edición 54/2, 2017, Página(s) 127-190, ISSN 0001-5903
Editor: Springer Verlag
DOI: 10.1007/s00236-016-0271-4

Cyclic Proofs, System T, and the Power of Contraction

Autores: Denis Kuperberg; Laureline Pinault; Damien Pous
Publicado en: Proceedings of the ACM on Programming Languages, Edición 21, 2021, ISSN 2475-1421
Editor: ACM
DOI: 10.1145/3434282

Companions, Causality and Codensity

Autores: Pous, Damien; Rot, Jurriaan
Publicado en: Logical Methods in Computer Science, Edición 33, 2019, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-15(3:14)2019

Graph Theory in Coq: Minors, Treewidth, and Isomorphisms

Autores: Doczkal, Christian; Pous, Damien
Publicado en: Journal of Automated Reasoning, Edición 15, 2020, ISSN 0168-7433
Editor: Kluwer Academic Publishers
DOI: 10.1007/s10817-020-09543-2

Coinductive Algorithms for Büchi Automata

Autores: Denis Kuperberg; Laureline Pinault; Damien Pous
Publicado en: Fundamenta Informatica, Edición 7, 2021, ISSN 0169-2968
Editor: IOS Press
DOI: 10.1007/978-3-030-24886-4_15

Proof Theory of Riesz Spaces and Modal Riesz Spaces

Autores: Lucas, Christophe; Mio, Matteo
Publicado en: Proc. RAMiCS, Edición 2, 2021
Editor: Springer
DOI: 10.1007/978-3-030-88701-8_17

Towards a Structural Proof Theory of Probabilistic mu-Calculi

Autores: Christophe Lucas, Matteo Mio
Publicado en: Proc. FoSSaCS, 2019
Editor: Springer
DOI: 10.1007/978-3-030-17127-8_24

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

Autores: Christian Doczkal; Damien Pous
Publicado en: Proc. CPP, Edición 13, 2020
Editor: ACM Press
DOI: 10.1145/3372885.3373831

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

Autores: Filippo Bonchi, Ana Sokolova, Valeria Vignudelli
Publicado en: Proc. CALCO, 2021
Editor: Schloss Dagstuhl
DOI: 10.4230/lipics.calco.2021.11

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

Autores: Doumane, Amina; Pous, Damien
Publicado en: Proc. CONCUR, Edición 23, 2020
Editor: Schloss Dagstuhl
DOI: 10.4230/lipics.concur.2020.29

On Tools for Completeness of Kleene Algebra with Hypotheses

Autores: Pous, Damien; Rot, Jurriaan; Wagemaker, Jana
Publicado en: Proc. RAMiCS, Edición 8, 2021
Editor: Springer
DOI: 10.1007/978-3-030-88701-8_23

Cyclic Proofs and Jumping Automata

Autores: Kuperberg, Denis; Pinault, Laureline; Pous, Damien
Publicado en: Proc. FSTTCS, Edición 22, 2019
Editor: Schloss Dagstuhl
DOI: 10.4230/lipics.fsttcs.2019.45

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

Autores: Pous, Damien
Publicado en: Proc. CALCO, Edición 6, 2019
Editor: Schloss Dagstuhl
DOI: 10.4230/lipics.calco.2019.4

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

Autores: Das , Anupam; Pous , Damien
Publicado en: Computer Science Logic, 2018
Editor: Dagstuhl
DOI: 10.4230/LIPIcs.CSL.2018.18

Allegories - decidability and graph homomorphisms

Autores: Damien Pous, Valeria Vignudelli
Publicado en: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, 2018, Página(s) 829-838, ISBN 9781-450355834
Editor: ACM Press
DOI: 10.1145/3209108.3209172

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

Autores: Christian Doczkal, Joachim Bard
Publicado en: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018, 2018, Página(s) 42-52, ISBN 9781-450355865
Editor: ACM Press
DOI: 10.1145/3167088

Completeness for Identity-free Kleene Lattices

Autores: Doumane , Amina; Pous , Damien
Publicado en: The 29th International Conference on Concurrency Theory (CONCUR), 2018
Editor: Dagstuhl
DOI: 10.4230/LIPIcs.CONCUR.2018.18

Eager Functions as Processes

Autores: Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi
Publicado en: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, 2018, Página(s) 364-373, ISBN 9781-450355834
Editor: ACM Press
DOI: 10.1145/3209108.3209152

Divergence and unique solution of equations

Autores: Durier, Adrien; Hirschkoff, Daniel; Sangiorgi, Davide
Publicado en: 28th International Conference on Concurrency Theory - CONCUR 2017, 2017
Editor: Dagstuhl
DOI: 10.4230/LIPIcs.CONCUR.2017.7

Treewidth-Two Graphs as a Free Algebra

Autores: Christian Doczkal ; Damien Pous
Publicado en: Mathematical Foundations of Computer Science (MFCS), 2018
Editor: Dagstuhl
DOI: 10.4230/LIPIcs.MFCS.2018.60

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

Autores: Christian Doczkal, Guillaume Combette, Damien Pous
Publicado en: International Conference on Interactive Theorem Proving (ITP), 2018, Página(s) 178-195
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-94821-8_11

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

Autores: Bagnol , Marc; Kuperberg , Denis
Publicado en: FSTTCS, 2018
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.FSTTCS.2018.16

Kleene Algebra with Hypotheses

Autores: Amina Doumane, Denis Kuperberg, Damien Pous, Pierre Pradic
Publicado en: 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, Edición 11425, 2019, Página(s) 207-223, ISBN 978-3-030-17126-1
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-17127-8_12

Left-Handed Completeness for Kleene algebra, via Cyclic Proofs

Autores: Anupam Das, Amina Doumane, Damien Pous
Publicado en: EPiC Series in Computing volume 57, 2018, Página(s) 271-251
Editor: EasyChair
DOI: 10.29007/hzq3

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

Autores: Henning Basold, Ekaterina Komendantskaya, Yue Li
Publicado en: 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, Edición 11423, 2019, Página(s) 783-813, ISBN 978-3-030-17183-4
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-17184-1_28

On the Positive Calculus of Relations with Transitive Closure

Autores: Damien Pous
Publicado en: STACS, 2018
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2018.3

Coinductive algorithms for Büchi automata

Autores: Kuperberg, Denis; Pinault, Laureline; Pous, Damien
Publicado en: Developments in Language Theory, 2019
Editor: Springer

The Theory of Traces for Systems with Probability and Nondeterminism

Autores: Filippo Bonchi, Ana Sokolova, Valeria Vignudelli
Publicado en: Logic in Computer Science, 2019
Editor: IEEE

A cut-free cyclic proof system for Kleene algebra

Autores: Das, Anupam; Pous, Damien
Publicado en: 26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2017), 2017
Editor: Springer Verlag
DOI: 10.1007/978-3-319-66902-1_16

Companions, Codensity and Causality

Autores: Pous, Damien; Rot, Jurriaan
Publicado en: 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017), 2017
Editor: Springer Verlag
DOI: 10.1007/978-3-662-54458-7_7

Monoidal Company for Accessible Functors *

Autores: Basold, Henning; Pous, Damien; Rot, Jurriaan
Publicado en: 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), 2017
Editor: LIPics - Dagstuhl
DOI: 10.4230/LIPIcs.CALCO.2017.5

Coinduction All the Way Up

Autores: Damien Pous
Publicado en: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16, 2016, Página(s) 307-316, ISBN 9781-450343916
Editor: ACM Press
DOI: 10.1145/2933575.2934564

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

Autores: Malgorzata Biernacka, Dariusz Biernacki, Serguei Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt
Publicado en: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, Página(s) 1-12, ISBN 978-1-5090-3018-7
Editor: IEEE
DOI: 10.1109/LICS.2017.8005118

K4-free Graphs as a Free Algebra

Autores: Cosme-Llópez, Enric; Pous, Damien
Publicado en: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 2017
Editor: LIPics - Dagstuhl
DOI: 10.4230/LIPIcs.MFCS.2017.76

A formal exploration of Nominal Kleene Algebra

Autores: Brunet, Paul; Pous, Damien
Publicado en: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS), 2016
Editor: LIPics Dagstuhl
DOI: 10.4230/LIPIcs.MFCS.2016.22

On Decidability of Concurrent Kleene Algebra

Autores: Brunet, Paul; Pous, Damien; Struth, Georg
Publicado en: 28th International Conference on Concurrency Theory (CONCUR 2017), 2017
Editor: LIPics - Dagstuhl
DOI: 10.4230/LIPIcs.CONCUR.2017.24

Cardinalities of Finite Relations in Coq

Autores: Paul Brunet, Damien Pous, Insa Stucke
Publicado en: 7th international conference on Interactive Theorem Proving (ITP), 2016, Página(s) 466-474
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-43144-4_29

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

Autores: Matteo Mio, Ralph Sarkis, Valeria Vignudelli
Publicado en: Proc. LICS, 2021
Editor: IEEE
DOI: 10.1109/lics52264.2021.9470717

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

Autores: Amina Doumane
Publicado en: Proc. RAMiCS, 2021
Editor: Springer
DOI: 10.1007/978-3-030-88701-8_9

A certificate-based approach to formally verified approximations

Autores: Bréhard, Florent; Mahboubi, Assia; Pous, Damien
Publicado en: Proc. ITP, Edición 29, 2019
Editor: Schloss Dagstuhl
DOI: 10.4230/lipics.itp.2019.8

Monads and Quantitative Equational Theories for Nondeterminism and Probability

Autores: Mio, Matteo; Vignudelli, Valeria
Publicado en: Proc. CONCUR, Edición 31, 2020
Editor: Scchloss Dagstuhl
DOI: 10.4230/lipics.concur.2020.28

On the Representation of References in the Pi-Calculus

Autores: Hirschkoff D.; Prebet E.; Sangiorgi D.
Publicado en: Proc. CONCUR, Edición 26, 2020
Editor: Schloss Dagstuhl
DOI: 10.4230/lipics.concur.2020.34

Graph Characterization of the Universal Theory of Relations

Autores: Amina Doumane
Publicado en: Proc. MFCS, 2021
Editor: Schloss Dagstuhl
DOI: 10.4230/lipics.mfcs.2021.41

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

Autores: Doczkal, Christian
Publicado en: Edición 18, 2021
Editor: HAL

Automata for relation algebra and formal proofs

Autores: Pous, Damien
Publicado en: HdR thesis, ENS Lyon, 2016, 2016
Editor: ENS de Lyon

Publicaciones

Compartir esta página

Descargar