 |
|
|
|
| Papers |
|
Papers published in 2006
| [1] |
Diletta Cacciagrano, Flavio Corradini, and Catuscia Palamidessi.
Separation of synchronous and asynchronous communication via testing.
In Proceedings of the 12th International Workshop on
Expressiveness in Concurrency (EXPRESS 2005), volume 154 of Electronic
Notes in Theoretical Computer Science, pages 95-108, San Francisco, USA,
2006. Elsevier Science B.V.
http://www.lix.polytechnique.fr/~catuscia/papers/Diletta/Must/report.pdf. [ bib ] |
| [2] |
Konstantinos Chatzikokolakis and Catuscia Palamidessi.
Probable innocence revisited.
Theoretical Computer Science, 367(1-2):123-138, 2006.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/tcsPI.pdf. [ bib | http ] |
| [3] |
Konstantinos Chatzikokolakis and Catuscia Palamidessi.
Probable innocence revisited.
In Theodosis Dimitrakos, Fabio Martinelli, Peter Y. A. Ryan, and
Steve A. Schneider, editors, Third International Workshop on Formal
Aspects in Security and Trust (FAST 2005), Revised Selected Papers, volume
3866 of Lecture Notes in Computer Science, pages 142-157. Springer,
2006. [ bib | .pdf ] |
| [4] |
Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden.
Anonymity protocols as noisy channels.
In Proceedings of the 2nd Symposium on Trustworthy Global
Computing (TGC), volume 4661 of Lecture Notes in Computer Science,
pages 281-300. Springer, 2006.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/Channels/tgc.pdf. [ bib ] |
| [5] |
Yuxin Deng, Tom Chothia, Catuscia Palamidessi, and Jun Pang.
Metrics for action-labelled quantitative transition systems.
In Proceedings of the Third Workshop on Quantitative Aspects of
Programming Languages (QAPL 2005), volume 153 of Electronic Notes in
Theoretical Computer Science, pages 79-96. Elsevier Science Publishers,
2006.
http://www.lix.polytechnique.fr/~catuscia/papers/Metrics/QAPL/gts.pdf. [ bib ] |
| [6] |
Yuxin Deng, Jun Pang, and Peng Wu, 2006.
Personal Communication. [ bib ] |
| [7] |
Yuxin Deng, Jun Pang, and Peng Wu.
Measuring anonymity with relative entropy.
In T. Dimitrakos, F. Martinelli, P. Y. A. Ryan, and S. A. Schneider,
editors, Proc. of the of the 4th Int. Worshop on Formal Aspects in
Security and Trust, volume 4691 of LNCS, pages 65-79. Springer, 2006. [ bib ] |
| [8] |
Hugo A. López, Catuscia Palamidessi, Jorge, Camilo Rueda, and Frank D.
Valencia.
A declarative framework for security: Secure concurrent constraint
programming.
In Sandro Etalle and Miroslaw Truszczynski, editors, Proceedings
of the 22nd International Conference on logic Programming, (ICLP), volume
4079 of Lecture Notes in Computer Science, pages 449-450. Springer,
2006. [ bib ] |
| [9] |
C. Palamidessi and F. Valencia.
Languages for concurrency.
Bulletin of the European Association for Theoretical Computer
Science, 90:155-171, October 2006.
Column: Programming Languages.
http://www.lix.polytechnique.fr/~catuscia/papers/Frank/EATCS_06/paper.pdf. [ bib ] |
| [10] |
Catuscia Palamidessi.
Anonymity in probabilistic and nondeterministic systems.
In Proceedings of the Workshop on ``Essays on Algebraic Process
Calculi'' (APC 25), volume 162 of Electronic Notes in Theoretical
Computer Science, pages 277-279, Bertinoro, Italy, 2006. Elsevier Science
B.V.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/Bertinoro/paper.pdf. [ bib ] |
| [11] |
Catuscia Palamidessi.
Probabilistic and nondeterministic aspects of anonymity.
In Proceedings of the 21st Conference on the Mathematical
Foundations of Programming Semantics (MFPS XXI), volume 155 of
Electronic Notes in Theoretical Computer Science, pages 33-42, Birmingham,
UK, 2006. Elsevier Science B.V.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/MFPS/paper.pdf. [ bib ] |
| [12] |
Catuscia Palamidessi and Mohit Bhargava.
Probabilistic anonymity.
In José Luiz Fiadeiro, Ugo Montanari, and Martin Wirsing,
editors, Foundations of Global Computing, number 05081 in Dagstuhl
Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum
(IBFI), Schloss Dagstuhl, Germany, 2006.
drops.dagstuhl.de/opus/volltexte/2006/299. [ bib ] |
| [13] |
Catuscia Palamidessi, Vijay A. Saraswat, Frank D. Valencia, and Björn
Victor.
On the expressiveness of linearity vs persistence in the asynchronous
pi-calculus.
In Proceedings of the Twenty First Annual IEEE Symposium on
Logic in Computer Science (LICS), pages 59-68. IEEE Computer Society, 2006.
http://www.lix.polytechnique.fr/~catuscia/papers/Frank/LICS_06/main.pdf. [ bib | http ] |
| [14] |
Sylvain Pradalier and Catuscia Palamidessi.
Expressiveness of probabilistic π-calculi.
In Proceedings of the 4th International Workshop on Quantitative
Aspects of Programming Languages (QAPL), volume 164 (3) of Electronic
Notes in Theoretical Computer Science, pages 119-136. Elsevier Science
B.V., 2006.
http://www.lix.polytechnique.fr/~catuscia/papers/Sylvain/QAPL06/FinalBis.pdf. [ bib ] |
| [15] |
Peng WU and Huimin LIN.
Model-based testing of concurrent programs with predicate sequencing
constraints.
International Journal of Software Engineering and Knowledge
Engineering, 16(5):727-746, 2006.
http://www.worldscinet.com/ijseke/16/1605/S0218194006002999.html. [ bib ] |
| [16] |
Axelle Ziegler, Dale Miller, and Catuscia Palamidessi.
A congruence format for name-passing calculi.
In Proceedings of the 2nd Workshop on Structural Operational
Semantics (SOS'05), volume 156 of Electronic Notes in Theoretical
Computer Science, pages 169-189, Lisbon, Portugal, 2006. Elsevier Science
B.V.
http://www.lix.polytechnique.fr/~catuscia/papers/Axelle/SOS_05/report.pdf. [ bib ] |
This file has been generated by bibtex2html 1.74
Back
Page maintainer: Catuscia Palamidessi