Damien Pous

According to our database, Damien Pous authored at least 84 papers between 2005 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2023

Higher Catoids, Higher Quantales and their Correspondences.

Cameron Calk, Philippe Malbos, Damien Pous, Georg Struth

CoRR, 2023

Completeness Theorems for Kleene algebra with tests and top.

Damien Pous, Jana Wagemaker

CoRR, 2023

2022

Completeness Theorems for Kleene Algebra with Top.

Damien Pous, Jana Wagemaker

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

Corecursion Up-to via Causal Transformations.

Damien Pous, Jurriaan Rot, Ruben Turkenburg

Proceedings of the Coalgebraic Methods in Computer Science, 2022

2021

Cyclic proofs, system t, and the power of contraction.

Denis Kuperberg, Laureline Pinault, Damien Pous

Proc. ACM Program. Lang., 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

Coinductive Algorithms for Büchi Automata.

Denis Kuperberg, Laureline Pinault, Damien Pous

Fundam. Informaticae, 2021

On Tools for Completeness of Kleene Algebra with Hypotheses.

Damien Pous, Jurriaan Rot, Jana Wagemaker

Proceedings of the Relational and Algebraic Methods in Computer Science, 2021

2020

Graph Theory in Coq: Minors, Treewidth, and Isomorphisms.

Christian Doczkal, Damien Pous

J. Autom. Reason., 2020

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

Christian Doczkal, Damien Pous

Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020

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

Amina Doumane, Damien Pous

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Companions, Causality and Codensity.

Damien Pous, Jurriaan Rot

Log. Methods Comput. Sci., 2019

Relational and algebraic methods in computer science.

Peter Höfner, Damien Pous, Georg Struth

J. Log. Algebraic Methods Program., 2019

Bisimulation and Coinduction Enhancements: A Historical Perspective.

Damien Pous, Davide Sangiorgi

Formal Aspects Comput., 2019

A Certificate-Based Approach to Formally Verified Approximations.

Florent Bréhard, Assia Mahboubi, Damien Pous

Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

Cyclic Proofs and Jumping Automata.

Denis Kuperberg, Laureline Pinault, Damien Pous

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Kleene Algebra with Hypotheses.

Amina Doumane, Denis Kuperberg, Damien Pous, Cécilia Pradic

Proceedings of the Foundations of Software Science and Computation Structures, 2019

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

Damien Pous

Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

2018

On the Positive Calculus of Relations with Transitive Closure.

Damien Pous

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Treewidth-Two Graphs as a Free Algebra.

Christian Doczkal, Damien Pous

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Left-Handed Completeness for Kleene algebra, via Cyclic Proofs.

Anupam Das, Amina Doumane, Damien Pous

Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Allegories: decidability and graph homomorphisms.

Damien Pous, Valeria Vignudelli

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

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

Christian Doczkal, Guillaume Combette, Damien Pous

Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices).

Anupam Das, Damien Pous

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

Completeness for Identity-free Kleene Lattices.

Amina Doumane, Damien Pous

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017

A robust reconfiguration protocol for the dynamic update of component-based software systems.

Fabienne Boyer, Olivier Gruber, Damien Pous

Softw. Pract. Exp., 2017

Enhanced coinduction (NII Shonan Meeting 2017-17).

Shin-ya Katsumata, Damien Pous, Jan Rutten

NII Shonan Meet. Rep., 2017

Enhanced coalgebraic bisimulation.

Jurriaan Rot, Filippo Bonchi, Marcello M. Bonsangue, Damien Pous, Jan Rutten, Alexandra Silva

Math. Struct. Comput. Sci., 2017

Petri Automata.

Paul Brunet, Damien Pous

Log. Methods Comput. Sci., 2017

A general account of coinduction up-to.

Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot

Acta Informatica, 2017

CoInductive Automata Algorithms.

Damien Pous

Proceedings of the Implementation and Application of Automata, 2017

A Cut-Free Cyclic Proof System for Kleene Algebra.

Anupam Das, Damien Pous

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

K4-free Graphs as a Free Algebra.

Enric Cosme-Llópez, Damien Pous

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

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

Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Companions, Codensity and Causality.

Damien Pous, Jurriaan Rot

Proceedings of the Foundations of Software Science and Computation Structures, 2017

On Decidability of Concurrent Kleene Algebra.

Paul Brunet, Damien Pous, Georg Struth

Proceedings of the 28th International Conference on Concurrency Theory, 2017

Monoidal Company for Accessible Functors.

Henning Basold, Damien Pous, Jurriaan Rot

Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

2016

Algorithms for Kleene algebra with converse.

Paul Brunet, Damien Pous

J. Log. Algebraic Methods Program., 2016

A Formal Exploration of Nominal Kleene Algebra.

Paul Brunet, Damien Pous

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Coinduction All the Way Up.

Damien Pous

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Cardinalities of Finite Relations in Coq.

Paul Brunet, Damien Pous, Insa Stucke

Proceedings of the Interactive Theorem Proving - 7th International Conference, 2016

Automata for relation algebra and formal proofs.

Damien Pous

, 2016

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

Hacking nondeterminism with induction and coinduction.

Filippo Bonchi, Damien Pous

Commun. ACM, 2015

Coinductive techniques, from automata to coalgebra.

Damien Pous

