Mots-clés

Automata Kleene algebra with tests Lambda-calculus Abstract machines Decision procedure Bisimulation Coq KAT Converse Coq proof assistant Behavioural equivalences Axiomatisation Bisimulation up-to Kleene algebra Bisimilarity Decidability Congruence Up-to techniques Coinduction Concurrency
› Liste complète
Nombre de documents

45

Damien Pous

Article dans une revue9 documents

  • Filippo Bonchi, Daniela Petrişan, Damien Pous, Jurriaan Rot. A General Account of Coinduction Up-To. Acta Informatica, Springer Verlag, 2016, <10.1007/s00236-016-0271-4>. <hal-01442724>
  • Filippo Bonchi, Damien Pous. Hacking nondeterminism with induction and coinduction. . Communications- ACM, Association for Computing Machinery, 2015, 58 (2), pp.87-95. <10.1145/2713167>. <hal-01284907>
  • Jurriaan Rot, Filippo Bonchi, Marcello Bonsangue, Damien Pous, Jan Rutten, et al.. Enhanced Coalgebraic Bisimulation. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2015, <10.1017/S0960129515000523>. <hal-01288960>
  • Tom Hirschowitz, Damien Pous. Innocent strategies as presheaves and interactive equivalences for CCS (expanded version). Scientific Annals of Computer Science, Alexandru Ioan Cuza University Publishing House, 2012, 22 (1), pp.147-199. <10.7561/SACS.2012.1.147>. <hal-00555144v3>
  • Damien Pous. Untyping Typed Algebras and Colouring Cyclic Linear Logic (expanded). Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2012, <10.2168/LMCS-8(2:13)2012>. <hal-01442739>
  • Damien Pous, Daniel Hirschkoff. A Distribution Law for CCS and a New Congruence Result for the pi-calculus (expanded). Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2008, <10.2168/LMCS-4(2:4)2008>. <hal-01442744>
  • Damien Pous. Using Bisimulation Proof Techniques for the Analysis of Distributed Algorithms. Theoretical Computer Science, Elsevier, 2008, 402 (2-3), pp.199-220. <10.1016/j.tcs.2008.04.035>. <ensl-00149964v3>
  • Damien Pous. New Up-To Techniques for Weak Bisimulation. Theoretical Computer Science, Elsevier, 2007, 380, pp.164 - 180. <10.1016/j.tcs.2007.02.060>. <hal-01442745>
  • Daniel Hirschkoff, Damien Pous, Davide Sangiorgi. An Efficient Abstract Machine for Safe Ambients. Journal of Logic and Algebraic Programming, Elsevier, 2007, <10.1016/j.jlap.2007.02.003>. <hal-01442746>

