- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 23 |      | Thomas Braibant, Damien Pous: Deciding Kleene Algebras in Coq Logical Methods in Computer Science 8(1): (2012) |
| 2011 | ||
| 22 | | Thomas Braibant, Damien Pous: Tactics for Reasoning Modulo AC in Coq. CPP 2011: 167-182 |
| 21 | | Tom Hirschowitz, Damien Pous: Innocent strategies as presheaves and interactive equivalences for CCS ICE 2011: 2-24 |
| 20 | | Thomas Braibant, Damien Pous: Tactics for Reasoning modulo AC in Coq CoRR abs/1106.4448: (2011) |
| 19 | | Tom Hirschowitz, Damien Pous: Strategies as sheaves and interactive equivalences for CCS CoRR abs/1109.4356: (2011) |
| 2010 | ||
| 18 | | Damien Pous: Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic. CSL 2010: 484-498 |
| 17 | | Daniel Hirschkoff, Damien Pous: On Bisimilarity and Substitution in Presence of Replication. ICALP (2) 2010: 454-465 |
| 16 | | Thomas Braibant, Damien Pous: An Efficient Coq Tactic for Deciding Kleene Algebras. ITP 2010: 163-178 |
| 2009 | ||
| 15 | | Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous: Encapsulation and Dynamic Modularity in the Pi-Calculus CoRR abs/0906.5446: (2009) |
| 14 | | 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) |
| 2008 | ||
| 13 | | Daniel Hirschkoff, Damien Pous: On characterising strong bisimilarity in a fragment of CCS with replication CoRR abs/0810.2061: (2008) |
| 12 | | 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) |
| 11 | | Damien Pous: Using bisimulation proof techniques for the analysis of distributed abstract machines. Theor. Comput. Sci. 402(2-3): 199-220 (2008) |
| 2007 | ||
| 10 | | Damien Pous: Complete Lattices and Up-To Techniques. APLAS 2007: 351-366 |
| 9 | | Daniel Hirschkoff, Damien Pous: A Distribution Law for CCS and a New Congruence Result for the pi-Calculus. FoSSaCS 2007: 228-242 |
| 8 | | Daniel Hirschkoff, Damien Pous, Davide Sangiorgi: An efficient abstract machine for Safe Ambients. J. Log. Algebr. Program. 71(2): 114-149 (2007) |
| 7 | | Damien Pous: New up-to techniques for weak bisimulation. Theor. Comput. Sci. 380(1-2): 164-180 (2007) |
| 2006 | ||
| 6 | | Damien Pous: Weak Bisimulation Up to Elaboration. CONCUR 2006: 390-405 |
| 5 | | Damien Pous: On Bisimulation Proofs for the Analysis of Distributed Abstract Machines. TGC 2006: 150-166 |
| 4 | | Daniel Hirschkoff, Damien Pous: A Distribution Law for CCS and a New Congruence Result for the pi-calculus CoRR abs/cs/0608059: (2006) |
| 2005 | ||
| 3 | | Daniel Hirschkoff, Damien Pous, Davide Sangiorgi: A Correct Abstract Machine for Safe Ambients. COORDINATION 2005: 17-32 |
| 2 | | Daniel Hirschkoff, Tom Hirschowitz, Damien Pous, Alan Schmitt, Jean-Bernard Stefani: Component-Oriented Programming with Sharing: Containment is Not Ownership. GPCE 2005: 389-404 |
| 1 | | Damien Pous: Up-to Techniques for Weak Bisimulation. ICALP 2005: 730-741 |
| 1 | Thomas Braibant | [16] [20] [22] [23] |
| 2 | Daniel Hirschkoff | [2] [3] [4] [8] [9] [12] [13] [14] [15] [17] |
| 3 | Tom Hirschowitz | [2] [14] [15] [19] [21] |
| 4 | Samuel Hym | [14] [15] |
| 5 | Aurélien Pardon | [14] [15] |
| 6 | Davide Sangiorgi | [3] [8] |
| 7 | Alan Schmitt | [2] |
| 8 | Jean-Bernard Stefani | [2] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page