
Damien Pous
89
Documents
Publications
10
9
8
7
6
6
5
5
5
4
4
3
3
3
3
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
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
8
7
7
6
5
5
5
4
3
3
3
3
3
3
3
3
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
5
2
4
3
9
7
9
6
9
7
5
4
2
4
1
3
4
2
3
Publications
|
A finite presentation of graphs of treewidth at most three51st 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-04560570
v3
|
|
Completeness Theorems for Kleene Algebra with TopCONCUR, Sep 2022, Varsovie, Poland. ⟨10.4230/LIPIcs.CONCUR.2022.26⟩
Communication dans un congrès
hal-03644317
v2
|
|
Corecursion up-to via Causal TransformationsCoalgebraic Methods in Computer Science, Apr 2022, Munich, Germany. ⟨10.1007/978-3-031-10736-8_7⟩
Communication dans un congrès
hal-03694381
v1
|
|
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. pp.378-395, ⟨10.1007/978-3-030-88701-8_23⟩
Communication dans un congrès
hal-03269462
v2
|
|
Non axiomatisability of positive relation algebras with constants, via graph homomorphismsCONCUR, 2020, Vienne, Austria. pp.1-23, ⟨10.4230/LIPIcs.CONCUR.2020.49⟩
Communication dans un congrès
hal-02870687
v2
|
|
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⟩
Communication dans un congrès
hal-02333553
v3
|
|
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⟩
Communication dans un congrès
hal-02088529
v2
|
|
Cyclic Proofs and Jumping AutomataFSTTCS, Dec 2019, Bombay, India. ⟨10.4230/LIPIcs.FSTTCS.2019.45⟩
Communication dans un congrès
hal-02301651
v2
|
Coinduction: Automata, Formal Proof, Companions (Invited Paper)CALCO, Jun 2019, London, United Kingdom. ⟨10.4230/LIPIcs.CALCO.2019.4⟩
Communication dans un congrès
hal-02393982
v1
|
|
|
Coinductive algorithms for Büchi automataDevelopments in Language Theory, Aug 2019, Varsovie, Poland. pp.206-220, ⟨10.1007/978-3-030-24886-4_15⟩
Communication dans un congrès
hal-01928701
v1
|
|
Kleene Algebra with Hypotheses22nd 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-02021315
v1
|
Left-Handed Completeness for Kleene algebra, via Cyclic ProofsLPAR-22, Nov 2018, Awassa, Ethiopia
Communication dans un congrès
hal-01940378
v1
|
|
|
Allegories: decidability and graph homomorphismsLogic in Computer Science, Jul 2018, Oxford, United Kingdom. ⟨10.1145/3209108.3209172⟩
Communication dans un congrès
hal-01703906
v2
|
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⟩
Communication dans un congrès
hal-01718925
v1
|
|
|
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⟩
Communication dans un congrès
hal-01703922
v2
|
|
Treewidth-Two Graphs as a Free AlgebraMathematical Foundations of Computer Science, Aug 2018, Liverpool, United Kingdom. ⟨10.4230/LIPIcs.MFCS.2018.60⟩
Communication dans un congrès
hal-01780844
v3
|
|
Completeness for Identity-free Kleene LatticesCONCUR, Sep 2018, Beijing, China. ⟨10.4230/LIPIcs.CONCUR.2018.18⟩
Communication dans un congrès
hal-01780845
v2
|
|
Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)Computer Science Logic (CSL), Sep 2018, Birmingham, United Kingdom. ⟨10.4230/LIPIcs.CSL.2018.19⟩
Communication dans un congrès
hal-01703942
v3
|
|
A cut-free cyclic proof system for Kleene algebraTABLEAUX, Sep 2017, Brasilia, Brazil
Communication dans un congrès
hal-01558132
v1
|
|
K4-free Graphs as a Free Algebra42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark
Communication dans un congrès
hal-01515752
v2
|
|
Monoidal Company for Accessible FunctorsCALCO, Jun 2017, Ljubljana, Slovenia
Communication dans un congrès
hal-01529340
v1
|
|
Companions, Codensity and CausalityFoSSaCS, Apr 2017, Uppsala, Sweden
Communication dans un congrès
hal-01442222
v1
|
|
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⟩
Communication dans un congrès
hal-01479035
v1
|
|
On Decidability of Concurrent Kleene AlgebraCONCUR, Sep 2017, Berlin, Germany
Communication dans un congrès
hal-01558108
v1
|
|
A formal exploration of Nominal Kleene AlgebraMFCS, Aug 2016, Cracovie, Poland. ⟨10.4230/LIPIcs.MFCS.2016.22⟩
Communication dans un congrès
hal-01307532
v2
|
|
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⟩
Communication dans un congrès
hal-01441262
v2
|
|
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⟩
Communication dans un congrès
hal-01259622
v2
|
|
Decidability of Identity-free Relational Kleene LatticesVingt-sixièmes Journées Francophones des Langages Applicatifs (JFLA 2015), Jan 2015, Le Val d'Ajol, France
Communication dans un congrès
hal-01099137
v1
|
|
Petri automata for Kleene allegoriesLogic in Computer Science, Jul 2015, Kyoto, Japan. pp.68-79, ⟨10.1109/LICS.2015.17⟩
Communication dans un congrès
hal-01073936
v3
|
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⟩
Communication dans un congrès
hal-01285299
v1
|
|
Coinductive techniques, from automata to coalgebraProgramming Languages Mentoring Workshop, Jan 2015, Mumbai, India. ⟨10.1145/2792434.2792440⟩
Communication dans un congrès
hal-01288791
v1
|
|
|
Hilbert-Post completeness for the state and the exception effectsSixth 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-01121924
v3
|
|
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
Communication dans un congrès
hal-01021497
v2
|
|
De la KAM avec un Processus d'Ordre SupérieurJFLAs 2014, Jan 2014, Fréjus, France. pp.1-12
Communication dans un congrès
hal-00966097
v2
|
|
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
Communication dans un congrès
hal-00869230
v2
|
|
Bisimulations up-to: beyond first-order transition systemsCONCUR, Sep 2014, Rome, Italy. ⟨10.1007/978-3-662-44584-6_8⟩
Communication dans un congrès
hal-00990859
v1
|
|
Kleene Algebra with ConverseRAMiCS, Apr 2014, Marienstatt im Westerwald, Germany. pp.101-118
Communication dans un congrès
hal-00938235
v1
|
|
Coinduction up to in a fibrational settingCSL-LICS, Jul 2014, Vienne, Austria. pp.1-12, ⟨10.1145/2603088.2603149⟩
Communication dans un congrès
hal-00936488
v2
|
|
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⟩
Communication dans un congrès
hal-00785969
v1
|
Robust reconfigurations of component assembliesICSE '13 - International Conference on Software Engineering, May 2013, San Francisco, United States. pp.13-22
Communication dans un congrès
hal-00966078
v1
|
|
|
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⟩
Communication dans un congrès
hal-00966072
v1
|
Coalgebraic Up-to TechniquesCALCO, Sep 2013, Warsaw, Poland. ⟨10.1007/978-3-642-40206-7_4⟩
Communication dans un congrès
istex
hal-00966075
v1
|
|
|
Checking NFA equivalence with bisimulations up to congruencePrinciple of Programming Languages (POPL), Jan 2013, Roma, Italy. pp.457-468, ⟨10.1145/2429069.2429124⟩
Communication dans un congrès
hal-00639716
v5
|
|
Tactics for Reasoning modulo AC in CoqCertified Proofs and Programs, 2011, Taiwan. pp167-182, ⟨10.1007/978-3-642-25379-9_14⟩
Communication dans un congrès
hal-00484871
v4
|
|
Innocent strategies as presheaves and interactive equivalences for CCSICE, Jun 2011, Reykjavik, Iceland. pp.2-24, ⟨10.4204/EPTCS.59.2⟩
Communication dans un congrès
hal-00616648
v1
|
|
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⟩
Communication dans un congrès
hal-00421158
v4
|
|
On Bisimilarity and Substitution in Presence of ReplicationICALP, Jul 2010, Bordeaux, France. pp.454-465, ⟨10.1007/978-3-642-14162-1_38⟩
Communication dans un congrès
hal-00375604
v4
|
|
Deciding Kleene Algebras in CoqITP, Aug 2010, Edinburgh, United Kingdom. pp.163-178, ⟨10.1007/978-3-642-14052-5_13⟩
Communication dans un congrès
hal-00383070
v5
|
|
Encapsulation and Dynamic Modularity in the Pi-CalculusPLACES 2008, 2008, Oslo, Norway. pp.85 - 100, ⟨10.1016/j.entcs.2009.06.005⟩
Communication dans un congrès
hal-00400159
v1
|
|
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⟩
Communication dans un congrès
hal-00089219
v4
|
|
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⟩
Communication dans un congrès
ensl-00155308
v2
|
|
Weak Bisimulation Up to ElaborationCONCUR, 2006, Bonn, Germany. pp.390 - 405, ⟨10.1007/11817949_26⟩
Communication dans un congrès
hal-01441462
v1
|
|
On Bisimulation Proofs for the Analysis of Distributed Abstract MachinesTGC, 2006, Lucca, Italy. ⟨10.1007/978-3-540-75336-0_10⟩
Communication dans un congrès
hal-01441457
v1
|
|
Component-Oriented Programming with Sharing: Containment is not OwnershipGenerative Programming and Component Engineering (GPCE), 2005, Tallinn, Estonia. pp.389-404, ⟨10.1007/11561347_26⟩
Communication dans un congrès
hal-00310126
v1
|
|
Up-to Techniques for Weak BisimulationICALP, 2005, Lisbonne, Portugal. pp.730 - 741, ⟨10.1007/11523468_59⟩
Communication dans un congrès
hal-01441463
v1
|
|
A Correct Abstract Machine for Safe AmbientsCOORDINATION, 2005, Namur, Belgium. ⟨10.1007/11417019_2⟩
Communication dans un congrès
hal-01441466
v1
|
Enhancements of the bisimulation proof methodDavide Sangiorgi and Jan Rutten. Advanced Topics in Bisimulation and Coinduction, Cambridge University Press, 2012
Chapitre d'ouvrage
hal-00909391
v1
|
|
Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines[Research Report] RR-9052, Inria. 2017
Rapport
(rapport de recherche)
hal-01507625
v1
|
|
Decidability of Identity-free Relational Kleene Lattices[Research Report] ENS de Lyon. 2014
Rapport
(rapport de recherche)
hal-01073932
v1
|
|
Techniques modulo pour les bisimulationsInformatique [cs]. ENS Lyon, 2008. Français. ⟨NNT : ⟩
Thèse
tel-01441480
v1
|
|
Automata for relation algebra and formal proofsComputer Science [cs]. ENS Lyon, 2016
HDR
tel-01445821
v1
|
16th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS), ProceedingsPeter 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-02147353
v1
|
Chargement...
Chargement...