Damien Pous

Publications

Article dans une revue (20)

Higher Catoids, Higher Quantales and their Correspondences Cameron Calk,Philippe Malbos,Damien Pous,Georg Struth Applied Categorical Structures, 2025, 33 (4), pp.25. ⟨10.1007/s10485-025-09817-z⟩ Article dans une revue hal-05409389v1
On Tools for Completeness of Kleene Algebra with Hypotheses (extended version) Damien Pous,Jurriaan Rot,Jana Wagemaker Logical Methods in Computer Science, 2024, Volume 20, Issue 2, ⟨10.46298/lmcs-20(2:8)2024⟩ Article dans une revue hal-04792479v1
Completeness Theorems for Kleene algebra with tests and top Damien Pous,Jana Wagemaker Logical Methods in Computer Science, 2024, Volume 20, Issue 3, ⟨10.46298/lmcs-20(3:27)2024⟩ Article dans une revue hal-04792491v1
Fully Abstract Encodings of Lambda-Calculus in HOcore through Abstract Machines Małgorzata Biernacka,Dariusz Biernacki,Sergueï Lenglet,Piotr Polesiuk,Damien Pouset al. Logical Methods in Computer Science, 2024, 20 (3), pp.1-45. ⟨10.46298/lmcs-20(3:3)2024⟩ Article dans une revue hal-04638249v1
Modular coinduction up-to for higher-order languages via first-order transition systems Jean-Marie Madiot,Damien Pous,Davide Sangiorgi Logical Methods in Computer Science, 2021, Volume 17, Issue 3, ⟨10.46298/lmcs-17(3:25)2021⟩ Article dans une revue hal-03350199v1
Coinductive Algorithms for Büchi Automata Damien Pous,Denis Kuperberg,Laureline Pinault Fundamenta Informaticae, 2021, 180 (4), pp.351-373. ⟨10.3233/FI-2021-2046⟩ Article dans une revue hal-03364935v1
Cyclic proofs, system T, and the power of contraction Denis Kuperberg,Laureline Pinault,Damien Pous Proceedings of the ACM on Programming Languages, 2021, ⟨10.1145/3434282⟩ Article dans une revue hal-02487175v2
Graph Theory in Coq: Minors, Treewidth, and Isomorphisms Christian Doczkal,Damien Pous Journal of Automated Reasoning, 2020, ⟨10.1007/s10817-020-09543-2⟩ Article dans une revue hal-02316859v2
Bisimulation and Coinduction Enhancements: A Historical Perspective Damien Pous,Davide Sangiorgi Formal Aspects of Computing, 2019, 31 (6), pp.733-749. ⟨10.1007/s00165-019-00497-w⟩ Article dans une revue hal-02393949v1
Companions, Causality and Codensity Damien Pous,Jurriaan Rot Logical Methods in Computer Science, 2019, ⟨10.23638/LMCS-15(3:14)2019⟩ Article dans une revue hal-02330940v1
Petri Automata Paul Brunet,Damien Pous Logical Methods in Computer Science, 2017, 13 (3), pp.1-50. ⟨10.23638/LMCS-13(3:33)2017⟩ Article dans une revue hal-01934638v1
A General Account of Coinduction Up-To Filippo Bonchi,Daniela Petrişan,Damien Pous,Jurriaan Rot Acta Informatica, 2016, ⟨10.1007/s00236-016-0271-4⟩ Article dans une revue hal-01442724v1
Enhanced Coalgebraic Bisimulation Jurriaan Rot,Filippo Bonchi,Marcello Bonsangue,Damien Pous,Jan Ruttenet al. Mathematical Structures in Computer Science, 2015, ⟨10.1017/S0960129515000523⟩ Article dans une revue hal-01288960v1
Hacking nondeterminism with induction and coinduction. Filippo Bonchi,Damien Pous Communications of the ACM, 2015, 58 (2), pp.87-95. ⟨10.1145/2713167⟩ Article dans une revue hal-01284907v1
Untyping Typed Algebras and Colouring Cyclic Linear Logic (expanded) Damien Pous Logical Methods in Computer Science, 2012, ⟨10.2168/LMCS-8(2:13)2012⟩ Article dans une revue hal-01442739v1
Innocent strategies as presheaves and interactive equivalences for CCS (expanded version) Tom Hirschowitz,Damien Pous Scientific Annals of Computer Science, 2012, 22 (1), pp.147-199. ⟨10.7561/SACS.2012.1.147⟩ Article dans une revue hal-00555144v3
A Distribution Law for CCS and a New Congruence Result for the pi-calculus (expanded) Damien Pous,Daniel Hirschkoff Logical Methods in Computer Science, 2008, ⟨10.2168/LMCS-4(2:4)2008⟩ Article dans une revue hal-01442744v1
Using Bisimulation Proof Techniques for the Analysis of Distributed Algorithms Damien Pous Theoretical Computer Science, 2008, 402 (2-3), pp.199-220. ⟨10.1016/j.tcs.2008.04.035⟩ Article dans une revue ensl-00149964v3
New Up-To Techniques for Weak Bisimulation Damien Pous Theoretical Computer Science, 2007, 380, pp.164 - 180. ⟨10.1016/j.tcs.2007.02.060⟩ Article dans une revue hal-01442745v1
An Efficient Abstract Machine for Safe Ambients Daniel Hirschkoff,Damien Pous,Davide Sangiorgi Journal of Logic and Algebraic Programming, 2007, ⟨10.1016/j.jlap.2007.02.003⟩ Article dans une revue hal-01442746v1

