Coinduction for Verification and Certification

Bisimulation and Coinduction Enhancements: A Historical Perspective

Autorzy: Damien Pous; Davide Sangiorgi
Opublikowane w: Formal Aspects of Computing, Numer 11, 2019, ISSN 0934-5043
Wydawca: Springer Verlag
DOI: 10.1007/s00165-019-00497-w

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

Autorzy: Adrien Durier; Adrien Durier; Daniel Hirschkoff; Davide Sangiorgi
Opublikowane w: Theoretical Computer Science, Numer 30, 2019, ISSN 0304-3975
Wydawca: Elsevier BV
DOI: 10.1016/j.tcs.2019.09.036

Enhanced coalgebraic bisimulation

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

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

Autorzy: Madiot, Jean-Marie; Pous, Damien; Sangiorgi, Davide
Opublikowane w: Logical Methods in Computer Science, Numer 10, 2021, ISSN 1860-5974
Wydawca: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-17(3:25)2021

Regular Language Representations in the Constructive Type Theory of Coq

Autorzy: Christian Doczkal, Gert Smolka
Opublikowane w: Journal of Automated Reasoning, Numer 61/1-4, 2018, Strona(/y) 521-553, ISSN 0168-7433
Wydawca: Kluwer Academic Publishers
DOI: 10.1007/s10817-018-9460-x

Petri Automata

Autorzy: Brunet, Paul; Pous, Damien
Opublikowane w: Logical Methods in Computer Science, 2017, ISSN 1860-5974
Wydawca: Technischen Universitat Braunschweig
DOI: 10.23638/LMCS-13(3:33)2017

A general account of coinduction up-to

Autorzy: Filippo Bonchi, Daniela Petrişan, Damien Pous, Jurriaan Rot
Opublikowane w: Acta Informatica, Numer 54/2, 2017, Strona(/y) 127-190, ISSN 0001-5903
Wydawca: Springer Verlag
DOI: 10.1007/s00236-016-0271-4

Cyclic Proofs, System T, and the Power of Contraction

Autorzy: Denis Kuperberg; Laureline Pinault; Damien Pous
Opublikowane w: Proceedings of the ACM on Programming Languages, Numer 21, 2021, ISSN 2475-1421
Wydawca: ACM
DOI: 10.1145/3434282

Companions, Causality and Codensity

Autorzy: Pous, Damien; Rot, Jurriaan
Opublikowane w: Logical Methods in Computer Science, Numer 33, 2019, ISSN 1860-5974
Wydawca: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-15(3:14)2019

Graph Theory in Coq: Minors, Treewidth, and Isomorphisms

Autorzy: Doczkal, Christian; Pous, Damien
Opublikowane w: Journal of Automated Reasoning, Numer 15, 2020, ISSN 0168-7433
Wydawca: Kluwer Academic Publishers
DOI: 10.1007/s10817-020-09543-2

Coinductive Algorithms for Büchi Automata

Autorzy: Denis Kuperberg; Laureline Pinault; Damien Pous
Opublikowane w: Fundamenta Informatica, Numer 7, 2021, ISSN 0169-2968
Wydawca: IOS Press
DOI: 10.1007/978-3-030-24886-4_15

Proof Theory of Riesz Spaces and Modal Riesz Spaces

Autorzy: Lucas, Christophe; Mio, Matteo
Opublikowane w: Proc. RAMiCS, Numer 2, 2021
Wydawca: Springer
DOI: 10.1007/978-3-030-88701-8_17

Towards a Structural Proof Theory of Probabilistic mu-Calculi

Autorzy: Christophe Lucas, Matteo Mio
Opublikowane w: Proc. FoSSaCS, 2019
Wydawca: Springer
DOI: 10.1007/978-3-030-17127-8_24

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

Autorzy: Christian Doczkal; Damien Pous
Opublikowane w: Proc. CPP, Numer 13, 2020
Wydawca: ACM Press
DOI: 10.1145/3372885.3373831

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

Autorzy: Filippo Bonchi, Ana Sokolova, Valeria Vignudelli
Opublikowane w: Proc. CALCO, 2021
Wydawca: Schloss Dagstuhl
DOI: 10.4230/lipics.calco.2021.11

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

