A Correct Abstract Machine for Safe Ambients. - Daniel Hirschkoff; Damien Pous; Davide Sangiorgi (COORDINATION, 2005)

Component-Oriented Programming with Sharing: Containment is Not Ownership. - Daniel Hirschkoff; Tom Hirschowitz; Damien Pous; Alan Schmitt; Jean-Bernard Stefani (GPCE, 2005)

Up-to Techniques for Weak Bisimulation. - Damien Pous (ICALP, 2005)

Weak Bisimulation Up to Elaboration. - Damien Pous (CONCUR, 2006)

On Bisimulation Proofs for the Analysis of Distributed Abstract Machines. - Damien Pous (TGC, 2006)

A Distribution Law for CCS and a New Congruence Result for the pi-calculus - Daniel Hirschkoff; Damien Pous (CoRR, 2006)

Complete Lattices and Up-To Techniques. - Damien Pous (APLAS, 2007)

A Distribution Law for CCS and a New Congruence Result for the pi-Calculus. - Daniel Hirschkoff; Damien Pous (FoSSaCS, 2007)

An efficient abstract machine for Safe Ambients. - Daniel Hirschkoff; Damien Pous; Davide Sangiorgi (J. Log. Algebraic Methods Program., 2007)

New up-to techniques for weak bisimulation. - Damien Pous (Theor. Comput. Sci., 2007)

On characterising strong bisimilarity in a fragment of CCS with replication - Daniel Hirschkoff; Damien Pous (CoRR, 2008)

Encapsulation and Dynamic Modularity in the pi-calculus. - Daniel Hirschkoff; Aurélien Pardon; Tom Hirschowitz; Samuel Hym; Damien Pous (PLACES@DisCoTec, 2008)

A Distribution Law for CCS and a New Congruence Result for the p-calculus. - Daniel Hirschkoff; Damien Pous (Log. Methods Comput. Sci., 2008)

Using bisimulation proof techniques for the analysis of distributed abstract machines. - Damien Pous (Theor. Comput. Sci., 2008)

Techniques modulo pour les bisimulations. (Up to techniques for bisimulations). - Damien Pous (2008)

Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic. - Damien Pous (CSL, 2010)

On Bisimilarity and Substitution in Presence of Replication. - Daniel Hirschkoff; Damien Pous (ICALP (2), 2010)

An Efficient Coq Tactic for Deciding Kleene Algebras. - Thomas Braibant; Damien Pous (ITP, 2010)

Tactics for Reasoning Modulo AC in Coq. - Thomas Braibant; Damien Pous (CPP, 2011)

Innocent strategies as presheaves and interactive equivalences for CCS - Tom Hirschowitz; Damien Pous (ICE, 2011)

Strategies as sheaves and interactive equivalences for CCS - Tom Hirschowitz; Damien Pous (CoRR, 2011)

Enhancements of the bisimulation proof method. - Damien Pous; Davide Sangiorgi (Advanced Topics in Bisimulation and Coinduction, 2012)

Deciding Kleene Algebras in Coq - Thomas Braibant; Damien Pous (Log. Methods Comput. Sci., 2012)

Untyping Typed Algebras and Colouring Cyclic Linear Logic - Damien Pous (Log. Methods Comput. Sci., 2012)

Brzozowski's and Up-To Algorithms for Must Testing. - Filippo Bonchi; Georgiana Caltais; Damien Pous; Alexandra Silva 001 (APLAS, 2013)

Coalgebraic Up-to Techniques. - Damien Pous (CALCO, 2013)

Robust reconfigurations of component assemblies. - Fabienne Boyer; Olivier Gruber; Damien Pous (ICSE, 2013)

Kleene Algebra with Tests and Coq Tools for while Programs. - Damien Pous (ITP, 2013)

Checking NFA equivalence with bisimulations up to congruence. - Filippo Bonchi; Damien Pous (POPL, 2013)

Kleene Algebra with Converse. - Paul Brunet; Damien Pous (RAMiCS, 2014)

Bisimulations Up-to: Beyond First-Order Transition Systems. - Jean-Marie Madiot; Damien Pous; Davide Sangiorgi (CONCUR, 2014)

