Damien Pous
76
Documents
Publications
- 9
- 8
- 7
- 7
- 5
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 8
- 7
- 7
- 5
- 4
- 4
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 4
- 3
- 7
- 7
- 8
- 5
- 8
- 6
- 5
- 3
- 2
- 3
- 4
- 4
- 2
- 3
|
Completeness Theorems for Kleene Algebra with TopCONCUR, Sep 2022, Varsovie, Poland. ⟨10.4230/LIPIcs.CONCUR.2022.26⟩
Conference papers
hal-03644317v2
|
|
Corecursion up-to via Causal TransformationsCoalgebraic Methods in Computer Science, Apr 2022, Munich, Germany. ⟨10.1007/978-3-031-10736-8_7⟩
Conference papers
hal-03694381v1
|
|
On Tools for Completeness of Kleene Algebra with Hypotheses19th International Conference on Relational and Algebraic Methods in Computer Science ( RAMICS 2021 ), Nov 2021, Luminy, France. ⟨10.1007/978-3-030-88701-8_23⟩
Conference papers
hal-03269462v2
|
|
Non axiomatisability of positive relation algebras with constants, via graph homomorphismsCONCUR, 2020, Vienne, Austria. pp.1-23, ⟨10.4230/LIPIcs.CONCUR.2020.49⟩
Conference papers
hal-02870687v2
|
|
Completeness of an Axiomatization of Graph Isomorphism via Graph Rewriting in CoqCPP 2020 - 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2020, New Orleans, LA, United States. ⟨10.1145/3372885.3373831⟩
Conference papers
hal-02333553v3
|
|
Cyclic Proofs and Jumping AutomataFSTTCS, Dec 2019, Bombay, India. ⟨10.4230/LIPIcs.FSTTCS.2019.45⟩
Conference papers
hal-02301651v2
|
|
Coinductive algorithms for Büchi automataDevelopments in Language Theory, Aug 2019, Varsovie, Poland
Conference papers
hal-01928701v1
|
Coinduction: Automata, Formal Proof, Companions (Invited Paper)CALCO, Jun 2019, London, United Kingdom
Conference papers
hal-02393982v1
|
|
|
Kleene Algebra with Hypotheses22nd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), 2019, Prague, Czech Republic
Conference papers
hal-02021315v1
|
|
A certificate-based approach to formally verified approximationsITP 2019 - Tenth International Conference on Interactive Theorem Proving, Sep 2019, Portland, United States. pp.1-19, ⟨10.4230/LIPIcs.ITP.2019.8⟩
Conference papers
hal-02088529v2
|
|
Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)Computer Science Logic (CSL), Sep 2018, Birmingham, United Kingdom. ⟨10.4230/LIPIcs.CSL.2018.19⟩
Conference papers
hal-01703942v3
|
Left-Handed Completeness for Kleene algebra, via Cyclic ProofsLPAR-22, Nov 2018, Awassa, Ethiopia
Conference papers
hal-01940378v1
|
|
|
Treewidth-Two Graphs as a Free AlgebraMathematical Foundations of Computer Science, Aug 2018, Liverpool, United Kingdom. ⟨10.4230/LIPIcs.MFCS.2018.60⟩
Conference papers
hal-01780844v3
|
|
Completeness for Identity-free Kleene LatticesCONCUR, Sep 2018, Beijing, China. ⟨10.4230/LIPIcs.CONCUR.2018.18⟩
Conference papers
hal-01780845v2
|
|
A Formal Proof of the Minor-Exclusion Property for Treewidth-Two GraphsInteractive Theorem Proving, Jul 2018, Oxford, United Kingdom. ⟨10.1007/978-3-319-94821-8_11⟩
Conference papers
hal-01703922v2
|
On the Positive Calculus of Relations with Transitive Closure35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Feb 2018, Caen, France. ⟨10.4230/LIPIcs.STACS.2018.3⟩
Conference papers
hal-01718925v1
|
|
|
Allegories: decidability and graph homomorphismsLogic in Computer Science, Jul 2018, Oxford, United Kingdom. ⟨10.1145/3209108.3209172⟩
Conference papers
hal-01703906v2
|
|
Fully Abstract Encodings of λ-Calculus in HOcore through Abstract MachinesLICS 2017 - 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2017, Reykjavik, Iceland. ⟨10.1109/LICS.2017.8005118⟩
Conference papers
hal-01479035v1
|
|
On Decidability of Concurrent Kleene AlgebraCONCUR, Sep 2017, Berlin, Germany
Conference papers
hal-01558108v1
|
|
A cut-free cyclic proof system for Kleene algebraTABLEAUX, Sep 2017, Brasilia, Brazil
Conference papers
hal-01558132v1
|
|
K4-free Graphs as a Free Algebra42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark
Conference papers
hal-01515752v2
|
|
Monoidal Company for Accessible FunctorsCALCO, Jun 2017, Ljubljana, Slovenia
Conference papers
hal-01529340v1
|
|
Companions, Codensity and CausalityFoSSaCS, Apr 2017, Uppsala, Sweden
Conference papers
hal-01442222v1
|
|
Cardinalities of Finite Relations in Coq with ApplicationsInterative Theorem Proving, Aug 2016, Nancy, France. pp.466-474, ⟨10.1007/978-3-319-43144-4_29⟩
Conference papers
hal-01441262v2
|
|
A formal exploration of Nominal Kleene AlgebraMFCS, Aug 2016, Cracovie, Poland. ⟨10.4230/LIPIcs.MFCS.2016.22⟩
Conference papers
hal-01307532v2
|
|
Coinduction All the Way UpThirty-First Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2016), Jul 2016, New York, United States. ⟨10.1145/2933575.2934564⟩
Conference papers
hal-01259622v2
|
|
Hilbert-Post completeness for the state and the exception effectsSixth International Conference on Mathematical Aspects of Computer and Information Sciences, Nov 2015, Berlin, Germany. pp.596-610, ⟨10.1007/978-3-319-32859-1_51⟩
Conference papers
hal-01121924v3
|
Coinductive techniques, from automata to coalgebraProgramming Languages Mentoring Workshop, Jan 2015, Mumbai, India. ⟨10.1145/2792434.2792440⟩
Conference papers
hal-01288791v1
|
|
|
Decidability of Identity-free Relational Kleene LatticesVingt-sixièmes Journées Francophones des Langages Applicatifs (JFLA 2015), Jan 2015, Le Val d'Ajol, France
Conference papers
hal-01099137v1
|
|
Symbolic Algorithms for Language Equivalence and Kleene Algebra with TestsPOPL 2015: 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Jan 2015, Mumbai, India
Conference papers
hal-01021497v2
|
Lax Bialgebras and Up-To Techniques for Weak Bisimulations26th International Conference on Concurrency Theory (CONCUR), Sep 2015, Madrid, Spain. ⟨10.4230/LIPIcs.CONCUR.2015.240⟩
Conference papers
hal-01285299v1
|
|
|
Petri automata for Kleene allegoriesLogic in Computer Science, Jul 2015, Kyoto, Japan. pp.68-79, ⟨10.1109/LICS.2015.17⟩
Conference papers
hal-01073936v3
|
|
Kleene Algebra with ConverseRAMiCS, Apr 2014, Marienstatt im Westerwald, Germany. pp.101-118
Conference papers
hal-00938235v1
|
|
Coinduction up to in a fibrational settingCSL-LICS, Jul 2014, Vienne, Austria. pp.1-12, ⟨10.1145/2603088.2603149⟩
Conference papers
hal-00936488v2
|
|
De la KAM avec un Processus d'Ordre SupérieurJFLAs 2014, Jan 2014, Fréjus, France. pp.1-12
Conference papers
hal-00966097v2
|
|
Formal verification in Coq of program properties involving the global state effectJFLA 2014 - Journées Francophones des Langages Applicatifs, Jan 2014, Fréjus, France. pp.1-17
Conference papers
hal-00869230v2
|
|
Bisimulations up-to: beyond first-order transition systemsCONCUR, Sep 2014, Rome, Italy. ⟨10.1007/978-3-662-44584-6_8⟩
Conference papers
hal-00990859v1
|
|
Checking NFA equivalence with bisimulations up to congruencePrinciple of Programming Languages (POPL), Jan 2013, Roma, Italy. pp.457-468, ⟨10.1145/2429069.2429124⟩
Conference papers
hal-00639716v5
|
Robust reconfigurations of component assembliesICSE '13 - International Conference on Software Engineering, May 2013, San Francisco, United States. pp.13-22
Conference papers
hal-00966078v1
|
|
|
Kleene Algebra with Tests and Coq Tools for While ProgramsInteractive Theorem Proving 2013, Jul 2013, Rennes, France. pp.180-196, ⟨10.1007/978-3-642-39634-2_15⟩
Conference papers
hal-00785969v1
|
Coalgebraic Up-to TechniquesCALCO, Sep 2013, Warsaw, Poland. ⟨10.1007/978-3-642-40206-7_4⟩
Conference papers
hal-00966075v1
|
|
|
Brzozowski's and Up-To Algorithms for Must Testing11th Asian Symposium on Programming Languages and Systems (APLAS), Dec 2013, Melbourne, Australia. pp.1-16, ⟨10.1007/978-3-319-03542-0_1⟩
Conference papers
hal-00966072v1
|
Innocent strategies as presheaves and interactive equivalences for CCSICE, Jun 2011, Reykjavik, Iceland. pp.2-24, ⟨10.4204/EPTCS.59.2⟩
Conference papers
hal-00616648v1
|
|
|
Tactics for Reasoning modulo AC in CoqCertified Proofs and Programs, 2011, Taiwan. pp167-182, ⟨10.1007/978-3-642-25379-9_14⟩
Conference papers
hal-00484871v4
|
|
Deciding Kleene Algebras in CoqITP, Aug 2010, Edinburgh, United Kingdom. pp.163-178, ⟨10.1007/978-3-642-14052-5_13⟩
Conference papers
hal-00383070v5
|
|
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear LogicComputer Science Logic, Aug 2010, Brno, Czech Republic. pp.484-498, ⟨10.1007/978-3-642-15205-4_37⟩
Conference papers
hal-00421158v4
|
|
On Bisimilarity and Substitution in Presence of ReplicationICALP, Jul 2010, Bordeaux, France. pp.454-465, ⟨10.1007/978-3-642-14162-1_38⟩
Conference papers
hal-00375604v4
|
|
Encapsulation and Dynamic Modularity in the Pi-CalculusPLACES 2008, 2008, Oslo, Norway. pp.85 - 100, ⟨10.1016/j.entcs.2009.06.005⟩
Conference papers
hal-00400159v1
|
|
A Distribution Law for CCS and a New Congruence Result for the pi-calculusFoSSaCS, 2007, Braga, Portugal. ⟨10.1007/978-3-540-71389-0_17⟩
Conference papers
hal-00089219v4
|
|
Complete Lattices and Up-to Techniques5th Asian Symposium on Programming Languages and Systems, Joxan Jaffar, 2007, Singapore, Singapore. pp.351-366, ⟨10.1007/978-3-540-76637-7_24⟩
Conference papers
ensl-00155308v2
|
|
Weak Bisimulation Up to ElaborationCONCUR, 2006, Bonn, Germany. pp.390 - 405, ⟨10.1007/11817949_26⟩
Conference papers
hal-01441462v1
|
|
On Bisimulation Proofs for the Analysis of Distributed Abstract MachinesTGC, 2006, Lucca, Italy. ⟨10.1007/978-3-540-75336-0_10⟩
Conference papers
hal-01441457v1
|
|
Up-to Techniques for Weak BisimulationICALP, 2005, Lisbonne, Portugal. pp.730 - 741, ⟨10.1007/11523468_59⟩
Conference papers
hal-01441463v1
|
|
A Correct Abstract Machine for Safe AmbientsCOORDINATION, 2005, Namur, Belgium. ⟨10.1007/11417019_2⟩
Conference papers
hal-01441466v1
|
|
Component-Oriented Programming with Sharing: Containment is not OwnershipGenerative Programming and Component Engineering (GPCE), 2005, Tallinn, Estonia. pp.389-404, ⟨10.1007/11561347_26⟩
Conference papers
hal-00310126v1
|
Enhancements of the bisimulation proof methodDavide Sangiorgi and Jan Rutten. Advanced Topics in Bisimulation and Coinduction, Cambridge University Press, 2012
Book sections
hal-00909391v1
|
|
Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines[Research Report] RR-9052, Inria. 2017
Reports
hal-01507625v1
|
|
Decidability of Identity-free Relational Kleene Lattices[Research Report] ENS de Lyon. 2014
Reports
hal-01073932v1
|
|
Techniques modulo pour les bisimulationsInformatique [cs]. ENS Lyon, 2008. Français. ⟨NNT : ⟩
Theses
tel-01441480v1
|
|
Automata for relation algebra and formal proofsComputer Science [cs]. ENS Lyon, 2016
Habilitation à diriger des recherches
tel-01445821v1
|