The following pages link to Damien Pous (Q299193):
Displaying 38 items.
- Algorithms for Kleene algebra with converse (Q299194) (← links)
- A general account of coinduction up-to (Q523132) (← links)
- An efficient abstract machine for safe ambients (Q882488) (← links)
- Using bisimulation proof techniques for the analysis of distributed abstract machines (Q935472) (← links)
- A cut-free cyclic proof system for Kleene algebra (Q1694471) (← links)
- A formal proof of the minor-exclusion property for treewidth-two graphs (Q1791156) (← links)
- Corecursion up-to via causal transformations (Q2104483) (← links)
- Graph theory in Coq: minors, treewidth, and isomorphisms (Q2209536) (← links)
- Bisimulation and coinduction enhancements: a historical perspective (Q2280213) (← links)
- Kleene algebra with hypotheses (Q2289074) (← links)
- Coinductive algorithms for Büchi automata (Q2327557) (← links)
- New up-to techniques for weak bisimulation (Q2373744) (← links)
- On tools for completeness of Kleene algebra with hypotheses (Q2695367) (← links)
- Relative Hilbert-Post Completeness for Exceptions (Q2807879) (← links)
- Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests (Q2819822) (← links)
- Cardinalities of Finite Relations in Coq (Q2829280) (← links)
- Coalgebraic Up-to Techniques (Q2848937) (← links)
- Deciding Kleene Algebras in Coq (Q2881083) (← links)
- Untyping Typed Algebras and Colouring Cyclic Linear Logic (Q2895474) (← links)
- Checking NFA equivalence with bisimulations up to congruence (Q2931822) (← links)
- Brzozowski’s and Up-To Algorithms for Must Testing (Q2937778) (← links)
- Companions, Codensity and Causality (Q2988363) (← links)
- Tactics for Reasoning Modulo AC in Coq (Q3100211) (← links)
- Bisimulations Up-to: Beyond First-Order Transition Systems (Q3190111) (← links)
- (Q3304097) (← links)
- (Q4580200) (← links)
- (Q4608581) (← links)
- (Q5005163) (← links)
- Completeness for Identity-free Kleene Lattices (Q5009432) (← links)
- (Q5079743) (← links)
- (Q5089295) (← links)
- (Q5111293) (← links)
- (Q5111642) (← links)
- Left-Handed Completeness for Kleene algebra, via Cyclic Proofs (Q5222960) (← links)
- Lax Bialgebras and Up-To Techniques for Weak Bisimulations (Q5357707) (← links)
- (Q5875344) (← links)
- A certificate-based approach to formally verified approximations (Q5875414) (← links)
- Cyclic Proofs and Jumping Automata (Q5875682) (← links)