Coinduction up-to in a fibrational setting. - Filippo Bonchi; Daniela Petrisan; Damien Pous; Jurriaan Rot (CSL-LICS, 2014)

Formal verification in Coq of program properties involving the global state effect. - Jean-Guillaume Dumas; Dominique Duval; Burak Ekici; Damien Pous (JFLA, 2014)

De la KAM avec un Processus d'Ordre Supe'rieur. - Damien Pous; Alan Schmitt (JFLA, 2014)

Program certification with computational effects. - Jean-Guillaume Dumas; Dominique Duval; Burak Ekici; Damien Pous (CoRR, 2014)

Lax Bialgebras and Up-To Techniques for Weak Bisimulations. - Filippo Bonchi; Daniela Petrisan; Damien Pous; Jurriaan Rot (CONCUR, 2015)

Petri Automata for Kleene Allegories. - Paul Brunet; Damien Pous (LICS, 2015)

Relative Hilbert-Post Completeness for Exceptions. - Jean-Guillaume Dumas; Dominique Duval; Burak Ekici; Damien Pous; Jean-Claude Reynaud (MACIS, 2015)

Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests. - Damien Pous (POPL, 2015)

Coinductive techniques, from automata to coalgebra. - Damien Pous (PLMW@POPL, 2015)

Hacking nondeterminism with induction and coinduction. - Filippo Bonchi; Damien Pous (Commun. ACM, 2015)

Hilbert-Post completeness for the state and the exception effects. - Jean-Guillaume Dumas; Dominique Duval; Burak Ekici; Damien Pous; Jean-Claude Reynaud (CoRR, 2015)

Automata for relation algebra and formal proofs. - Damien Pous (2016)

Cardinalities of Finite Relations in Coq. - Paul Brunet; Damien Pous; Insa Stucke (ITP, 2016)

Coinduction All the Way Up. - Damien Pous (LICS, 2016)

A Formal Exploration of Nominal Kleene Algebra. - Paul Brunet; Damien Pous (MFCS, 2016)

Algorithms for Kleene algebra with converse. - Paul Brunet; Damien Pous (J. Log. Algebraic Methods Program., 2016)

Monoidal Company for Accessible Functors. - Henning Basold; Damien Pous; Jurriaan Rot (CALCO, 2017)

On Decidability of Concurrent Kleene Algebra. - Paul Brunet; Damien Pous; Georg Struth (CONCUR, 2017)

Companions, Codensity and Causality. - Damien Pous; Jurriaan Rot (FoSSaCS, 2017)

Fully abstract encodings of λ-calculus in HOcore through abstract machines. - Malgorzata Biernacka; Dariusz Biernacki; Sergueï Lenglet; Piotr Polesiuk; Damien Pous; Alan Schmitt (LICS, 2017)

K4-free Graphs as a Free Algebra. - Enric Cosme-Llópez; Damien Pous (MFCS, 2017)

A Cut-Free Cyclic Proof System for Kleene Algebra. - Anupam Das 002; Damien Pous (TABLEAUX, 2017)

CoInductive Automata Algorithms. - Damien Pous (CIAA, 2017)

A general account of coinduction up-to. - Filippo Bonchi; Daniela Petrisan; Damien Pous; Jurriaan Rot (Acta Informatica, 2017)

Petri Automata. - Paul Brunet; Damien Pous (Log. Methods Comput. Sci., 2017)

Enhanced coalgebraic bisimulation. - Jurriaan Rot; Filippo Bonchi; Marcello M. Bonsangue; Damien Pous; Jan Rutten; Alexandra Silva 001 (Math. Struct. Comput. Sci., 2017)

Enhanced coinduction (NII Shonan Meeting 2017-17). - Shin-ya Katsumata; Damien Pous; Jan Rutten (NII Shonan Meet. Rep., 2017)

A robust reconfiguration protocol for the dynamic update of component-based software systems. - Fabienne Boyer; Olivier Gruber; Damien Pous (Softw. Pract. Exp., 2017)

Completeness for Identity-free Kleene Lattices. - Amina Doumane; Damien Pous (CONCUR, 2018)

Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices). - Anupam Das 002; Damien Pous (CSL, 2018)

