default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDamien Pous
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Damien Pous, Jurriaan Rot, Jana Wagemaker:
On Tools for Completeness of Kleene Algebra with Hypotheses. Log. Methods Comput. Sci. 20(2) (2024)- [j22]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) - [j21]Damien Pous, Jana Wagemaker:
Completeness Theorems for Kleene algebra with tests and top. Log. Methods Comput. Sci. 20(3) (2024) - [c55]Amina Doumane, Samuel Humeau, Damien Pous:
A Finite Presentation of Graphs of Treewidth at Most Three. ICALP 2024: 135:1-135:18 - 2023
- [i20]Damien Pous, Jana Wagemaker:
Completeness Theorems for Kleene algebra with tests and top. CoRR abs/2304.07190 (2023) - [i19]Cameron Calk, Philippe Malbos, Damien Pous, Georg Struth:
Higher Catoids, Higher Quantales and their Correspondences. CoRR abs/2307.09253 (2023) - 2022
- [c54]Damien Pous
, Jurriaan Rot, Ruben Turkenburg:
Corecursion Up-to via Causal Transformations. CMCS 2022: 133-154 - [c53]Damien Pous, Jana Wagemaker:
Completeness Theorems for Kleene Algebra with Top. CONCUR 2022: 26:1-26:18 - [i18]Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt:
Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines. CoRR abs/2205.06665 (2022) - [i17]Damien Pous, Jurriaan Rot, Jana Wagemaker:
On Tools for Completeness of Kleene Algebra with Hypotheses. CoRR abs/2210.13020 (2022) - 2021
- [j20]Denis Kuperberg, Laureline Pinault, Damien Pous:
Coinductive Algorithms for Büchi Automata. Fundam. Informaticae 180(4): 351-373 (2021) - [j19]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) - [j18]Denis Kuperberg, Laureline Pinault, Damien Pous:
Cyclic proofs, system t, and the power of contraction. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - [c52]Damien Pous, Jurriaan Rot, Jana Wagemaker:
On Tools for Completeness of Kleene Algebra with Hypotheses. RAMiCS 2021: 378-395 - 2020
- [j17]Christian Doczkal, Damien Pous:
Graph Theory in Coq: Minors, Treewidth, and Isomorphisms. J. Autom. Reason. 64(5): 795-825 (2020) - [c51]Amina Doumane, Damien Pous:
Non Axiomatisability of Positive Relation Algebras with Constants, via Graph Homomorphisms. CONCUR 2020: 29:1-29:16 - [c50]Christian Doczkal, Damien Pous:
Completeness of an axiomatization of graph isomorphism via graph rewriting in Coq. CPP 2020: 325-337 - [i16]Jean-Marie Madiot, Damien Pous, Davide Sangiorgi:
Modular coinduction up-to for higher-order languages via first-order transition systems. CoRR abs/2001.07063 (2020)
2010 – 2019
- 2019
- [j16]Damien Pous, Davide Sangiorgi:
Bisimulation and Coinduction Enhancements: A Historical Perspective. Formal Aspects Comput. 31(6): 733-749 (2019) - [j15]Peter Höfner, Damien Pous, Georg Struth:
Relational and algebraic methods in computer science. J. Log. Algebraic Methods Program. 106: 198-199 (2019) - [j14]Damien Pous, Jurriaan Rot:
Companions, Causality and Codensity. Log. Methods Comput. Sci. 15(3) (2019) - [c49]Damien Pous:
Coinduction: Automata, Formal Proof, Companions (Invited Paper). CALCO 2019: 4:1-4:4 - [c48]Denis Kuperberg, Laureline Pinault, Damien Pous:
Coinductive Algorithms for Büchi Automata. DLT 2019: 206-220 - [c47]Amina Doumane, Denis Kuperberg, Damien Pous, Cécilia Pradic:
Kleene Algebra with Hypotheses. FoSSaCS 2019: 207-223 - [c46]Denis Kuperberg, Laureline Pinault, Damien Pous:
Cyclic Proofs and Jumping Automata. FSTTCS 2019: 45:1-45:14 - [c45]Florent Bréhard, Assia Mahboubi, Damien Pous:
A Certificate-Based Approach to Formally Verified Approximations. ITP 2019: 8:1-8:19 - 2018
- [c44]Amina Doumane, Damien Pous:
Completeness for Identity-free Kleene Lattices. CONCUR 2018: 18:1-18:17 - [c43]Anupam Das, Damien Pous:
Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices). CSL 2018: 19:1-19:18 - [c42]Christian Doczkal, Guillaume Combette, Damien Pous:
A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs. ITP 2018: 178-195 - [c41]Damien Pous, Valeria Vignudelli:
Allegories: decidability and graph homomorphisms. LICS 2018: 829-838 - [c40]Anupam Das, Amina Doumane, Damien Pous:
Left-Handed Completeness for Kleene algebra, via Cyclic Proofs. LPAR 2018: 271-289 - [c39]Christian Doczkal, Damien Pous:
Treewidth-Two Graphs as a Free Algebra. MFCS 2018: 60:1-60:15 - [c38]Damien Pous:
On the Positive Calculus of Relations with Transitive Closure. STACS 2018: 3:1-3:16 - 2017
- [j13]Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot:
A general account of coinduction up-to. Acta Informatica 54(2): 127-190 (2017) - [j12]Paul Brunet, Damien Pous:
Petri Automata. Log. Methods Comput. Sci. 13(3) (2017) - [j11]Jurriaan Rot, Filippo Bonchi, Marcello M. Bonsangue, Damien Pous, Jan Rutten, Alexandra Silva:
Enhanced coalgebraic bisimulation. Math. Struct. Comput. Sci. 27(7): 1236-1264 (2017) - [j10]Fabienne Boyer, Olivier Gruber, Damien Pous:
A robust reconfiguration protocol for the dynamic update of component-based software systems. Softw. Pract. Exp. 47(11): 1729-1753 (2017) - [c37]Henning Basold, Damien Pous, Jurriaan Rot:
Monoidal Company for Accessible Functors. CALCO 2017: 5:1-5:16 - [c36]Paul Brunet, Damien Pous, Georg Struth:
On Decidability of Concurrent Kleene Algebra. CONCUR 2017: 28:1-28:15 - [c35]Damien Pous, Jurriaan Rot:
Companions, Codensity and Causality. FoSSaCS 2017: 106-123 - [c34]Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt:
Fully abstract encodings of λ-calculus in HOcore through abstract machines. LICS 2017: 1-12 - [c33]Enric Cosme-Llópez, Damien Pous:
K4-free Graphs as a Free Algebra. MFCS 2017: 76:1-76:14 - [c32]Anupam Das, Damien Pous:
A Cut-Free Cyclic Proof System for Kleene Algebra. TABLEAUX 2017: 261-277 - [c31]Damien Pous:
CoInductive Automata Algorithms. CIAA 2017: xvii-xviii - [e1]Peter Höfner, Damien Pous, Georg Struth:
Relational and Algebraic Methods in Computer Science - 16th International Conference, RAMiCS 2017, Lyon, France, May 15-18, 2017, Proceedings. Lecture Notes in Computer Science 10226, 2017, ISBN 978-3-319-57417-2 [contents] - [i15]Paul Brunet, Damien Pous:
Petri Automata. CoRR abs/1702.01804 (2017) - [i14]Damien Pous, Jurriaan Rot:
Companions, Causality and Codensity. CoRR abs/1712.08526 (2017) - [i13]Shin-ya Katsumata, Damien Pous, Jan Rutten:
Enhanced coinduction (NII Shonan Meeting 2017-17). NII Shonan Meet. Rep. 2017 (2017) - 2016
- [b2]Damien Pous:
Automata for relation algebra and formal proofs. École normale supérieure de Lyon, France, 2016 - [j9]Paul Brunet, Damien Pous:
Algorithms for Kleene algebra with converse. J. Log. Algebraic Methods Program. 85(4): 574-594 (2016) - [c30]Paul Brunet, Damien Pous, Insa Stucke:
Cardinalities of Finite Relations in Coq. ITP 2016: 466-474 - [c29]Damien Pous:
Coinduction All the Way Up. LICS 2016: 307-316 - [c28]Paul Brunet, Damien Pous:
A Formal Exploration of Nominal Kleene Algebra. MFCS 2016: 22:1-22:13 - 2015
- [j8]Filippo Bonchi, Damien Pous:
Hacking nondeterminism with induction and coinduction. Commun. ACM 58(2): 87-95 (2015) - [c27]Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot:
Lax Bialgebras and Up-To Techniques for Weak Bisimulations. CONCUR 2015: 240-253 - [c26]Paul Brunet, Damien Pous:
Petri Automata for Kleene Allegories. LICS 2015: 68-79 - [c25]Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous, Jean-Claude Reynaud:
Relative Hilbert-Post Completeness for Exceptions. MACIS 2015: 596-610 - [c24]Damien Pous:
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests. POPL 2015: 357-368 - [i12]Damien Pous:
Coinductive techniques, from automata to coalgebra. PLMW@POPL 2015: 6:1 - [i11]Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous, Jean-Claude Reynaud:
Hilbert-Post completeness for the state and the exception effects. CoRR abs/1503.00948 (2015) - 2014
- [c23]Paul Brunet, Damien Pous:
Kleene Algebra with Converse. RAMiCS 2014: 101-118 - [c22]Jean-Marie Madiot, Damien Pous, Davide Sangiorgi:
Bisimulations Up-to: Beyond First-Order Transition Systems. CONCUR 2014: 93-108 - [c21]Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot:
Coinduction up-to in a fibrational setting. CSL-LICS 2014: 20:1-20:9 - [c20]Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous:
Formal verification in Coq of program properties involving the global state effect. JFLA 2014: 1-16 - [c19]Damien Pous, Alan Schmitt:
De la KAM avec un Processus d'Ordre Supe'rieur. JFLA 2014: 149-158 - [i10]Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot:
Coinduction up to in a fibrational setting. CoRR abs/1401.6675 (2014) - [i9]Damien Pous:
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests. CoRR abs/1407.3213 (2014) - [i8]Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous:
Program certification with computational effects. CoRR abs/1411.7140 (2014) - 2013
- [c18]Filippo Bonchi, Georgiana Caltais, Damien Pous, Alexandra Silva:
Brzozowski's and Up-To Algorithms for Must Testing. APLAS 2013: 1-16 - [c17]Damien Pous:
Coalgebraic Up-to Techniques. CALCO 2013: 34-35 - [c16]Fabienne Boyer, Olivier Gruber, Damien Pous:
Robust reconfigurations of component assemblies. ICSE 2013: 13-22 - [c15]Damien Pous:
Kleene Algebra with Tests and Coq Tools for while Programs. ITP 2013: 180-196 - [c14]Filippo Bonchi, Damien Pous:
Checking NFA equivalence with bisimulations up to congruence. POPL 2013: 457-468 - [i7]Damien Pous:
Kleene Algebra with Tests and Coq Tools for While Programs. CoRR abs/1302.1737 (2013) - [i6]Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous:
Formal verification in Coq of program properties involving the global state effect. CoRR abs/1310.0794 (2013) - 2012
- [j7]Thomas Braibant, Damien Pous:
Deciding Kleene Algebras in Coq. Log. Methods Comput. Sci. 8(1) (2012) - [j6]Damien Pous:
Untyping Typed Algebras and Colouring Cyclic Linear Logic. Log. Methods Comput. Sci. 8(2) (2012) - [j5]Tom Hirschowitz, Damien Pous:
Innocent Strategies as Presheaves and Interactive Equivalences for CCS. Sci. Ann. Comput. Sci. 22(1): 147-199 (2012) - [p1]Damien Pous, Davide Sangiorgi:
Enhancements of the bisimulation proof method. Advanced Topics in Bisimulation and Coinduction 2012: 233-289 - 2011
- [c13]Thomas Braibant, Damien Pous:
Tactics for Reasoning Modulo AC in Coq. CPP 2011: 167-182 - [c12]Tom Hirschowitz, Damien Pous:
Innocent strategies as presheaves and interactive equivalences for CCS. ICE 2011: 2-24 - [i5]Thomas Braibant, Damien Pous:
Tactics for Reasoning modulo AC in Coq. CoRR abs/1106.4448 (2011) - [i4]Tom Hirschowitz, Damien Pous:
Strategies as sheaves and interactive equivalences for CCS. CoRR abs/1109.4356 (2011) - 2010
- [c11]Damien Pous:
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic. CSL 2010: 484-498 - [c10]Daniel Hirschkoff, Damien Pous:
On Bisimilarity and Substitution in Presence of Replication. ICALP (2) 2010: 454-465 - [c9]Thomas Braibant, Damien Pous:
An Efficient Coq Tactic for Deciding Kleene Algebras. ITP 2010: 163-178
2000 – 2009
- 2009
- [i3]Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous:
Encapsulation and Dynamic Modularity in the Pi-Calculus. CoRR abs/0906.5446 (2009) - 2008
- [b1]Damien Pous:
Techniques modulo pour les bisimulations. (Up to techniques for bisimulations). École normale supérieure de Lyon, France, 2008 - [j4]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) - [j3]Damien Pous:
Using bisimulation proof techniques for the analysis of distributed abstract machines. Theor. Comput. Sci. 402(2-3): 199-220 (2008) - [c8]Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous:
Encapsulation and Dynamic Modularity in the pi-calculus. PLACES@DisCoTec 2008: 85-100 - [i2]Daniel Hirschkoff, Damien Pous:
On characterising strong bisimilarity in a fragment of CCS with replication. CoRR abs/0810.2061 (2008) - 2007
- [j2]Daniel Hirschkoff, Damien Pous, Davide Sangiorgi:
An efficient abstract machine for Safe Ambients. J. Log. Algebraic Methods Program. 71(2): 114-149 (2007) - [j1]Damien Pous:
New up-to techniques for weak bisimulation. Theor. Comput. Sci. 380(1-2): 164-180 (2007) - [c7]Damien Pous:
Complete Lattices and Up-To Techniques. APLAS 2007: 351-366 - [c6]Daniel Hirschkoff, Damien Pous:
A Distribution Law for CCS and a New Congruence Result for the pi-Calculus. FoSSaCS 2007: 228-242 - 2006
- [c5]Damien Pous:
Weak Bisimulation Up to Elaboration. CONCUR 2006: 390-405 - [c4]Damien Pous:
On Bisimulation Proofs for the Analysis of Distributed Abstract Machines. TGC 2006: 150-166 - [i1]Daniel Hirschkoff, Damien Pous:
A Distribution Law for CCS and a New Congruence Result for the pi-calculus. CoRR abs/cs/0608059 (2006) - 2005
- [c3]Daniel Hirschkoff, Damien Pous, Davide Sangiorgi:
A Correct Abstract Machine for Safe Ambients. COORDINATION 2005: 17-32 - [c2]Daniel Hirschkoff, Tom Hirschowitz, Damien Pous, Alan Schmitt, Jean-Bernard Stefani:
Component-Oriented Programming with Sharing: Containment is Not Ownership. GPCE 2005: 389-404 - [c1]Damien Pous:
Up-to Techniques for Weak Bisimulation. ICALP 2005: 730-741
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