Communication dans un congrès (57)

Adhesive category theory for graph rewriting in Rocq Samuel Arsac,Russ Harmer,Damien Pous CPP '26: 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2026, Rennes France, France. pp.59-74, ⟨10.1145/3779031.3779105⟩ Communication dans un congrès hal-05263561v2
A finite presentation of graphs of treewidth at most three Amina Doumane,Samuel Humeau,Damien Pous 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)., Jul 2024, Tallinn, Estonia. ⟨10.4230/LIPIcs.ICALP.2024.135⟩ Communication dans un congrès hal-04560570v3
Corecursion up-to via Causal Transformations Damien Pous,Jurriaan Rot,Ruben Turkenburg Coalgebraic Methods in Computer Science, Apr 2022, Munich, Germany. ⟨10.1007/978-3-031-10736-8_7⟩ Communication dans un congrès hal-03694381v1
Completeness Theorems for Kleene Algebra with Top Damien Pous,Jana Wagemaker CONCUR, Sep 2022, Varsovie, Poland. ⟨10.4230/LIPIcs.CONCUR.2022.26⟩ Communication dans un congrès hal-03644317v2
On Tools for Completeness of Kleene Algebra with Hypotheses Damien Pous,Jurriaan Rot,Jana Wagemaker 19th International Conference on Relational and Algebraic Methods in Computer Science ( RAMICS 2021 ), Nov 2021, Luminy, France. pp.378-395, ⟨10.1007/978-3-030-88701-8_23⟩ Communication dans un congrès hal-03269462v2
Completeness of an Axiomatization of Graph Isomorphism via Graph Rewriting in Coq Christian Doczkal,Damien Pous CPP 2020 - 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2020, New Orleans, LA, United States. ⟨10.1145/3372885.3373831⟩ Communication dans un congrès hal-02333553v3
Non axiomatisability of positive relation algebras with constants, via graph homomorphisms Amina Doumane,Damien Pous CONCUR, 2020, Vienne, Austria. pp.1-23, ⟨10.4230/LIPIcs.CONCUR.2020.49⟩ Communication dans un congrès hal-02870687v2
A certificate-based approach to formally verified approximations Florent Bréhard,Assia Mahboubi,Damien Pous ITP 2019 - Tenth International Conference on Interactive Theorem Proving, Sep 2019, Portland, United States. pp.1-19, ⟨10.4230/LIPIcs.ITP.2019.8⟩ Communication dans un congrès hal-02088529v2
Kleene Algebra with Hypotheses Amina Doumane,Denis Kuperberg,Damien Pous,Cécilia Pradic 22nd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), 2019, Prague, Czech Republic. pp.207-223, ⟨10.1007/978-3-030-17127-8_12⟩ Communication dans un congrès hal-02021315v2
Coinductive algorithms for Büchi automata Denis Kuperberg,Laureline Pinault,Damien Pous Developments in Language Theory, Aug 2019, Varsovie, Poland. pp.206-220, ⟨10.1007/978-3-030-24886-4_15⟩ Communication dans un congrès hal-01928701v1
Cyclic Proofs and Jumping Automata Denis Kuperberg,Laureline Pinault,Damien Pous FSTTCS, Dec 2019, Bombay, India. ⟨10.4230/LIPIcs.FSTTCS.2019.45⟩ Communication dans un congrès hal-02301651v2
Coinduction: Automata, Formal Proof, Companions (Invited Paper) Damien Pous CALCO, Jun 2019, London, United Kingdom. ⟨10.4230/LIPIcs.CALCO.2019.4⟩ Communication dans un congrès hal-02393982v1
Non-wellfounded proof theory for (Kleene+action)(algebras+lattices) Anupam Das,Damien Pous Computer Science Logic (CSL), Sep 2018, Birmingham, United Kingdom. ⟨10.4230/LIPIcs.CSL.2018.19⟩ Communication dans un congrès hal-01703942v3
Left-Handed Completeness for Kleene algebra, via Cyclic Proofs Anupam Das,Amina Doumane,Damien Pous LPAR-22, Nov 2018, Awassa, Ethiopia Communication dans un congrès hal-01940378v1
Allegories: decidability and graph homomorphisms Damien Pous,Valeria Vignudelli Logic in Computer Science, Jul 2018, Oxford, United Kingdom. ⟨10.1145/3209108.3209172⟩ Communication dans un congrès hal-01703906v2
On the Positive Calculus of Relations with Transitive Closure Damien Pous 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Feb 2018, Caen, France. ⟨10.4230/LIPIcs.STACS.2018.3⟩ Communication dans un congrès hal-01718925v1
A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs Christian Doczkal,Guillaume Combette,Damien Pous Interactive Theorem Proving, Jul 2018, Oxford, United Kingdom. ⟨10.1007/978-3-319-94821-8_11⟩ Communication dans un congrès hal-01703922v2
Treewidth-Two Graphs as a Free Algebra Christian Doczkal,Damien Pous Mathematical Foundations of Computer Science, Aug 2018, Liverpool, United Kingdom. ⟨10.4230/LIPIcs.MFCS.2018.60⟩ Communication dans un congrès hal-01780844v3
Completeness for Identity-free Kleene Lattices Amina Doumane,Damien Pous CONCUR, Sep 2018, Beijing, China. ⟨10.4230/LIPIcs.CONCUR.2018.18⟩ Communication dans un congrès hal-01780845v2
On Decidability of Concurrent Kleene Algebra Paul Brunet,Damien Pous,Georg Struth CONCUR, Sep 2017, Berlin, Germany Communication dans un congrès hal-01558108v1
Monoidal Company for Accessible Functors Henning Basold,Damien Pous,Jurriaan Rot CALCO, Jun 2017, Ljubljana, Slovenia Communication dans un congrès hal-01529340v1
K4-free Graphs as a Free Algebra Enric Cosme-Llópez,Damien Pous 42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark Communication dans un congrès hal-01515752v2
A cut-free cyclic proof system for Kleene algebra Anupam Das,Damien Pous TABLEAUX, Sep 2017, Brasilia, Brazil Communication dans un congrès hal-01558132v1
Companions, Codensity and Causality Damien Pous,Jurriaan Rot FoSSaCS, Apr 2017, Uppsala, Sweden Communication dans un congrès hal-01442222v1
Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines Małgorzata Biernacka,Dariusz Biernacki,Sergueï Lenglet,Piotr Polesiuk,Damien Pouset al. LICS 2017 - 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2017, Reykjavik, Iceland. ⟨10.1109/LICS.2017.8005118⟩ Communication dans un congrès hal-01479035v1
Cardinalities of Finite Relations in Coq with Applications Paul Brunet,Damien Pous,Insa Stucke Interative Theorem Proving, Aug 2016, Nancy, France. pp.466-474, ⟨10.1007/978-3-319-43144-4_29⟩ Communication dans un congrès hal-01441262v2
A formal exploration of Nominal Kleene Algebra Paul Brunet,Damien Pous MFCS, Aug 2016, Cracovie, Poland. ⟨10.4230/LIPIcs.MFCS.2016.22⟩ Communication dans un congrès hal-01307532v2
Coinduction All the Way Up Damien Pous Thirty-First Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2016), Jul 2016, New York, United States. ⟨10.1145/2933575.2934564⟩ Communication dans un congrès hal-01259622v2
Decidability of Identity-free Relational Kleene Lattices Paul Brunet,Damien Pous Vingt-sixièmes Journées Francophones des Langages Applicatifs (JFLA 2015), Jan 2015, Le Val d'Ajol, France Communication dans un congrès hal-01099137v1
Petri automata for Kleene allegories Paul Brunet,Damien Pous Logic in Computer Science, Jul 2015, Kyoto, Japan. pp.68-79, ⟨10.1109/LICS.2015.17⟩ Communication dans un congrès hal-01073936v3
Lax Bialgebras and Up-To Techniques for Weak Bisimulations Filippo Bonchi,Daniela Petrisan,Damien Pous,Jurriaan Rot 26th International Conference on Concurrency Theory (CONCUR), Sep 2015, Madrid, Spain. ⟨10.4230/LIPIcs.CONCUR.2015.240⟩ Communication dans un congrès hal-01285299v1
Hilbert-Post completeness for the state and the exception effects Jean-Guillaume Dumas,Dominique Duval,Burak Ekici,Jean-Claude Reynaud,Damien Pous Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS 2015), Nov 2015, Berlin, Germany. pp.596-610, ⟨10.1007/978-3-319-32859-1_51⟩ Communication dans un congrès hal-01121924v3
Coinductive techniques, from automata to coalgebra Damien Pous Programming Languages Mentoring Workshop, Jan 2015, Mumbai, India. ⟨10.1145/2792434.2792440⟩ Communication dans un congrès hal-01288791v1
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests Damien Pous POPL 2015: 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Jan 2015, Mumbai, India Communication dans un congrès hal-01021497v2
Coinduction up to in a fibrational setting Filippo Bonchi,Daniela Petrisan,Damien Pous,Jurriaan Rot CSL-LICS, Jul 2014, Vienne, Austria. pp.1-12, ⟨10.1145/2603088.2603149⟩ Communication dans un congrès hal-00936488v2
Bisimulations up-to: beyond first-order transition systems Jean-Marie Madiot,Damien Pous,Davide Sangiorgi CONCUR, Sep 2014, Rome, Italy. ⟨10.1007/978-3-662-44584-6_8⟩ Communication dans un congrès hal-00990859v1
Formal verification in Coq of program properties involving the global state effect Jean-Guillaume Dumas,Dominique Duval,Burak Ekici,Damien Pous JFLA 2014 - Journées Francophones des Langages Applicatifs, Jan 2014, Fréjus, France. pp.1-17 Communication dans un congrès hal-00869230v2
De la KAM avec un Processus d'Ordre Supérieur Damien Pous,Alan Schmitt JFLAs 2014, Jan 2014, Fréjus, France. pp.1-12 Communication dans un congrès hal-00966097v2
Kleene Algebra with Converse Paul Brunet,Damien Pous RAMiCS, Apr 2014, Marienstatt im Westerwald, Germany. pp.101-118 Communication dans un congrès hal-00938235v1
Checking NFA equivalence with bisimulations up to congruence Filippo Bonchi,Damien Pous Principle of Programming Languages (POPL), Jan 2013, Roma, Italy. pp.457-468, ⟨10.1145/2429069.2429124⟩ Communication dans un congrès hal-00639716v5
Kleene Algebra with Tests and Coq Tools for While Programs Damien Pous Interactive Theorem Proving 2013, Jul 2013, Rennes, France. pp.180-196, ⟨10.1007/978-3-642-39634-2_15⟩ Communication dans un congrès hal-00785969v1
Robust reconfigurations of component assemblies Fabienne Boyer,Olivier Gruber,Damien Pous ICSE '13 - International Conference on Software Engineering, May 2013, San Francisco, United States. pp.13-22 Communication dans un congrès hal-00966078v1
Brzozowski's and Up-To Algorithms for Must Testing Filippo Bonchi,Georgiana Caltais,Damien Pous,Alexandra Silva 11th Asian Symposium on Programming Languages and Systems (APLAS), Dec 2013, Melbourne, Australia. pp.1-16, ⟨10.1007/978-3-319-03542-0_1⟩ Communication dans un congrès hal-00966072v1
Coalgebraic Up-to Techniques Damien Pous CALCO, Sep 2013, Warsaw, Poland. ⟨10.1007/978-3-642-40206-7_4⟩ Communication dans un congrès istex hal-00966075v1
Innocent strategies as presheaves and interactive equivalences for CCS Tom Hirschowitz,Damien Pous ICE, Jun 2011, Reykjavik, Iceland. pp.2-24, ⟨10.4204/EPTCS.59.2⟩ Communication dans un congrès hal-00616648v1
Tactics for Reasoning modulo AC in Coq Thomas Braibant,Damien Pous Certified Proofs and Programs, 2011, Taiwan. pp167-182, ⟨10.1007/978-3-642-25379-9_14⟩ Communication dans un congrès hal-00484871v4
Deciding Kleene Algebras in Coq Thomas Braibant,Damien Pous ITP, Aug 2010, Edinburgh, United Kingdom. pp.163-178, ⟨10.1007/978-3-642-14052-5_13⟩ Communication dans un congrès hal-00383070v5
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic Damien Pous Computer Science Logic, Aug 2010, Brno, Czech Republic. pp.484-498, ⟨10.1007/978-3-642-15205-4_37⟩ Communication dans un congrès hal-00421158v4
On Bisimilarity and Substitution in Presence of Replication Daniel Hirschkoff,Damien Pous ICALP, Jul 2010, Bordeaux, France. pp.454-465, ⟨10.1007/978-3-642-14162-1_38⟩ Communication dans un congrès hal-00375604v4
Encapsulation and Dynamic Modularity in the Pi-Calculus Daniel Hirschkoff,Aurélien Pardon,Tom Hirschowitz,Samuel Hym,Damien Pous PLACES 2008, 2008, Oslo, Norway. pp.85 - 100, ⟨10.1016/j.entcs.2009.06.005⟩ Communication dans un congrès hal-00400159v1
A Distribution Law for CCS and a New Congruence Result for the pi-calculus Daniel Hirschkoff,Damien Pous FoSSaCS, 2007, Braga, Portugal. ⟨10.1007/978-3-540-71389-0_17⟩ Communication dans un congrès hal-00089219v4
Complete Lattices and Up-to Techniques Damien Pous 5th Asian Symposium on Programming Languages and Systems, Joxan Jaffar, 2007, Singapore, Singapore. pp.351-366, ⟨10.1007/978-3-540-76637-7_24⟩ Communication dans un congrès ensl-00155308v2
On Bisimulation Proofs for the Analysis of Distributed Abstract Machines Damien Pous TGC, 2006, Lucca, Italy. ⟨10.1007/978-3-540-75336-0_10⟩ Communication dans un congrès hal-01441457v1
Weak Bisimulation Up to Elaboration Damien Pous CONCUR, 2006, Bonn, Germany. pp.390 - 405, ⟨10.1007/11817949_26⟩ Communication dans un congrès hal-01441462v1
Component-Oriented Programming with Sharing: Containment is not Ownership Daniel Hirschkoff,Tom Hirschowitz,Damien Pous,Alan Schmitt,Jean-Bernard Stefani Generative Programming and Component Engineering (GPCE), 2005, Tallinn, Estonia. pp.389-404, ⟨10.1007/11561347_26⟩ Communication dans un congrès hal-00310126v1
Up-to Techniques for Weak Bisimulation Damien Pous ICALP, 2005, Lisbonne, Portugal. pp.730 - 741, ⟨10.1007/11523468_59⟩ Communication dans un congrès hal-01441463v1
A Correct Abstract Machine for Safe Ambients Daniel Hirschkoff,Damien Pous,Davide Sangiorgi COORDINATION, 2005, Namur, Belgium. ⟨10.1007/11417019_2⟩ Communication dans un congrès hal-01441466v1