Autorzy: Doumane, Amina; Pous, Damien
Opublikowane w: Proc. CONCUR, Numer 23, 2020
Wydawca: Schloss Dagstuhl
DOI: 10.4230/lipics.concur.2020.29

On Tools for Completeness of Kleene Algebra with Hypotheses

Autorzy: Pous, Damien; Rot, Jurriaan; Wagemaker, Jana
Opublikowane w: Proc. RAMiCS, Numer 8, 2021
Wydawca: Springer
DOI: 10.1007/978-3-030-88701-8_23

Cyclic Proofs and Jumping Automata

Autorzy: Kuperberg, Denis; Pinault, Laureline; Pous, Damien
Opublikowane w: Proc. FSTTCS, Numer 22, 2019
Wydawca: Schloss Dagstuhl
DOI: 10.4230/lipics.fsttcs.2019.45

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

Autorzy: Pous, Damien
Opublikowane w: Proc. CALCO, Numer 6, 2019
Wydawca: Schloss Dagstuhl
DOI: 10.4230/lipics.calco.2019.4

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

Autorzy: Das , Anupam; Pous , Damien
Opublikowane w: Computer Science Logic, 2018
Wydawca: Dagstuhl
DOI: 10.4230/LIPIcs.CSL.2018.18

Allegories - decidability and graph homomorphisms

Autorzy: Damien Pous, Valeria Vignudelli
Opublikowane w: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, 2018, Strona(/y) 829-838, ISBN 9781-450355834
Wydawca: ACM Press
DOI: 10.1145/3209108.3209172

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

Autorzy: Christian Doczkal, Joachim Bard
Opublikowane w: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018, 2018, Strona(/y) 42-52, ISBN 9781-450355865
Wydawca: ACM Press
DOI: 10.1145/3167088

Completeness for Identity-free Kleene Lattices

Autorzy: Doumane , Amina; Pous , Damien
Opublikowane w: The 29th International Conference on Concurrency Theory (CONCUR), 2018
Wydawca: Dagstuhl
DOI: 10.4230/LIPIcs.CONCUR.2018.18

Eager Functions as Processes

Autorzy: Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi
Opublikowane w: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, 2018, Strona(/y) 364-373, ISBN 9781-450355834
Wydawca: ACM Press
DOI: 10.1145/3209108.3209152

Divergence and unique solution of equations

Autorzy: Durier, Adrien; Hirschkoff, Daniel; Sangiorgi, Davide
Opublikowane w: 28th International Conference on Concurrency Theory - CONCUR 2017, 2017
Wydawca: Dagstuhl
DOI: 10.4230/LIPIcs.CONCUR.2017.7

Treewidth-Two Graphs as a Free Algebra

Autorzy: Christian Doczkal ; Damien Pous
Opublikowane w: Mathematical Foundations of Computer Science (MFCS), 2018
Wydawca: Dagstuhl
DOI: 10.4230/LIPIcs.MFCS.2018.60

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

Autorzy: Christian Doczkal, Guillaume Combette, Damien Pous
Opublikowane w: International Conference on Interactive Theorem Proving (ITP), 2018, Strona(/y) 178-195
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-319-94821-8_11

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

Autorzy: Bagnol , Marc; Kuperberg , Denis
Opublikowane w: FSTTCS, 2018
Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.FSTTCS.2018.16

Kleene Algebra with Hypotheses

Autorzy: Amina Doumane, Denis Kuperberg, Damien Pous, Pierre Pradic
Opublikowane w: 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, Numer 11425, 2019, Strona(/y) 207-223, ISBN 978-3-030-17126-1
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-030-17127-8_12

Left-Handed Completeness for Kleene algebra, via Cyclic Proofs

Autorzy: Anupam Das, Amina Doumane, Damien Pous
Opublikowane w: EPiC Series in Computing volume 57, 2018, Strona(/y) 271-251
Wydawca: EasyChair
DOI: 10.29007/hzq3

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

Autorzy: Henning Basold, Ekaterina Komendantskaya, Yue Li
Opublikowane w: 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, Numer 11423, 2019, Strona(/y) 783-813, ISBN 978-3-030-17183-4
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-030-17184-1_28

