Damien Pous

From MaRDI portal
Person:299193

Available identifiers

zbMath Open pous.damienMaRDI QIDQ299193

List of research outcomes





PublicationDate of PublicationType
Completeness theorems for Kleene algebra with tests and top2024-11-12Paper
Fully abstract encodings of \(\lambda\)-calculus in HOcore through abstract machines2024-09-04Paper
Completeness theorems for Kleene algebra with top2024-08-13Paper
On tools for completeness of Kleene algebra with hypotheses2024-06-27Paper
On tools for completeness of Kleene algebra with hypotheses2023-03-30Paper
A certificate-based approach to formally verified approximations2023-02-03Paper
Cyclic Proofs and Jumping Automata2023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q58753442023-02-03Paper
Corecursion up-to via causal transformations2022-12-07Paper
https://portal.mardi4nfdi.de/entity/Q50892952022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50797432022-05-28Paper
Coinductive algorithms for Büchi automata2021-10-25Paper
https://portal.mardi4nfdi.de/entity/Q51556882021-10-08Paper
Treewidth-two graphs as a free algebra2021-08-04Paper
Completeness for identity-free Kleene lattices2021-08-04Paper
Allegories: decidability and graph homomorphisms2021-01-20Paper
Fully abstract encodings of \(\lambda \)-calculus in HOcore through abstract machines2021-01-19Paper
Graph theory in Coq: minors, treewidth, and isomorphisms2020-11-02Paper
On the positive calculus of relations with transitive closure2020-08-05Paper
https://portal.mardi4nfdi.de/entity/Q51116422020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51112932020-05-26Paper
Kleene algebra with hypotheses2020-01-28Paper
Bisimulation and coinduction enhancements: a historical perspective2019-12-18Paper
Coinductive algorithms for Büchi automata2019-10-15Paper
Companions, causality and codensity2019-08-13Paper
Left-Handed Completeness for Kleene algebra, via Cyclic Proofs2019-07-04Paper
Innocent strategies as presheaves and interactive equivalences for CCS2019-02-08Paper
A formal proof of the minor-exclusion property for treewidth-two graphs2018-10-04Paper
Monoidal company for accessible functors2018-08-13Paper
Coinduction up-to in a fibrational setting2018-04-23Paper
Petri Automata for Kleene Allegories2018-04-23Paper
Coinduction All the Way Up2018-04-23Paper
A formal exploration of nominal Kleene algebra2018-03-21Paper
A cut-free cyclic proof system for Kleene algebra2018-02-02Paper
Petri automata2017-10-12Paper
Enhanced coalgebraic bisimulation2017-09-27Paper
Lax bialgebras and up-to techniques for weak bisimulations2017-09-12Paper
Companions, codensity and causality2017-05-19Paper
A general account of coinduction up-to2017-04-20Paper
Cardinalities of Finite Relations in Coq2016-10-27Paper
Symbolic algorithms for language equivalence and Kleene algebra with tests2016-09-29Paper
Algorithms for Kleene algebra with converse2016-06-22Paper
Relative Hilbert-Post completeness for exceptions2016-05-25Paper
Brzozowski's and up-to algorithms for must testing2015-01-12Paper
Checking NFA equivalence with bisimulations up to congruence2014-11-27Paper
Bisimulations up-to: beyond first-order transition systems2014-09-15Paper
Enhancements of the bisimulation proof method2014-04-25Paper
Kleene algebra with converse2014-04-16Paper
Coalgebraic up-to techniques2013-09-13Paper
Kleene algebra with tests and Coq tools for while programs2013-08-07Paper
Untyping typed algebras and colouring cyclic linear logic2012-07-03Paper
Deciding Kleene algebras in \texttt{Coq}2012-04-03Paper
Tactics for Reasoning Modulo AC in Coq2011-11-22Paper
An efficient Coq tactic for deciding Kleene algebras2010-09-14Paper
On Bisimilarity and Substitution in Presence of Replication2010-09-07Paper
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic2010-09-03Paper
On Bisimulation Proofs for the Analysis of Distributed Abstract Machines2009-03-05Paper
A Distribution Law for CCS and a New Congruence Result for the pi-calculus2008-08-07Paper
Using bisimulation proof techniques for the analysis of distributed abstract machines2008-08-06Paper
Complete Lattices and Up-To Techniques2008-05-15Paper
A Distribution Law for CCS and a New Congruence Result for the π-Calculus2007-09-07Paper
Weak Bisimulation Up to Elaboration2007-09-04Paper
New up-to techniques for weak bisimulation2007-07-16Paper
An efficient abstract machine for safe ambients2007-05-23Paper
Automata, Languages and Programming2006-01-10Paper

Research outcomes over time

This page was built for person: Damien Pous