Chapitre d'ouvrage (1)

Enhancements of the bisimulation proof method Damien Pous,Davide Sangiorgi Davide Sangiorgi and Jan Rutten. Advanced Topics in Bisimulation and Coinduction, Cambridge University Press, 2012 Chapitre d'ouvrage hal-00909391v1

Rapport (2)

Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines Małgorzata Biernacka,Dariusz Biernacki,Sergueï Lenglet,Piotr Polesiuk,Damien Pouset al. [Research Report] RR-9052, Inria. 2017 Rapport (rapport de recherche) hal-01507625v1
Decidability of Identity-free Relational Kleene Lattices Paul Brunet,Damien Pous [Research Report] ENS de Lyon. 2014 Rapport (rapport de recherche) hal-01073932v1

Thèse (1)

Techniques modulo pour les bisimulations Damien Pous Informatique [cs]. ENS Lyon, 2008. Français. ⟨NNT : ⟩ Thèse tel-01441480v1

HDR (1)

Automata for relation algebra and formal proofs Damien Pous Computer Science [cs]. ENS Lyon, 2016 HDR tel-01445821v1

Proceedings/Recueil des communications (1)

16th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS), Proceedings Peter Höfner,Damien Pous,Georg Struth Peter Hôfner, Damien Pous, Georg Struth. 16th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS), 2017, Lyon, France. 10226, Springer, 2017, Proceedings of RAMiCS 2017 Proceedings/Recueil des communications hal-02147353v1