On the Positive Calculus of Relations with Transitive Closure

Autorzy: Damien Pous
Opublikowane w: STACS, 2018
Wydawca: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2018.3

Coinductive algorithms for Büchi automata

Autorzy: Kuperberg, Denis; Pinault, Laureline; Pous, Damien
Opublikowane w: Developments in Language Theory, 2019
Wydawca: Springer

The Theory of Traces for Systems with Probability and Nondeterminism

Autorzy: Filippo Bonchi, Ana Sokolova, Valeria Vignudelli
Opublikowane w: Logic in Computer Science, 2019
Wydawca: IEEE

A cut-free cyclic proof system for Kleene algebra

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

Companions, Codensity and Causality

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

Monoidal Company for Accessible Functors *

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

Coinduction All the Way Up

Autorzy: Damien Pous
Opublikowane w: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16, 2016, Strona(/y) 307-316, ISBN 9781-450343916
Wydawca: ACM Press
DOI: 10.1145/2933575.2934564

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

Autorzy: Malgorzata Biernacka, Dariusz Biernacki, Serguei Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt
Opublikowane w: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, Strona(/y) 1-12, ISBN 978-1-5090-3018-7
Wydawca: IEEE
DOI: 10.1109/LICS.2017.8005118

K4-free Graphs as a Free Algebra

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

A formal exploration of Nominal Kleene Algebra

Autorzy: Brunet, Paul; Pous, Damien
Opublikowane w: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS), 2016
Wydawca: LIPics Dagstuhl
DOI: 10.4230/LIPIcs.MFCS.2016.22

On Decidability of Concurrent Kleene Algebra

Autorzy: Brunet, Paul; Pous, Damien; Struth, Georg
Opublikowane w: 28th International Conference on Concurrency Theory (CONCUR 2017), 2017
Wydawca: LIPics - Dagstuhl
DOI: 10.4230/LIPIcs.CONCUR.2017.24

Cardinalities of Finite Relations in Coq

Autorzy: Paul Brunet, Damien Pous, Insa Stucke
Opublikowane w: 7th international conference on Interactive Theorem Proving (ITP), 2016, Strona(/y) 466-474
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-319-43144-4_29

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

Autorzy: Matteo Mio, Ralph Sarkis, Valeria Vignudelli
Opublikowane w: Proc. LICS, 2021
Wydawca: IEEE
DOI: 10.1109/lics52264.2021.9470717

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

Autorzy: Amina Doumane
Opublikowane w: Proc. RAMiCS, 2021
Wydawca: Springer
DOI: 10.1007/978-3-030-88701-8_9

A certificate-based approach to formally verified approximations

Autorzy: Bréhard, Florent; Mahboubi, Assia; Pous, Damien
Opublikowane w: Proc. ITP, Numer 29, 2019
Wydawca: Schloss Dagstuhl
DOI: 10.4230/lipics.itp.2019.8

Monads and Quantitative Equational Theories for Nondeterminism and Probability

Autorzy: Mio, Matteo; Vignudelli, Valeria
Opublikowane w: Proc. CONCUR, Numer 31, 2020
Wydawca: Scchloss Dagstuhl
DOI: 10.4230/lipics.concur.2020.28

On the Representation of References in the Pi-Calculus

Autorzy: Hirschkoff D.; Prebet E.; Sangiorgi D.
Opublikowane w: Proc. CONCUR, Numer 26, 2020
Wydawca: Schloss Dagstuhl
DOI: 10.4230/lipics.concur.2020.34

Graph Characterization of the Universal Theory of Relations

Autorzy: Amina Doumane
Opublikowane w: Proc. MFCS, 2021
Wydawca: Schloss Dagstuhl
DOI: 10.4230/lipics.mfcs.2021.41

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

Autorzy: Doczkal, Christian
Opublikowane w: Numer 18, 2021
Wydawca: HAL

Automata for relation algebra and formal proofs

Autorzy: Pous, Damien
Opublikowane w: HdR thesis, ENS Lyon, 2016, 2016
Wydawca: ENS de Lyon

Publikacje

Udostępnij tę stronę

Pobierz