% Publisher @string{ap="Academic Press"} @string{cup="Cambridge University Press"} @string{mcgh="Mc Graw-Hill"} @string{nh="North Holland"} @string{sv="Springer"} @string{aw="Addison-Wesley"} @string{ph="Prentice Hall"} @string{mp="The MIT Press"} @string{acmp="ACM Press"} % Institutions-Schools @string{cmum="Carnegie-Mellon Univ., Dept. of Math."} @string{cucs="Cornell Univ., Dept. of Comp. Sci."} @string{eth="E.T.H. Zurich"} @string{eucs="Edinburgh Univ., Dept. of Comp. Sci."} @string{mit="Massachusetts Institute of Technology"} @string{lfcs="LFCS, Dept. of Comp. Sci., Edinburgh Univ."} @string{lip="LIP -- ENS Lyon"} @string{hal="http://hal.archives-ouvertes.fr/"} % Organizations @string{acm="ACM"} @string{ieee="IEEE"} @string{bl="Bell Laboratories"} % Journals @string{acta="Acta Informatica"} @string{acmsigp="ACM Sigplan Notices"} @string{a&l="Algebra and Logic"} @string{aml="Annals of Mathematical Logic"} @string{amstran="Trans. AMS"}, @string{au="Algebra Universalis"} @string{cmsjb="Colloquia Mathematica Societatis Janos Bolyai"}, @string{dm="Dissertationes Mathematicae"} @string{fm="Fundamenta Matematicae"} @string{ic="Information and Computation"} @string{im="Indagationes Mathematicae"} @string{jcss="JCSS"} @string{jlap="Journal of Logic and Algebraic Programming"} @string{jmscs="Journal of Math. Struct. in Computer Science"} @string{jpaa="Journal of Pure and Applied Algebra"} @string{jsl="Journal of Symbolic Logic"} @string{mpcps="Math. Proc. Camb. Phil. Soc."} @string{mst="Mathematical System Theory"} @string{rmup="Rivista Matematica dell' Universita' di Parma"} @string{siamjc="SIAM Journal of Computing"} @string{tpls="ACM Trans. on Progr. Lang. and Sys."} @string{tcl="ACM Trans. on Comput. Logic"} @string{tcs="Theoretical Computer Science"} @string{zml="Zeitschrift fur Mathematische Logik"} @string{zmlgm="Zeitschr. f. math. Logik und Grundlagen d. Math."} @string{entcs="Electronical Notes in Computer Science"} % Series %@string{lncs="Lecture Notes in Computer Science"} @string{lncs="LNCS"} @string{lnm="Lecture Notes in Mathematics"} @string{csam="Cambridge Studies in Advanced Mathematics"} @string{sl="Studies in Logic"} @string{eptcs="EPTCS"} % Collections @string{ash="Applications of Sheaves"} @string{asls82="Atti della Scuola di Logica di Siena, 1982"} @string{bcs="The L.E.J. Brouwer Centenary Symposium"} @string{hbc="To H.B. Curry: essays in Combinatory Logic, lambda calculus and Formalisms"} @string{hml="Handbook of Mathematical Logic"} @string{hphl="Handbook of Philosophical Logic"} %Proceedings @string{caap85="Proc.\ CAAP~'85"} @string{cics89="Category in Computer Science~'89"} @string{conc91="Proc.\ 2nd CONCUR"} @string{conc92="Proc.\ 3rd CONCUR"} @string{conc93="Proc.\ 4th CONCUR"} @string{conc02="Proc.\ CONCUR~'02"} @string{conc03="Proc.\ CONCUR~'03"} @string{conc06="Proc.\ CONCUR~'06"} @string{esop86="ESOP~'86"} @string{esop04="ESOP~'04"} @string{fcs22="22th Symp. on Foundations of Computer Science"} @string{fcs25="25th Symp. on Foundations of Computer Science"} @string{fossacs98="Proc.\ FOSSACS~'98"} @string{icalp9="9th Colloquium on Automata, Languages and Programming"} @string{icalp85="Proc.\ 12th ICALP"} @string{icalp88="Proc.\ 15th ICALP"} @string{icalp92="Proc.\ 19th ICALP"} @string{icalp97="Proc.\ 24th ICALP"} @string{icalp98="Proc.\ 25th ICALP"} @string{icalp01="Proc.\ 28th ICALP"} @string{icalp04="Proc.\ 31th ICALP"} @string{icalp05="Proc.\ 32th ICALP"} @string{lc73="Logic Colloquium~'73"} @string{lc75="Logic Colloquium~'75"} @string{lc82="Logic Colloquium~'82"} @string{lp83="Logics of Programs~'83"} @string{lp84="Logics of Programs~'84"} @string{lp85="Logics of Programs~'85"} @string{lics1="Proc.\ 1st LICS Conf."} @string{lics2="Proc.\ 2nd LICS Conf."} @string{lics3="Proc.\ 3rd LICS Conf."} @string{lics4="Proc.\ 4th LICS Conf."} @string{lics7="Proc.\ 7th LICS Conf."} @string{lics92="Proc.\ 7th LICS Conf."} @string{lics93="Proc.\ 8th LICS Conf."} @string{lics96="Proc.\ 11th LICS Conf."} @string{lics98="Proc.\ 13th LICS Conf."} @string{mfcs84="Proc.\ MFCS~'84"} @string{mfcs86="Proc.\ MFCS~'86"} @string{mfcs89="Proc.\ MFCS~'89"} @string{mfcs95="Proc.\ MFCS~'95"} @string{popl1="Proc.\ 1st POPL"} @string{popl4="Proc.\ 4th POPL"} @string{popl6="Proc.\ 6th POPL"} @string{popl10="Proc.\ 10th POPL"} @string{popl11="Proc.\ 11th POPL"} @string{popl12="Proc.\ 12th POPL"} @string{popl13="Proc.\ 13th POPL"} @string{popl14="Proc.\ 14th POPL"} @string{popl15="Proc.\ 15th POPL"} @string{popl17="Proc.\ 17th POPL"} @string{popl24="Proc.\ 24th POPL"} @string{popl27="Proc.\ 27th POPL"} @string{popl28="Proc.\ 28th POPL"} @string{ps74="Programming Symposium~'74"} @string{sls2="2nd Scandinavian Logic Symp."} @string{stacs86="Proc.\ STACS~'86"} @string{stacs88="Proc.\ STACS~'88"} @string{tapsoft87="Proc.\ TAPSOFT~'87"} @string{tapsoft89="Proc.\ TAPSOFT~'89"} @string{coord05="Proc.\ COORD~'05"} @InProceedings{pous:icalp05:upto, title = {Up-to {T}echniques for {W}eak {B}isimulation}, author = {Damien Pous}, booktitle = icalp05, year = 2005, series = lncs, publisher = sv, volume = 3580, pages = {730-741}, url = "http://dx.doi.org/10.1007/11523468_59", } @inproceedings{hhpss:gpce05, author = {Daniel Hirschkoff and Tom Hirschowitz and Damien Pous and Alan Schmitt and Jean-Bernard Stefani}, title = {Component-Oriented Programming with Sharing: Containment is Not Ownership}, booktitle = {Proc.\ GPCE}, year = {2005}, pages = {389-404}, url = {http://dx.doi.org/10.1007/11561347_26}, publisher = sv, series = lncs, volume = {3676}, } @InProceedings{pous:concur06:elabo, title = {Weak {B}isimulation up to {E}laboration}, author = {Damien Pous}, booktitle = conc06, publisher = sv, year = 2006, volume = 4137, series = lncs, pages = {390-405}, url = "http://dx.doi.org/10.1007/11817949_26", } @inproceedings{pous:tgc06:fwds:upto, author = {Damien Pous}, title = {On Bisimulation Proofs for the Analysis of Distributed Abstract Machines}, booktitle = {Proc.\ TGC}, year = 2006, pages = {150-166}, url = {http://dx.doi.org/10.1007/978-3-540-75336-0_10}, publisher = sv, series = lncs, volume = 4661, } @Article{hps:jlap07:gcpan, title = {An {E}fficient {A}bstract {M}achine for {S}afe {A}mbients}, author = {Daniel Hirschkoff and Damien Pous and Davide Sangiorgi}, journal = jlap, volume = 71, number = 2, year = 2007, pages = {114-149}, url = {http://dx.doi.org/10.1016/j.jlap.2007.02.003}, } @Article{pous:tcs07:upto, title = {New {U}p-to {T}echniques for {W}eak {B}isimulation}, author = {Damien Pous}, journal = tcs, volume = 380, number = {1-2}, year = 2007, pages = {164-180}, URL = {http://dx.doi.org/10.1016/j.tcs.2007.02.060}, } @Article{hp:lmcs07:minipi, author = {Daniel Hirschkoff and Damien Pous}, title = {A Distribution Law for {CCS} and a New Congruence Result for the $\pi$-calculus}, journal = {Logical Methods in Computer Science}, year = 2008, url = {http://dx.doi.org/10.2168/LMCS-4(2:4)2008}, volume = 4, number = {2:4} } @InProceedings{pous:aplas07:clut, author = {Damien Pous}, title = {Complete Lattices and Up-To Techniques}, booktitle = {Proc.\ APLAS}, pages = {351-366}, year = 2007, volume = 4807, series = lncs, publisher = sv, url = {http://dx.doi.org/10.1007/978-3-540-76637-7_24}, } @inproceedings{hp:fossacs07:minipi, author = {Daniel Hirschkoff and Damien Pous}, title = {A Distribution Law for {CCS} and a New Congruence Result for the pi-calculus}, booktitle = {Proc.\ 10th FoSSaCS}, year = {2007}, pages = {228-242}, url = {http://dx.doi.org/10.1007/978-3-540-71389-0_17}, publisher = sv, series = lncs, volume = {4423}, } @Article{pous:tcs08:fwd:upto, author = {Damien Pous}, title = {Using Bisimulation Proof Techniques for the Analysis of Distributed Algorithms}, journal = tcs, year = 2008, volume = 402, number = {2-3}, pages = {199-220}, url = {http://dx.doi.org/10.1016/j.tcs.2008.04.035}, } @PhdThesis{pous:phd, author = {Damien Pous}, title = {Techniques modulo pour les bisimulations}, school = {\'Ecole Normale Sup\'erieure de Lyon}, year = 2008, month = {February}, url = {http://www.ens-lyon.fr/LIP/Pub/Rapports/PhD/PhD2008/PhD2008-02.pdf}, } @article{hhp:lmcs09:kepi, author = {Daniel Hirschkoff and Aur{\'e}lien Pardon and Tom Hirschowitz and Samuel Hym and Damien Pous}, title = {Encapsulation and Dynamic Modularity in the pi-calculus}, journal = entcs, volume = {241}, year = {2009}, pages = {85-100}, url = {http://dx.doi.org/10.1016/j.entcs.2009.06.005}, } @InProceedings{hp:icalp10:seeds, author = {Daniel Hirschkoff and Damien Pous}, title = {On characterising strong bisimilarity in a fragment of {CCS} with replication}, booktitle = {Proc.\ ICALP}, year = 2010, pages = {454-465}, series = lncs, volume = 6199, publisher = sv, url = {http://dx.doi.org/10.1007/978-3-642-14162-1_38}, } @Misc{pous:camcad09:utas, author = {Damien Pous}, title = {Untyping Typed Algebraic Structures}, howpublished = {CAM-CAD Workshop}, month = {October}, year = 2009, url = {http://hal.archives-ouvertes.fr/hal-00421158/}, note = {(Available as a HAL report)}, } @InProceedings{pous:csl10:utas, author = {Damien Pous}, title = {Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic}, booktitle = {Proc.\ CSL}, month = {August}, year = 2010, series = lncs, volume = 6247, pages = {484-498}, publisher = sv, url = {http://dx.doi.org/10.1007/978-3-642-15205-4_37}, } @Misc{bp:coq09:kacoq, author = {Thomas Braibant and Damien Pous}, title = {A Tactic for Deciding {K}leene Algebras}, howpublished = {1st Coq Workshop}, month = {August}, year = 2009, url = {http://hal.archives-ouvertes.fr/hal-00383070/}, note = {(Available as a HAL report)}, } @Misc{bp:coqworkshop10:aacrewrite, author = {Thomas Braibant and Damien Pous}, title = {Rewriting modulo Associativity and Commutativity in Coq}, howpublished = {2nd Coq Workshop}, month = {July}, year = 2010, url = {http://hal.archives-ouvertes.fr/hal-00484871/}, note = {(Available as a HAL report)}, } @InProceedings{bp:itp10:kacoq, author = {Thomas Braibant and Damien Pous}, title = {An Efficient Coq Tactic for Deciding {K}leene Algebras}, booktitle = {Proc.\ 1st ITP}, year = 2010, series = lncs, publisher = sv, volume = 6172, pages = {163-178}, url = {http://dx.doi.org/10.1007/978-3-642-14052-5_13}, } @InBook{pous:dsbook11, author = {Damien Pous and Davide Sangiorgi}, title = {Advanced Topics in Bisimulation and Coinduction}, chapter = {about ``Enhancements of the coinductive proof method''}, publisher = cup, isbn = 9781107004979, year = 2011, url = {http://www.cambridge.org/gb/knowledge/isbn/item6542021} } @InProceedings{bp:cpp11:aac, author = {Thomas Braibant and Damien Pous}, title = {Tactics for Reasoning modulo {AC} in {C}oq}, booktitle = {Proc.\ 1st CPP}, year = 2011, series = lncs, publisher = sv, volume = 7086, pages = {167-182}, url = {http://arxiv.org/abs/1106.4448}, } @InProceedings{hp:ice11:cantaloupe, author = {Tom Hirschowitz and Damien Pous}, title = {Innocent strategies as presheaves and interactive equivalences for {CCS}}, booktitle = {Proc.\ ICE}, year = 2011, series = eptcs, volume = 59, url = {http://dx.doi.org/10.4204/EPTCS.59.2}, } @Article{bp:lmcs11:kacoq, author = {Thomas Braibant and Damien Pous}, title = {Deciding Kleene Algebras in Coq}, journal = {LMCS}, year = 2011, note = {accepted, to appear} url = {http://fr.arxiv.org/abs/1105.4537v1}, }