Damien Pous

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 57

Top Venues

CoRR

CONCUR

Log. Methods Comput. Sci.

LICS

École normale supérieure de Lyon, France (PHD)

Education History

École normale supérieure de Lyon, France

PHD

Publications

Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt
Fully Abstract Encodings of $\lambda$-Calculus in HOcore through Abstract Machines. Log. Methods Comput. Sci. 20 (3) (2024)
Amina Doumane, Samuel Humeau, Damien Pous
A Finite Presentation of Graphs of Treewidth at Most Three. ICALP (2024)
Damien Pous, Jurriaan Rot, Jana Wagemaker
On Tools for Completeness of Kleene Algebra with Hypotheses. Log. Methods Comput. Sci. 20 (2) (2024)
Damien Pous, Jana Wagemaker
Completeness Theorems for Kleene algebra with tests and top. CoRR (2023)
Cameron Calk, Philippe Malbos, Damien Pous, Georg Struth
Higher Catoids, Higher Quantales and their Correspondences. CoRR (2023)
Damien Pous, Jana Wagemaker
Completeness Theorems for Kleene Algebra with Top. CONCUR (2022)
Damien Pous, Jurriaan Rot, Jana Wagemaker
On Tools for Completeness of Kleene Algebra with Hypotheses. CoRR (2022)
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt
Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines. CoRR (2022)
Damien Pous, Jurriaan Rot, Ruben Turkenburg
Corecursion Up-to via Causal Transformations. CMCS (2022)
Denis Kuperberg, Laureline Pinault, Damien Pous
Coinductive Algorithms for Büchi Automata. Fundam. Informaticae 180 (4) (2021)
Damien Pous, Jurriaan Rot, Jana Wagemaker
On Tools for Completeness of Kleene Algebra with Hypotheses. RAMiCS (2021)
Jean-Marie Madiot, Damien Pous, Davide Sangiorgi
Modular coinduction up-to for higher-order languages via first-order transition systems. Log. Methods Comput. Sci. 17 (3) (2021)
Denis Kuperberg, Laureline Pinault, Damien Pous
Cyclic proofs, system t, and the power of contraction. Proc. ACM Program. Lang. 5 (POPL) (2021)
Amina Doumane, Damien Pous
Non Axiomatisability of Positive Relation Algebras with Constants, via Graph Homomorphisms. CONCUR (2020)
Jean-Marie Madiot, Damien Pous, Davide Sangiorgi
Modular coinduction up-to for higher-order languages via first-order transition systems. CoRR (2020)
Christian Doczkal, Damien Pous
Graph Theory in Coq: Minors, Treewidth, and Isomorphisms. J. Autom. Reason. 64 (5) (2020)
Christian Doczkal, Damien Pous
Completeness of an axiomatization of graph isomorphism via graph rewriting in Coq. CPP (2020)
Damien Pous
Coinduction: Automata, Formal Proof, Companions (Invited Paper). CALCO (2019)
Denis Kuperberg, Laureline Pinault, Damien Pous
Coinductive Algorithms for Büchi Automata. DLT (2019)
Denis Kuperberg, Laureline Pinault, Damien Pous
Cyclic Proofs and Jumping Automata. FSTTCS (2019)
Amina Doumane, Denis Kuperberg, Damien Pous, Pierre Pradic
Kleene Algebra with Hypotheses. FoSSaCS (2019)
Peter Höfner, Damien Pous, Georg Struth
Relational and algebraic methods in computer science. J. Log. Algebraic Methods Program. 106 (2019)
Florent Bréhard, Assia Mahboubi, Damien Pous
A Certificate-Based Approach to Formally Verified Approximations. ITP (2019)
Damien Pous, Davide Sangiorgi
Bisimulation and Coinduction Enhancements: A Historical Perspective. Formal Aspects Comput. 31 (6) (2019)
Damien Pous, Jurriaan Rot
Companions, Causality and Codensity. Log. Methods Comput. Sci. 15 (3) (2019)
Anupam Das, Damien Pous
Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices). CSL (2018)
Christian Doczkal, Guillaume Combette, Damien Pous
A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs. ITP (2018)
Anupam Das, Amina Doumane, Damien Pous
Left-Handed Completeness for Kleene algebra, via Cyclic Proofs. LPAR (2018)
Damien Pous, Valeria Vignudelli
Allegories: decidability and graph homomorphisms. LICS (2018)
Damien Pous
On the Positive Calculus of Relations with Transitive Closure. STACS (2018)
Christian Doczkal, Damien Pous
Treewidth-Two Graphs as a Free Algebra. MFCS (2018)
Amina Doumane, Damien Pous
Completeness for Identity-free Kleene Lattices. CONCUR (2018)
Damien Pous
CoInductive Automata Algorithms. CIAA (2017)
Damien Pous, Jurriaan Rot
Companions, Causality and Codensity. CoRR (2017)
Shin-ya Katsumata, Damien Pous, Jan Rutten
Enhanced coinduction (NII Shonan Meeting 2017-17). NII Shonan Meet. Rep. 2017 (2017)
Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot
A general account of coinduction up-to. Acta Informatica 54 (2) (2017)
Paul Brunet, Damien Pous
Petri Automata. CoRR (2017)
Anupam Das, Damien Pous
A Cut-Free Cyclic Proof System for Kleene Algebra. TABLEAUX (2017)
Fabienne Boyer, Olivier Gruber, Damien Pous
A robust reconfiguration protocol for the dynamic update of component-based software systems. Softw. Pract. Exp. 47 (11) (2017)
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt
Fully abstract encodings of λ-calculus in HOcore through abstract machines. LICS (2017)
Jurriaan Rot, Filippo Bonchi, Marcello M. Bonsangue, Damien Pous, Jan Rutten, Alexandra Silva
Enhanced coalgebraic bisimulation. Math. Struct. Comput. Sci. 27 (7) (2017)
Paul Brunet, Damien Pous, Georg Struth
On Decidability of Concurrent Kleene Algebra. CONCUR (2017)
Paul Brunet, Damien Pous
Petri Automata. Log. Methods Comput. Sci. 13 (3) (2017)
Enric Cosme-Llópez, Damien Pous
K4-free Graphs as a Free Algebra. MFCS (2017)
Henning Basold, Damien Pous, Jurriaan Rot
Monoidal Company for Accessible Functors. CALCO (2017)
Damien Pous, Jurriaan Rot
Companions, Codensity and Causality. FoSSaCS (2017)
Paul Brunet, Damien Pous
A Formal Exploration of Nominal Kleene Algebra. MFCS (2016)
Paul Brunet, Damien Pous, Insa Stucke
Cardinalities of Finite Relations in Coq. ITP (2016)
Damien Pous
Coinduction All the Way Up. LICS (2016)
Paul Brunet, Damien Pous
Algorithms for Kleene algebra with converse. J. Log. Algebraic Methods Program. 85 (4) (2016)
Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot
Lax Bialgebras and Up-To Techniques for Weak Bisimulations. CONCUR (2015)
Damien Pous
Coinductive techniques, from automata to coalgebra. PLMW@POPL (2015)
Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous, Jean-Claude Reynaud
Relative Hilbert-Post Completeness for Exceptions. MACIS (2015)
Paul Brunet, Damien Pous
Petri Automata for Kleene Allegories. LICS (2015)
Damien Pous
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests. POPL (2015)
Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous, Jean-Claude Reynaud
Hilbert-Post completeness for the state and the exception effects. CoRR (2015)
Filippo Bonchi, Damien Pous
Hacking nondeterminism with induction and coinduction. Commun. ACM 58 (2) (2015)
Damien Pous, Alan Schmitt
De la KAM avec un Processus d'Ordre Supe'rieur. JFLA (2014)
Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot
Coinduction up-to in a fibrational setting. CSL-LICS (2014)
Paul Brunet, Damien Pous
Kleene Algebra with Converse. RAMiCS (2014)
Damien Pous
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests. CoRR (2014)
Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous
Formal verification in Coq of program properties involving the global state effect. JFLA (2014)
Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous
Program certification with computational effects. CoRR (2014)
Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot
Coinduction up to in a fibrational setting. CoRR (2014)
Jean-Marie Madiot, Damien Pous, Davide Sangiorgi
Bisimulations Up-to: Beyond First-Order Transition Systems. CONCUR (2014)
Filippo Bonchi, Georgiana Caltais, Damien Pous, Alexandra Silva
Brzozowski's and Up-To Algorithms for Must Testing. APLAS (2013)
Damien Pous
Coalgebraic Up-to Techniques. CALCO (2013)
Damien Pous
Kleene Algebra with Tests and Coq Tools for while Programs. ITP (2013)
Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous
Formal verification in Coq of program properties involving the global state effect. CoRR (2013)
Fabienne Boyer, Olivier Gruber, Damien Pous
Robust reconfigurations of component assemblies. ICSE (2013)
Filippo Bonchi, Damien Pous
Checking NFA equivalence with bisimulations up to congruence. POPL (2013)
Damien Pous
Kleene Algebra with Tests and Coq Tools for While Programs CoRR (2013)
Thomas Braibant, Damien Pous
Deciding Kleene Algebras in Coq Log. Methods Comput. Sci. 8 (1) (2012)
Damien Pous
Untyping Typed Algebras and Colouring Cyclic Linear Logic Log. Methods Comput. Sci. 8 (2) (2012)
Tom Hirschowitz, Damien Pous
Innocent Strategies as Presheaves and Interactive Equivalences for CCS. Sci. Ann. Comput. Sci. 22 (1) (2012)
Tom Hirschowitz, Damien Pous
Strategies as sheaves and interactive equivalences for CCS CoRR (2011)
Tom Hirschowitz, Damien Pous
Innocent strategies as presheaves and interactive equivalences for CCS ICE (2011)
Thomas Braibant, Damien Pous
Tactics for Reasoning Modulo AC in Coq. CPP (2011)
Thomas Braibant, Damien Pous
Tactics for Reasoning modulo AC in Coq CoRR (2011)
Daniel Hirschkoff, Damien Pous
On Bisimilarity and Substitution in Presence of Replication. ICALP (2) (2010)
Thomas Braibant, Damien Pous
An Efficient Coq Tactic for Deciding Kleene Algebras. ITP (2010)
Damien Pous
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic. CSL (2010)
Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous
Encapsulation and Dynamic Modularity in the Pi-Calculus CoRR (2009)
Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous
Encapsulation and Dynamic Modularity in the pi-calculus. Electron. Notes Theor. Comput. Sci. 241 (2009)
Daniel Hirschkoff, Damien Pous
On characterising strong bisimilarity in a fragment of CCS with replication CoRR (2008)
Daniel Hirschkoff, Damien Pous
A Distribution Law for CCS and a New Congruence Result for the p-calculus. Log. Methods Comput. Sci. 4 (2) (2008)
Damien Pous
Using bisimulation proof techniques for the analysis of distributed abstract machines. Theor. Comput. Sci. 402 (2-3) (2008)
Daniel Hirschkoff, Damien Pous, Davide Sangiorgi
An efficient abstract machine for Safe Ambients. J. Log. Algebraic Methods Program. 71 (2) (2007)
Damien Pous
New up-to techniques for weak bisimulation. Theor. Comput. Sci. 380 (1-2) (2007)
Daniel Hirschkoff, Damien Pous
-Calculus. FoSSaCS (2007)
Damien Pous
Complete Lattices and Up-To Techniques. APLAS (2007)
Daniel Hirschkoff, Damien Pous
A Distribution Law for CCS and a New Congruence Result for the pi-calculus CoRR (2006)
Damien Pous
Weak Bisimulation Up to Elaboration. CONCUR (2006)
Damien Pous
On Bisimulation Proofs for the Analysis of Distributed Abstract Machines. TGC (2006)
Daniel Hirschkoff, Damien Pous, Davide Sangiorgi
A Correct Abstract Machine for Safe Ambients. COORDINATION (2005)
Damien Pous
Up-to Techniques for Weak Bisimulation. ICALP (2005)
Daniel Hirschkoff, Tom Hirschowitz, Damien Pous, Alan Schmitt, Jean-Bernard Stefani
Component-Oriented Programming with Sharing: Containment is Not Ownership. GPCE (2005)

Damien Pous.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Damien Pous