Logiciel (8)

Hypergraphs Damien Pous 2024, ⟨swh:1:dir:da2a8407423406fdf9245865182978f4987c53ba;origin=https://github.com/damien-pous/hypergraph;visit=swh:1:snp:3525f0e39473f1c5a1a89db0d76cdb4e1494de3a;anchor=swh:1:rev:cd81a1c98f658ddbf4c3e6cd292006411c3a66fe⟩ Logiciel hal-05007264v1
Graph Theory in Rocq Christian Doczkal,Damien Pous 2019, ⟨swh:1:dir:704919fed5f407972dd1087cbe0f5950aa9e07c7;origin=https://github.com/rocq-community/graph-theory;visit=swh:1:snp:fcf1fe871ca8c8ccd680b31fbcfeb9f6f3413a4b;anchor=swh:1:rev:82376417471e50319511ab86c3a0a912d30c2408⟩ Logiciel hal-05007235v1
Certified Chebyshev models in Rocq Damien Pous,Florent Bréhard,Louis Gaillard,Assia Mahboubi 2019, ⟨swh:1:dir:6cdde290b1103523b5da14286df67b8df99b14a4;origin=https://github.com/damien-pous/approx-models;visit=swh:1:snp:0b56d5fef783663a395578bc5fb64f9f8afa0342;anchor=swh:1:rev:2304ba7730fbb293d4cb55f609994d7bdaf4e83f⟩ Logiciel hal-05008009v1
Coinduction for Rocq Damien Pous 2016, ⟨swh:1:dir:60354e7c6f1de3c6fb6f9802bc51388389e595c7;origin=https://github.com/damien-pous/coinduction;visit=swh:1:snp:4bea1f2a79556640b9efa975f8ddcd40056da2ed;anchor=swh:1:rev:823b424778feff8fbd9759bc3a044435ea4902d1⟩ Logiciel hal-05007399v1
SAFA: Symbolic Algorithms for Finite Automata Damien Pous 2015, ⟨swh:1:dir:5f1e86a3d4cc494f4770536f6a488b198a4ea26b;origin=https://github.com/damien-pous/safa;visit=swh:1:snp:6d73be34ea9df77ea2f162e706870d505220823f;anchor=swh:1:rev:4c1b478b10864c4b8a6de4457816f4861f3b131d⟩ Logiciel hal-05007633v1
SymKAT: Symbolic Algorithms for Kleene algebra with Tests (KAT) Damien Pous 2014, ⟨swh:1:dir:438007062016994a4be44c7ab67d2aafe667d166;origin=https://github.com/damien-pous/symkat;visit=swh:1:snp:d190ce756c596d30ae43ada19de0ab83566e7bcc;anchor=swh:1:rev:4c7bc8877bc85e7a368cc430067f0d291706ac17⟩ Logiciel hal-05007635v1
Relation algebra and Kleene algebra in Rocq Damien Pous 2012, ⟨swh:1:dir:c9561374fb8aab89048b993ac68715b765262c13;origin=https://github.com/damien-pous/relation-algebra;visit=swh:1:snp:1a29f5f9a0d4688ceb46cc789085969f29d710c9;anchor=swh:1:rev:b8b932d33e24d2db5b3360e7ec442b8092a22303⟩ Logiciel hal-05007316v1
AAC-Tactics for Rocq Damien Pous,Thomas Braibant,Fabian Kunze,Karl Palmskog 2010, ⟨swh:1:dir:d5d22e1835baf1009970a827b49c9733ecbf5ce9;origin=https://github.com/rocq-community/aac-tactics;visit=swh:1:snp:d2c66d06f723377571f45280977c7697d38053cf;anchor=swh:1:rev:7a7f4a61fa5830f5a3170ca62b13b3fed6d546ab⟩ Logiciel hal-05007361v1