 |
|
|
|
| Papers |
|
Papers published in 2005
| [1] |
Mohit Bhargava and Catuscia Palamidessi.
Probabilistic anonymity.
In MartÃn Abadi and Luca de Alfaro, editors, Proceedings of
CONCUR, volume 3653 of Lecture Notes in Computer Science, pages
171-185. Springer, 2005.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/concur.pdf. [ bib ] |
| [2] |
Mohit Bhargava and Catuscia Palamidessi.
Probabilistic anonymity.
Technical report, INRIA Futurs and LIX, 2005.
To appear in the proceedings of CONCUR 2005. Report version available
at
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/report.ps. [ bib ] |
| [3] |
Konstantinos Chatzikokolakis and Catuscia Palamidessi.
A framework for analyzing probabilistic protocols and its application
to the partial secrets exchange.
In Proceedings of the Symp. on Trustworthy Global Computing,
volume 3705 of Lecture Notes in Computer Science, pages 146-162.
Springer, 2005.
http://www.lix.polytechnique.fr/~catuscia/papers/PartialSecrets/tgc05.pdf. [ bib ] |
| [4] |
Konstantinos Chatzikokolakis and Catuscia Palamidessi.
Probable innocence revisited.
Technical report, INRIA Futurs and LIX, 2005.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/reportPI.pdf. [ bib ] |
| [5] |
Tom Chothia and Konstantinos Chatzikokolakis.
A survey of anonymous peer-to-peer file-sharing.
In Proceedings of the IFIP International Symposium on
Network-Centric Ubiquitous Systems (NCUS 2005), volume 3823 of Lecture
Notes in Computer Science, pages 744-755. Springer, 2005. [ bib ] |
| [6] |
Stefan S. Dantchev and Frank D. Valencia.
On the computational limits of infinite satisfaction.
In Proceedings of the 20th ACM Symposium on Applied Computing,
pages 393-397. ACM Press, 2005. [ bib | .pdf ] |
| [7] |
Yuxin Deng and Catuscia Palamidessi.
Axiomatizations for probabilistic finite-state behaviors.
In Proceedings of FOSSACS'05, volume 3441 of Lecture Notes
in Computer Science, pages 110-124. Springer, 2005.
http://www.lix.polytechnique.fr/~catuscia/papers/Prob_Axiom/fossacs05.pdf. [ bib ] |
| [8] |
Yuxin Deng, Catuscia Palamidessi, and Jun Pang.
Compositional reasoning for probabilistic finite-state behaviors.
In Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, and
Roel C. de Vrijer, editors, Processes, Terms and Cycles: Steps on the
Road to Infinity, volume 3838 of Lecture Notes in Computer Science,
pages 309-337. Springer, 2005.
http://www.lix.polytechnique.fr/~catuscia/papers/Yuxin/BookJW/par.pdf. [ bib ] |
| [9] |
Catuscia Palamidessi and Oltea M. Herescu.
A randomized encoding of the π-calculus with mixed choice.
Theoretical Computer Science, 335(2-3):373-404, 2005.
http://www.lix.polytechnique.fr/~catuscia/papers/prob_enc/report.pdf. [ bib | http ] |
| [10] |
Catuscia Palamidessi, Iain Phillips, and Maria Grazia Vigliotti.
Expressiveness via leader election problems.
In Frank S. de Boer, Marcello M. Bonsangue, Susanne Graf, and
Willem P. de Roever, editors, Postproceedings of the 4th International
Symposium on Formal Methods for Components and Objects (FMCO), volume 4111
of Lecture Notes in Computer Science, pages 172-194. Springer, 2005.
http://www.lix.polytechnique.fr/~catuscia/papers/2006/MariaGrazia/FMCO/fmco-06.pdf. [ bib ] |
| [11] |
Catuscia Palamidessi and Frank D. Valencia.
Recursion vs replication in process calculi: Expressiveness.
Bulletin of the EATCS, 87:105-125, 2005.
Column: Concurrency.
http://www.lix.polytechnique.fr/~catuscia/papers/Frank/EATCS_05/recrep.pdf. [ bib ] |
| [12] |
Sylvain Pradalier, 2005.
Rapport de stage. Master Parisien de Recherche en Informatique.
http://mpri.master.univ-paris7.fr/attached-documents/stages-2005-rapports/rapport-2005-pradalier.pdf. [ bib ] |
| [13] |
Frank D. Valencia.
Decidability of infinite-state timed CCP processes and first-order
LTL.
Theoretical Computer Science, 330(3):577-607, 2005. [ bib ] |
This file has been generated by bibtex2html 1.74
Back
Page maintainer: Catuscia Palamidessi