Pubblicazioni Peer reviewed articles (11) Bisimulation and Coinduction Enhancements: A Historical Perspective Autori: Damien Pous; Davide Sangiorgi Pubblicato in: Formal Aspects of Computing, Issue 11, 2019, ISSN 0934-5043 Editore: Springer Verlag DOI: 10.1007/s00165-019-00497-w Towards 'up to context' reasoning about higher-order processes Autori: Adrien Durier; Adrien Durier; Daniel Hirschkoff; Davide Sangiorgi Pubblicato in: Theoretical Computer Science, Issue 30, 2019, ISSN 0304-3975 Editore: Elsevier BV DOI: 10.1016/j.tcs.2019.09.036 Enhanced coalgebraic bisimulation Autori: Jurriaan Rot, Filippo Bonchi, Marcello M. Bonsangue, Damien Pous, Jan Rutten, Alexandra Silva Pubblicato in: Mathematical Structures in Computer Science, 2017, ISSN 0960-1295 Editore: Cambridge University Press DOI: 10.1017/s0960129515000523 Modular coinduction up-to for higher-order languages via first-order transition systems Autori: Madiot, Jean-Marie; Pous, Damien; Sangiorgi, Davide Pubblicato in: Logical Methods in Computer Science, Issue 10, 2021, ISSN 1860-5974 Editore: Technischen Universitat Braunschweig DOI: 10.46298/lmcs-17(3:25)2021 Regular Language Representations in the Constructive Type Theory of Coq Autori: Christian Doczkal, Gert Smolka Pubblicato in: Journal of Automated Reasoning, Issue 61/1-4, 2018, Page(s) 521-553, ISSN 0168-7433 Editore: Kluwer Academic Publishers DOI: 10.1007/s10817-018-9460-x Petri Automata Autori: Brunet, Paul; Pous, Damien Pubblicato in: Logical Methods in Computer Science, 2017, ISSN 1860-5974 Editore: Technischen Universitat Braunschweig DOI: 10.23638/LMCS-13(3:33)2017 A general account of coinduction up-to Autori: Filippo Bonchi, Daniela Petrişan, Damien Pous, Jurriaan Rot Pubblicato in: Acta Informatica, Issue 54/2, 2017, Page(s) 127-190, ISSN 0001-5903 Editore: Springer Verlag DOI: 10.1007/s00236-016-0271-4 Cyclic Proofs, System T, and the Power of Contraction Autori: Denis Kuperberg; Laureline Pinault; Damien Pous Pubblicato in: Proceedings of the ACM on Programming Languages, Issue 21, 2021, ISSN 2475-1421 Editore: ACM DOI: 10.1145/3434282 Companions, Causality and Codensity Autori: Pous, Damien; Rot, Jurriaan Pubblicato in: Logical Methods in Computer Science, Issue 33, 2019, ISSN 1860-5974 Editore: Technischen Universitat Braunschweig DOI: 10.23638/lmcs-15(3:14)2019 Graph Theory in Coq: Minors, Treewidth, and Isomorphisms Autori: Doczkal, Christian; Pous, Damien Pubblicato in: Journal of Automated Reasoning, Issue 15, 2020, ISSN 0168-7433 Editore: Kluwer Academic Publishers DOI: 10.1007/s10817-020-09543-2 Coinductive Algorithms for Büchi Automata Autori: Denis Kuperberg; Laureline Pinault; Damien Pous Pubblicato in: Fundamenta Informatica, Issue 7, 2021, ISSN 0169-2968 Editore: IOS Press DOI: 10.1007/978-3-030-24886-4_15 Conference proceedings (38) Proof Theory of Riesz Spaces and Modal Riesz Spaces Autori: Lucas, Christophe; Mio, Matteo Pubblicato in: Proc. RAMiCS, Issue 2, 2021 Editore: Springer DOI: 10.1007/978-3-030-88701-8_17 Towards a Structural Proof Theory of Probabilistic mu-Calculi Autori: Christophe Lucas, Matteo Mio Pubblicato in: Proc. FoSSaCS, 2019 Editore: Springer DOI: 10.1007/978-3-030-17127-8_24 Completeness of an axiomatization of graph isomorphism via graph rewriting in Coq Autori: Christian Doczkal; Damien Pous Pubblicato in: Proc. CPP, Issue 13, 2020 Editore: ACM Press DOI: 10.1145/3372885.3373831 Presenting Convex Sets of Probability Distributions by Convex Semilattices and Unique Bases Autori: Filippo Bonchi, Ana Sokolova, Valeria Vignudelli Pubblicato in: Proc. CALCO, 2021 Editore: Schloss Dagstuhl DOI: 10.4230/lipics.calco.2021.11 Non Axiomatisability of Positive Relation Algebras with Constants, via Graph Homomorphisms Autori: Doumane, Amina; Pous, Damien Pubblicato in: Proc. CONCUR, Issue 23, 2020 Editore: Schloss Dagstuhl DOI: 10.4230/lipics.concur.2020.29 On Tools for Completeness of Kleene Algebra with Hypotheses Autori: Pous, Damien; Rot, Jurriaan; Wagemaker, Jana Pubblicato in: Proc. RAMiCS, Issue 8, 2021 Editore: Springer DOI: 10.1007/978-3-030-88701-8_23 Cyclic Proofs and Jumping Automata Autori: Kuperberg, Denis; Pinault, Laureline; Pous, Damien Pubblicato in: Proc. FSTTCS, Issue 22, 2019 Editore: Schloss Dagstuhl DOI: 10.4230/lipics.fsttcs.2019.45 Coinduction: Automata, Formal Proof, Companions (Invited Paper) Autori: Pous, Damien Pubblicato in: Proc. CALCO, Issue 6, 2019 Editore: Schloss Dagstuhl DOI: 10.4230/lipics.calco.2019.4 Non-wellfounded proof theory for (Kleene+action)(algebras+lattices) Autori: Das , Anupam; Pous , Damien Pubblicato in: Computer Science Logic, 2018 Editore: Dagstuhl DOI: 10.4230/LIPIcs.CSL.2018.18 Allegories - decidability and graph homomorphisms Autori: Damien Pous, Valeria Vignudelli Pubblicato in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, 2018, Page(s) 829-838, ISBN 9781-450355834 Editore: ACM Press DOI: 10.1145/3209108.3209172 Completeness and decidability of converse PDL in the constructive type theory of Coq Autori: Christian Doczkal, Joachim Bard Pubblicato in: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018, 2018, Page(s) 42-52, ISBN 9781-450355865 Editore: ACM Press DOI: 10.1145/3167088 Completeness for Identity-free Kleene Lattices Autori: Doumane , Amina; Pous , Damien Pubblicato in: The 29th International Conference on Concurrency Theory (CONCUR), 2018 Editore: Dagstuhl DOI: 10.4230/LIPIcs.CONCUR.2018.18 Eager Functions as Processes Autori: Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi Pubblicato in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, 2018, Page(s) 364-373, ISBN 9781-450355834 Editore: ACM Press DOI: 10.1145/3209108.3209152 Divergence and unique solution of equations Autori: Durier, Adrien; Hirschkoff, Daniel; Sangiorgi, Davide Pubblicato in: 28th International Conference on Concurrency Theory - CONCUR 2017, 2017 Editore: Dagstuhl DOI: 10.4230/LIPIcs.CONCUR.2017.7 Treewidth-Two Graphs as a Free Algebra Autori: Christian Doczkal ; Damien Pous Pubblicato in: Mathematical Foundations of Computer Science (MFCS), 2018 Editore: Dagstuhl DOI: 10.4230/LIPIcs.MFCS.2018.60 A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs Autori: Christian Doczkal, Guillaume Combette, Damien Pous Pubblicato in: International Conference on Interactive Theorem Proving (ITP), 2018, Page(s) 178-195 Editore: Springer International Publishing DOI: 10.1007/978-3-319-94821-8_11 Büchi Good-for-Games Automata Are Efficiently Recognizable Autori: Bagnol , Marc; Kuperberg , Denis Pubblicato in: FSTTCS, 2018 Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik DOI: 10.4230/LIPIcs.FSTTCS.2018.16 Kleene Algebra with Hypotheses Autori: Amina Doumane, Denis Kuperberg, Damien Pous, Pierre Pradic Pubblicato 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 Editore: Springer International Publishing DOI: 10.1007/978-3-030-17127-8_12 Left-Handed Completeness for Kleene algebra, via Cyclic Proofs Autori: Anupam Das, Amina Doumane, Damien Pous Pubblicato in: EPiC Series in Computing volume 57, 2018, Page(s) 271-251 Editore: EasyChair DOI: 10.29007/hzq3 Coinduction in Uniform: Foundations for Corecursive Proof Search with Horn Clauses Autori: Henning Basold, Ekaterina Komendantskaya, Yue Li Pubblicato 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 Editore: Springer International Publishing DOI: 10.1007/978-3-030-17184-1_28 On the Positive Calculus of Relations with Transitive Closure Autori: Damien Pous Pubblicato in: STACS, 2018 Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.stacs.2018.3 Coinductive algorithms for Büchi automata Autori: Kuperberg, Denis; Pinault, Laureline; Pous, Damien Pubblicato in: Developments in Language Theory, 2019 Editore: Springer The Theory of Traces for Systems with Probability and Nondeterminism Autori: Filippo Bonchi, Ana Sokolova, Valeria Vignudelli Pubblicato in: Logic in Computer Science, 2019 Editore: IEEE A cut-free cyclic proof system for Kleene algebra Autori: Das, Anupam; Pous, Damien Pubblicato in: 26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2017), 2017 Editore: Springer Verlag DOI: 10.1007/978-3-319-66902-1_16 Companions, Codensity and Causality Autori: Pous, Damien; Rot, Jurriaan Pubblicato in: 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017), 2017 Editore: Springer Verlag DOI: 10.1007/978-3-662-54458-7_7 Monoidal Company for Accessible Functors * Autori: Basold, Henning; Pous, Damien; Rot, Jurriaan Pubblicato in: 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), 2017 Editore: LIPics - Dagstuhl DOI: 10.4230/LIPIcs.CALCO.2017.5 Coinduction All the Way Up Autori: Damien Pous Pubblicato in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16, 2016, Page(s) 307-316, ISBN 9781-450343916 Editore: ACM Press DOI: 10.1145/2933575.2934564 Fully abstract encodings of λ-calculus in HOcore through abstract machines Autori: Malgorzata Biernacka, Dariusz Biernacki, Serguei Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt Pubblicato in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, Page(s) 1-12, ISBN 978-1-5090-3018-7 Editore: IEEE DOI: 10.1109/LICS.2017.8005118 K4-free Graphs as a Free Algebra Autori: Cosme-Llópez, Enric; Pous, Damien Pubblicato in: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 2017 Editore: LIPics - Dagstuhl DOI: 10.4230/LIPIcs.MFCS.2017.76 A formal exploration of Nominal Kleene Algebra Autori: Brunet, Paul; Pous, Damien Pubblicato in: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS), 2016 Editore: LIPics Dagstuhl DOI: 10.4230/LIPIcs.MFCS.2016.22 On Decidability of Concurrent Kleene Algebra Autori: Brunet, Paul; Pous, Damien; Struth, Georg Pubblicato in: 28th International Conference on Concurrency Theory (CONCUR 2017), 2017 Editore: LIPics - Dagstuhl DOI: 10.4230/LIPIcs.CONCUR.2017.24 Cardinalities of Finite Relations in Coq Autori: Paul Brunet, Damien Pous, Insa Stucke Pubblicato in: 7th international conference on Interactive Theorem Proving (ITP), 2016, Page(s) 466-474 Editore: Springer International Publishing DOI: 10.1007/978-3-319-43144-4_29 Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning Autori: Matteo Mio, Ralph Sarkis, Valeria Vignudelli Pubblicato in: Proc. LICS, 2021 Editore: IEEE DOI: 10.1109/lics52264.2021.9470717 The Class of Representable Semilattice-Ordered Monoids Is Not a Variety Autori: Amina Doumane Pubblicato in: Proc. RAMiCS, 2021 Editore: Springer DOI: 10.1007/978-3-030-88701-8_9 A certificate-based approach to formally verified approximations Autori: Bréhard, Florent; Mahboubi, Assia; Pous, Damien Pubblicato in: Proc. ITP, Issue 29, 2019 Editore: Schloss Dagstuhl DOI: 10.4230/lipics.itp.2019.8 Monads and Quantitative Equational Theories for Nondeterminism and Probability Autori: Mio, Matteo; Vignudelli, Valeria Pubblicato in: Proc. CONCUR, Issue 31, 2020 Editore: Scchloss Dagstuhl DOI: 10.4230/lipics.concur.2020.28 On the Representation of References in the Pi-Calculus Autori: Hirschkoff D.; Prebet E.; Sangiorgi D. Pubblicato in: Proc. CONCUR, Issue 26, 2020 Editore: Schloss Dagstuhl DOI: 10.4230/lipics.concur.2020.34 Graph Characterization of the Universal Theory of Relations Autori: Amina Doumane Pubblicato in: Proc. MFCS, 2021 Editore: Schloss Dagstuhl DOI: 10.4230/lipics.mfcs.2021.41 Other (1) Short proof of Menger's Theorem in Coq (Proof Pearl) Autori: Doczkal, Christian Pubblicato in: Issue 18, 2021 Editore: HAL Thesis dissertations (1) Automata for relation algebra and formal proofs Autori: Pous, Damien Pubblicato in: HdR thesis, ENS Lyon, 2016, 2016 Editore: ENS de Lyon È in corso la ricerca di dati su OpenAIRE... Si è verificato un errore durante la ricerca dei dati su OpenAIRE Nessun risultato disponibile