Proceedings of the Programming Languages Mentoring Workshop, 2015

Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests.

Damien Pous

Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Relative Hilbert-Post Completeness for Exceptions.

Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous, Jean-Claude Reynaud

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

Petri Automata for Kleene Allegories.

Paul Brunet, Damien Pous

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Lax Bialgebras and Up-To Techniques for Weak Bisimulations.

Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot

Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014

Program certification with computational effects.

Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous

CoRR, 2014

De la KAM avec un Processus d'Ordre Supe'rieur.

Damien Pous, Alan Schmitt

Proceedings of the 25. Journées francophones des langages applicatifs, 2014

Formal verification in Coq of program properties involving the global state effect.

Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous

Proceedings of the 25. Journées francophones des langages applicatifs, 2014

Coinduction up-to in a fibrational setting.

Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Bisimulations Up-to: Beyond First-Order Transition Systems.

Jean-Marie Madiot, Damien Pous, Davide Sangiorgi

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Kleene Algebra with Converse.

Paul Brunet, Damien Pous

Proceedings of the Relational and Algebraic Methods in Computer Science, 2014

2013

Checking NFA equivalence with bisimulations up to congruence.

Filippo Bonchi, Damien Pous

Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

Kleene Algebra with Tests and Coq Tools for while Programs.

Damien Pous

Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

Robust reconfigurations of component assemblies.

Fabienne Boyer, Olivier Gruber, Damien Pous

Proceedings of the 35th International Conference on Software Engineering, 2013

Coalgebraic Up-to Techniques.

Damien Pous

Proceedings of the Algebra and Coalgebra in Computer Science, 2013

Brzozowski's and Up-To Algorithms for Must Testing.

Filippo Bonchi, Georgiana Caltais, Damien Pous, Alexandra Silva

Proceedings of the Programming Languages and Systems - 11th Asian Symposium, 2013

2012

Untyping Typed Algebras and Colouring Cyclic Linear Logic

Damien Pous

Log. Methods Comput. Sci., 2012

Deciding Kleene Algebras in Coq

Thomas Braibant, Damien Pous

Log. Methods Comput. Sci., 2012

Enhancements of the bisimulation proof method.

Damien Pous, Davide Sangiorgi

Proceedings of the Advanced Topics in Bisimulation and Coinduction., 2012

2011

Strategies as sheaves and interactive equivalences for CCS

Tom Hirschowitz, Damien Pous

CoRR, 2011

Innocent strategies as presheaves and interactive equivalences for CCS

Tom Hirschowitz, Damien Pous

Proceedings of the Proceedings Fourth Interaction and Concurrency Experience, 2011

Tactics for Reasoning Modulo AC in Coq.

Thomas Braibant, Damien Pous

Proceedings of the Certified Programs and Proofs - First International Conference, 2011

2010

An Efficient Coq Tactic for Deciding Kleene Algebras.

Thomas Braibant, Damien Pous

Proceedings of the Interactive Theorem Proving, First International Conference, 2010

On Bisimilarity and Substitution in Presence of Replication.

Daniel Hirschkoff, Damien Pous

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic.

Damien Pous

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2008

Techniques modulo pour les bisimulations. (Up to techniques for bisimulations).

Damien Pous

PhD thesis, 2008

Using bisimulation proof techniques for the analysis of distributed abstract machines.

Damien Pous

Theor. Comput. Sci., 2008

A Distribution Law for CCS and a New Congruence Result for the p-calculus.

Daniel Hirschkoff, Damien Pous

Log. Methods Comput. Sci., 2008

Encapsulation and Dynamic Modularity in the pi-calculus.

Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous

Proceedings of the First Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, 2008

On characterising strong bisimilarity in a fragment of CCS with replication

Daniel Hirschkoff, Damien Pous

CoRR, 2008

2007

New up-to techniques for weak bisimulation.

Damien Pous

Theor. Comput. Sci., 2007

An efficient abstract machine for Safe Ambients.

Daniel Hirschkoff, Damien Pous, Davide Sangiorgi

J. Log. Algebraic Methods Program., 2007

A Distribution Law for CCS and a New Congruence Result for the <i>pi</i>-Calculus.

Daniel Hirschkoff, Damien Pous

Proceedings of the Foundations of Software Science and Computational Structures, 2007

Complete Lattices and Up-To Techniques.

Damien Pous

Proceedings of the Programming Languages and Systems, 5th Asian Symposium, 2007

2006

A Distribution Law for CCS and a New Congruence Result for the pi-calculus

Daniel Hirschkoff, Damien Pous

CoRR, 2006

On Bisimulation Proofs for the Analysis of Distributed Abstract Machines.

Damien Pous

Proceedings of the Trustworthy Global Computing, Second Symposium, 2006

Weak Bisimulation Up to Elaboration.

Damien Pous

Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005

Up-to Techniques for Weak Bisimulation.

Damien Pous

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Component-Oriented Programming with Sharing: Containment is Not Ownership.

Daniel Hirschkoff, Tom Hirschowitz, Damien Pous, Alan Schmitt, Jean-Bernard Stefani

Proceedings of the Generative Programming and Component Engineering, 2005

A Correct Abstract Machine for Safe Ambients.

Daniel Hirschkoff, Damien Pous, Davide Sangiorgi

Proceedings of the Coordination Models and Languages, 7th International Conference, 2005