Damien Pous - RankMe

108 papers A* 9A 1B 31C 6Journal 47Unranked 11

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