A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs. - Christian Doczkal; Guillaume Combette; Damien Pous (ITP, 2018)

Allegories: decidability and graph homomorphisms. - Damien Pous; Valeria Vignudelli (LICS, 2018)

Left-Handed Completeness for Kleene algebra, via Cyclic Proofs. - Anupam Das 002; Amina Doumane; Damien Pous (LPAR, 2018)

Treewidth-Two Graphs as a Free Algebra. - Christian Doczkal; Damien Pous (MFCS, 2018)

On the Positive Calculus of Relations with Transitive Closure. - Damien Pous (STACS, 2018)

Coinduction: Automata, Formal Proof, Companions (Invited Paper). - Damien Pous (CALCO, 2019)

Kleene Algebra with Hypotheses. - Amina Doumane; Denis Kuperberg; Damien Pous; Cécilia Pradic (FoSSaCS, 2019)

Cyclic Proofs and Jumping Automata. - Denis Kuperberg; Laureline Pinault; Damien Pous (FSTTCS, 2019)

A Certificate-Based Approach to Formally Verified Approximations. - Florent Bréhard; Assia Mahboubi; Damien Pous (ITP, 2019)

Bisimulation and Coinduction Enhancements: A Historical Perspective. - Damien Pous; Davide Sangiorgi (Formal Aspects Comput., 2019)

Relational and algebraic methods in computer science. - Peter Höfner; Damien Pous; Georg Struth (J. Log. Algebraic Methods Program., 2019)

Companions, Causality and Codensity. - Damien Pous; Jurriaan Rot (Log. Methods Comput. Sci., 2019)

Non Axiomatisability of Positive Relation Algebras with Constants, via Graph Homomorphisms. - Amina Doumane; Damien Pous (CONCUR, 2020)

Completeness of an axiomatization of graph isomorphism via graph rewriting in Coq. - Christian Doczkal; Damien Pous (CPP, 2020)

Graph Theory in Coq: Minors, Treewidth, and Isomorphisms. - Christian Doczkal; Damien Pous (J. Autom. Reason., 2020)

Coinductive Algorithms for Büchi Automata. - Denis Kuperberg; Laureline Pinault; Damien Pous (Fundam. Informaticae, 2021)

Modular coinduction up-to for higher-order languages via first-order transition systems. - Jean-Marie Madiot; Damien Pous; Davide Sangiorgi (Log. Methods Comput. Sci., 2021)

Cyclic proofs, system t, and the power of contraction. - Denis Kuperberg; Laureline Pinault; Damien Pous (Proc. ACM Program. Lang., 2021)

Corecursion Up-to via Causal Transformations. - Damien Pous; Jurriaan Rot; Ruben Turkenburg (CMCS, 2022)

Completeness Theorems for Kleene Algebra with Top. - Damien Pous; Jana Wagemaker (CONCUR, 2022)

A Finite Presentation of Graphs of Treewidth at Most Three. - Amina Doumane; Samuel Humeau 002; Damien Pous (ICALP, 2024)

Fully Abstract Encodings of $ lambda$-Calculus in HOcore through Abstract Machines. - Malgorzata Biernacka; Dariusz Biernacki; Sergueï Lenglet; Piotr Polesiuk; Damien Pous; Alan Schmitt (Log. Methods Comput. Sci., 2024)

On Tools for Completeness of Kleene Algebra with Hypotheses. - Damien Pous; Jurriaan Rot; Jana Wagemaker (Log. Methods Comput. Sci., 2024)

Completeness Theorems for Kleene algebra with tests and top. - Damien Pous; Jana Wagemaker (Log. Methods Comput. Sci., 2024)

Hypergraphs. - Damien Pous (DROPS Artifacts, 2024)

On the Two Paths Theorem and the Two Disjoint Paths Problem. - Samuel Humeau 002; Damien Pous (CoRR, 2025)

Higher Catoids, Higher Quantales and their Correspondences. - Cameron Calk; Philippe Malbos; Damien Pous; Georg Struth (Appl. Categorical Struct., 2025)