MoDyFiable bibliography

Refereed journal papers

Daniel Hirschkoff and Damien Pous. A Distribution Law for CCS and a New Congruence Result for the pi-calculus. Logical Methods in Computer Science, 4(2), 2008. [ bib | http ]

Damien Pous. Using bisimulation proof techniques for the analysis of distributed abstract machines. tcs, 402(2-3):199-220, 2008. [ bib | http ]

Damien Pous. New Up-to Techniques for Weak Bisimulation. Theoretical Computer Science, 380(1-2):164-180, 2007. [ bib | http ]

Daniel Hirschkoff, Damien Pous, and Davide Sangiorgi. An Efficient Abstract Machine for Safe Ambients. Journal of Algebraic and Logic Programming, 71(2):114-149, 2007. [ bib | http ]

Refereed conference papers

Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi, and Alan Schmitt. On the Expressiveness and Decidability of Higher-Order Process Calculi. In Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008), pages 145-155, June 2008. [ bib ]

Michaël Lienhardt, Vivien Quéma, Alan Schmitt, and Jean-Bernard Stefani. Typing Communicating Component Assemblages. In Proceedings of the 7th International Conference on Generative Programming and Component Engineering (GPCE'08), 2008. [ bib ]

Romain Demangeon, Daniel Hirschkoff, Naoki Kobayashi, and Davide Sangiorgi. On the Complexity of Termination Inference for Processes. In Proc. of TGC'07, volume 4912 of Lecture Notes in Computer Science, pages 140-155, 2008. [ bib ]

Romain Demangeon, Daniel Hirschkoff, and Davide Sangiorgi. Static and dynamic typing for the termination of mobile processes. In Proc. of IFIP TCS, volume 273 of IFIP, pages 413-427. Springer, 2008. [ bib ]

Michaël Lienhardt, Jean-Bernard Stefani, and Alan Schmitt. Oz/K: A Kernel Language for Component-Based Open Programming. In ACM, editor, 6th International Conference on Generative Programming and Component Engineering (GPCE'07), pages 43-52, October 2007. [ bib ]

Daniel Hirschkoff and Damien Pous. A Distribution Law for CCS and a New Congruence Result for the π-calculus. In Proc. FOSSACS '07, volume 4423 of LNCS, pages 228-242. Springer Verlag, 2007. [ bib | http ]

Damien Pous. Complete Lattices and Up-to Techniques. In Proc. APLAS '07, volume 4807 of LNCS, pages 351-366. Springer Verlag, 2007. [ bib | http ]

Damien Pous. Weak Bisimulation up to Elaboration. In Proc. CONCUR '06, volume 4137 of LNCS, pages 390-405. Springer Verlag, 2006. [ bib | http ]

Damien Pous. On Bisimulation Proofs for the Analysis of Distributed Abstract Machines. In Proc. TGC '06, volume 4661 of LNCS, pages 150-166. Springer Verlag, 2006. [ bib | http ]

Workshop papers

Daniel Hirschkoff, Tom Hirschowitz, Samuel Hym, Aurélien Pardon, and Damien Pous. Encapsulation and Dynamic Modularity in the π-calculus. In Proc. PLACES '08, 2008. [ bib ]

Preprints, research reports

Sergueï Lenglet, Alan Schmitt, and Jean-Bernard Stefani. Normal bisimulations in process calculi with passivation. Research Report RR-6664, INRIA, 2008. [ bib ]

André Hirschowitz, Michel Hirschowitz, and Tom Hirschowitz. Topological Observations on Multiplicative Additive Linear Logic. CoRR, abs/0807.2636, 2008. [ bib ]

Tom Hirschowitz and Aurélien Pardon. Binding bigraphs as symmetric monoidal closed theories. CoRR, abs/0810.4419, 2008. [ bib ]

Richard H. G. Garner, Tom Hirschowitz, and Aurélien Pardon. Graphical Presentations of Symmetric Monoidal Closed Theories. CoRR, abs/0810.4420, 2008. [ bib ]