- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c13 |      | Filippo Bonchi, Damien Pous: Checking NFA equivalence with bisimulations up to congruence. POPL 2013: 457-468 |
| i6 | | |
| 2012 | ||
| j8 | | Thomas Braibant, Damien Pous: Deciding Kleene Algebras in Coq. Logical Methods in Computer Science 8(1) (2012) |
| j7 | | Damien Pous: Untyping Typed Algebras and Colouring Cyclic Linear Logic. Logical Methods in Computer Science 8(2) (2012) |
| j6 | | Tom Hirschowitz, Damien Pous: Innocent Strategies as Presheaves and Interactive Equivalences for CCS. Sci. Ann. Comp. Sci. 22(1): 147-199 (2012) |
| 2011 | ||
| c12 | | |
| c11 | | Tom Hirschowitz, Damien Pous: Innocent strategies as presheaves and interactive equivalences for CCS. ICE 2011: 2-24 |
| i5 | | |
| i4 | | Tom Hirschowitz, Damien Pous: Strategies as sheaves and interactive equivalences for CCS. CoRR abs/1109.4356 (2011) |
| 2010 | ||
| c10 | | Damien Pous: Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic. CSL 2010: 484-498 |
| c9 | | Daniel Hirschkoff, Damien Pous: On Bisimilarity and Substitution in Presence of Replication. ICALP (2) 2010: 454-465 |
| c8 | | Thomas Braibant, Damien Pous: An Efficient Coq Tactic for Deciding Kleene Algebras. ITP 2010: 163-178 |
| 2009 | ||
| j5 | | Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous: Encapsulation and Dynamic Modularity in the pi-calculus. Electr. Notes Theor. Comput. Sci. 241: 85-100 (2009) |
| i3 | | Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous: Encapsulation and Dynamic Modularity in the Pi-Calculus. CoRR abs/0906.5446 (2009) |
| 2008 | ||
| j4 | | Daniel Hirschkoff, Damien Pous: A Distribution Law for CCS and a New Congruence Result for the p-calculus. Logical Methods in Computer Science 4(2) (2008) |
| j3 | | Damien Pous: Using bisimulation proof techniques for the analysis of distributed abstract machines. Theor. Comput. Sci. 402(2-3): 199-220 (2008) |
| i2 | | Daniel Hirschkoff, Damien Pous: On characterising strong bisimilarity in a fragment of CCS with replication. CoRR abs/0810.2061 (2008) |
| 2007 | ||
| j2 | | Daniel Hirschkoff, Damien Pous, Davide Sangiorgi: An efficient abstract machine for Safe Ambients. J. Log. Algebr. Program. 71(2): 114-149 (2007) |
| j1 | | Damien Pous: New up-to techniques for weak bisimulation. Theor. Comput. Sci. 380(1-2): 164-180 (2007) |
| c7 | | |
| c6 | | Daniel Hirschkoff, Damien Pous: A Distribution Law for CCS and a New Congruence Result for the pi-Calculus. FoSSaCS 2007: 228-242 |
| 2006 | ||
| c5 | | |
| c4 | | Damien Pous: On Bisimulation Proofs for the Analysis of Distributed Abstract Machines. TGC 2006: 150-166 |
| i1 | | Daniel Hirschkoff, Damien Pous: A Distribution Law for CCS and a New Congruence Result for the pi-calculus. CoRR abs/cs/0608059 (2006) |
| 2005 | ||
| c3 | | Daniel Hirschkoff, Damien Pous, Davide Sangiorgi: A Correct Abstract Machine for Safe Ambients. COORDINATION 2005: 17-32 |
| c2 | | Daniel Hirschkoff, Tom Hirschowitz, Damien Pous, Alan Schmitt, Jean-Bernard Stefani: Component-Oriented Programming with Sharing: Containment is Not Ownership. GPCE 2005: 389-404 |
| c1 | | |
| 1 | Filippo Bonchi | |
| 2 | Thomas Braibant | |
| 3 | Daniel Hirschkoff | |
| 4 | Tom Hirschowitz | |
| 5 | Samuel Hym | |
| 6 | Aurélien Pardon | |
| 7 | Davide Sangiorgi | |
| 8 | Alan Schmitt | |
| 9 | Jean-Bernard Stefani |
Data released under the ODC-BY 1.0 license — See also our legal information page