Communication dans un congrès31 documents

  • Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, et al.. Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines. LICS 2017, Jun 2017, Reykjavik, Iceland. Proceedings of LICS 2017. <hal-01479035>
  • Damien Pous, Jurriaan Rot. Companions, Codensity and Causality. FoSSaCS, Apr 2017, Uppsala, Sweden. <hal-01442222>
  • Paul Brunet, Damien Pous, Insa Stucke. Cardinalities of Finite Relations in Coq (Rough Diamond). Interative Theorem Proving, Aug 2016, Nancy, France. Springer, 9807, pp.466-474, 2016, <10.1007/978-3-319-43144-4_29>. <hal-01441262>
  • Paul Brunet, Damien Pous. Decidability of Identity-free Relational Kleene Lattices. David Baelde; Jade Alglave. Vingt-sixièmes Journées Francophones des Langages Applicatifs (JFLA 2015), Jan 2015, Le Val d'Ajol, France. Actes des Vingt-sixièmes Journées Francophones des Langages Applicatifs (JFLA 2015), <http://jfla.inria.fr/2015>. <hal-01099137>
  • Paul Brunet, Damien Pous. Petri automata for Kleene allegories. Logic in Computer Science, Jul 2015, Kyoto, Japan. IEEE, pp.68-79, 2015, <http://lics.rwth-aachen.de/lics15/>. <10.1109/LICS.2015.17>. <hal-01073936v3>
  • Damien Pous. Coinductive techniques, from automata to coalgebra. Programming Languages Mentoring Workshop, Jan 2015, Mumbai, India. <10.1145/2792434.2792440>. <hal-01288791>
  • Damien Pous. Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests. POPL 2015: 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Jan 2015, Mumbai, India. 2015. <hal-01021497v2>
  • Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot. Lax Bialgebras and Up-To Techniques for Weak Bisimulations. 26th International Conference on Concurrency Theory (CONCUR), Sep 2015, Madrid, Spain. 2015, Leibniz International Proceedings in Informatics (LIPIcs). <10.4230/LIPIcs.CONCUR.2015.240>. <hal-01285299>
  • Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous. Formal verification in Coq of program properties involving the global state effect. JFLA 2014 - Journées Francophones des Langages Applicatifs, Jan 2014, Fréjus, France. pp.1-17, 2014. <hal-00869230v2>
  • Damien Pous, Alan Schmitt. De la KAM avec un Processus d'Ordre Supérieur. JFLAs 2014, Jan 2014, Fréjus, France. pp.1-12, 2014, Actes des 25èmes Journées Francophones des Langages Applicatifs. <hal-00966097v2>
  • Jean-Marie Madiot, Damien Pous, Davide Sangiorgi. Bisimulations up-to: beyond first-order transition systems. CONCUR, Sep 2014, Rome, Italy. 2014, <10.1007/978-3-662-44584-6_8>. <hal-00990859>
  • Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot. Coinduction up to in a fibrational setting. CSL-LICS, Jul 2014, Vienne, Austria. ACM, pp.1-12, 2014, <10.1145/2603088.2603149>. <hal-00936488v2>
  • Paul Brunet, Damien Pous. Kleene Algebra with Converse. RAMiCS, Apr 2014, Marienstatt im Westerwald, Germany. Springer, 8428, pp.101-118, 2014, LNCS. <hal-00938235>
  • Fabienne Boyer, Olivier Gruber, Damien Pous. Robust reconfigurations of component assemblies. ICSE '13 - International Conference on Software Engineering, May 2013, San Francisco, United States. IEEE/ACM, pp.13-22, 2013, <http://dl.acm.org/citation.cfm?id=2486791>. <hal-00966078>
  • Damien Pous. Coalgebraic Up-to Techniques. CALCO, Sep 2013, Warsaw, Poland. Springer, 8089, 2013, LNCS. <10.1007/978-3-642-40206-7_4>. <hal-00966075>
  • Damien Pous. Kleene Algebra with Tests and Coq Tools for While Programs. Interactive Theorem Proving 2013, Jul 2013, Rennes, France. Springer, 7998, pp.180-196, 2013, LNCS. <10.1007/978-3-642-39634-2_15>. <hal-00785969>
  • Filippo Bonchi, Georgiana Caltais, Damien Pous, Alexandra Silva. Brzozowski's and Up-To Algorithms for Must Testing. 11th Asian Symposium on Programming Languages and Systems (APLAS), Dec 2013, Melbourne, Australia. Springer, 8301, pp.1-16, 2013, LNCS. <10.1007/978-3-319-03542-0_1>. <hal-00966072>
  • Filippo Bonchi, Damien Pous. Checking NFA equivalence with bisimulations up to congruence. Principle of Programming Languages (POPL), Jan 2013, Roma, Italy. ACM, pp.457-468, 2013, <10.1145/2429069.2429124>. <hal-00639716v5>
  • Thomas Braibant, Damien Pous. Tactics for Reasoning modulo AC in Coq. Certified Proofs and Programs, 2011, Taiwan. pp167-182, 2011, <10.1007/978-3-642-25379-9_14>. <hal-00484871v4>
  • Tom Hirschowitz, Damien Pous. Innocent strategies as presheaves and interactive equivalences for CCS. ICE, Jun 2011, Reykjavik, Iceland. 59, pp.2-24, 2011, EPTCS. <10.4204/EPTCS.59.2>. <hal-00616648>
  • Daniel Hirschkoff, Damien Pous. On Bisimilarity and Substitution in Presence of Replication. ICALP, Jul 2010, Bordeaux, France. Springer, 6199, pp.454-465, 2010, LNCS. <10.1007/978-3-642-14162-1_38>. <hal-00375604v4>
  • Damien Pous. Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic. Computer Science Logic, Aug 2010, Czech Republic. Springer, 6247, pp.484-498, 2010, LNCS. <10.1007/978-3-642-15205-4_37>. <hal-00421158v4>
  • Thomas Braibant, Damien Pous. Deciding Kleene Algebras in Coq. ITP, Aug 2010, Edinburgh, United Kingdom. Springer, 6172, pp.163-178, 2010, LNCS. <10.1007/978-3-642-14052-5_13>. <hal-00383070v5>
  • Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous. Encapsulation and Dynamic Modularity in the Pi-Calculus. PLACES 2008, 2008, Oslo, Norway. Elsevier, 241, pp.85 - 100, 2009, Electronic Notes in Theoretical Computer Science. <10.1016/j.entcs.2009.06.005>. <hal-00400159>
  • Damien Pous. Complete Lattices and Up-to Techniques. Zhong Shao. 5th Asian Symposium on Programming Languages and Systems, Singapore, Singapore. Springer Berlin / Heidelberg, pp.351-366, 2007, volume 4807 of Lecture Notes in Computer Science. <10.1007/978-3-540-76637-7_24>. <ensl-00155308v2>
  • Daniel Hirschkoff, Damien Pous. A Distribution Law for CCS and a New Congruence Result for the pi-calculus. FoSSaCS, 2007, Braga, Portugal. <10.1007/978-3-540-71389-0_17>. <hal-00089219v4>
  • Damien Pous. Weak Bisimulation Up to Elaboration. CONCUR, 2006, Bonn, Germany. pp.390 - 405, 2006, <10.1007/11817949_26>. <hal-01441462>
  • Damien Pous. On Bisimulation Proofs for the Analysis of Distributed Abstract Machines. TGC, 2006, Lucca, Italy. 2006, <10.1007/978-3-540-75336-0_10>. <hal-01441457>
  • Daniel Hirschkoff, Tom Hirschowitz, Damien Pous, Alan Schmitt, Jean-Bernard Stefani. Component-Oriented Programming with Sharing: Containment is not Ownership. Generative Programming and Component Engineering (GPCE), 2005, Tallinn, Estonia. Springer, 3676, pp.389-404, 2005, Lecture Notes in Computer Science. <10.1007/11561347_26>. <hal-00310126>
  • Damien Pous. Up-to Techniques for Weak Bisimulation. ICALP, 2005, Lisbonne, Portugal. pp.730 - 741, 2005, <10.1007/11523468_59>. <hal-01441463>
  • Daniel Hirschkoff, Damien Pous, Davide Sangiorgi. A Correct Abstract Machine for Safe Ambients. COORDINATION, 2005, Namur, Belgium. <10.1007/11417019_2>. <hal-01441466>

Chapitre d'ouvrage1 document

  • Damien Pous, Davide Sangiorgi. Enhancements of the bisimulation proof method. Davide Sangiorgi and Jan Rutten. Advanced Topics in Bisimulation and Coinduction, Cambridge University Press, 2012. <hal-00909391>

Rapport2 documents

  • Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, et al.. Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines. [Research Report] RR-9052, Inria. 2017. <hal-01507625>
  • Paul Brunet, Damien Pous. Decidability of Identity-free Relational Kleene Lattices. 2014. <hal-01073932>

Thèse1 document

  • Damien Pous. Techniques modulo pour les bisimulations. Informatique [cs]. ENS Lyon, 2008. Français. <tel-01441480>

HDR1 document

  • Damien Pous. Automata for relation algebra and formal proofs. Computer Science [cs]. ENS Lyon, 2016. <tel-01445821>