 |
|
|
|
| Papers |
|
Papers published in 2007
| [1] |
J. Aranda, C. Di Giusto, M. Nielsen, and F. Valencia.
CCS with replication in the Chomsky hierarchy: The expressive
power of divergence.
In Proc. of The Fifth ASIAN Symposium on Programming Languages
(APLAS'07), number 4807 in LNCS, pages 383-398. Springer, 2007.
http://www.brics.dk/~fvalenci/papers/aplas.pdf. [ bib ] |
| [2] |
Jesus Aranda, Cinzia Di Giusto, Catuscia Palamidessi, and Frank Valencia.
Expressiveness of recursion, replication and scope mechanisms in
process calculi.
In Frank S. de Boer and Marcello M. Bonsangue, editors,
Postproceedings of the 5th International Symposium on Formal Methods for
Components and Objects (FMCO'06), volume 4709 of Lecture Notes in
Computer Science, pages 185-206. Springer, 2007.
http://www.lix.polytechnique.fr/~fvalenci/papers/fmco07.pdf. [ bib ] |
| [3] |
Diletta Cacciagrano, Flavio Corradini, and Catuscia Palamidessi.
Fair π.
In Proceedings of the 13th International Workshop on
Expressiveness in Concurrency (EXPRESS'06), volume 175 (3) of
Electronic Notes in Theoretical Computer Science, pages 3-26. Elsevier
Science B.V., 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Diletta/FairPi/express06.pdf. [ bib ] |
| [4] |
Diletta Cacciagrano, Flavio Corradini, and Catuscia Palamidessi.
Separation of synchronous and asynchronous communication via testing.
Theoretical Computer Science, 386(3):218-235, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Diletta/Must/report.pdf. [ bib | http ] |
| [5] |
Konstantinos Chatzikokolakis.
Probabilistic and Information-Theoretic Approaches to
Anonymity.
PhD thesis, LIX, École Polytechnique, October 2007.
www.lix.polytechnique.fr/~kostas/thesis.pdf. [ bib ] |
| [6] |
Konstantinos Chatzikokolakis and Catuscia Palamidessi.
A framework for analyzing probabilistic protocols and its application
to the partial secrets exchange.
Theoretical Computer Science, 389(3):512-527, 2007.
A short version of this paper appeared in the Proceedings of the
Symposium on Trustworthy Global Computing (TGC), volume 3705 of LNCS, pages
146-162. Springer.
http://www.lix.polytechnique.fr/~catuscia/papers/PartialSecrets/TCSreport.pdf. [ bib ] |
| [7] |
Konstantinos Chatzikokolakis and Catuscia Palamidessi.
Making random choices invisible to the scheduler.
In Luís Caires and Vasco Thudichum Vasconcelos, editors,
Proceedings of CONCUR'07, volume 4703 of Lecture Notes in Computer
Science, pages 42-58. Springer, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Scheduler/report.pdf. [ bib ] |
| [8] |
Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden.
Probability of error in information-hiding protocols.
In Proceedings of the 20th IEEE Computer Security Foundations
Symposium (CSF20), pages 341-354. IEEE Computer Society, 2007. [ bib ] |
| [9] |
Alberto Credi, Marco Garavelli, Cosimo Laneve, Sylvain Pradalier, Serena Silvi,
and Gianluigi Zavattaro.
Modelization and simulation of nano devices in nanoκ
calculus.
In Muffy Calder and Stephen Gilmore, editors, Proceedings of the
International Conference on Computational Methods in Systems Biology,
(CMSB), volume 4695 of Lecture Notes in Computer Science, pages
168-183. Springer, 2007. [ bib ] |
| [10] |
Yuxin Deng and Catuscia Palamidessi.
Axiomatizations for probabilistic finite-state behaviors.
Theoretical Computer Science, 373(1-2):92-114, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Prob_Axiom/tcs.pdf. [ bib | http ] |
| [11] |
Yuxin Deng, Catuscia Palamidessi, and Jun Pang.
Weak probabilistic anonymity.
In Michael Backes and Andre Scedrov, editors, Proceedings of the
3rd International Workshop on Security Issues in Concurrency (SecCo), volume
180 (1) of Electronic Notes in Theoretical Computer Science, pages
55-76. Elsevier Science B.V., 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/report_wa.pdf. [ bib ] |
| [12] |
Moreno Falaschi, Carlos Olarte, Catuscia Palamidessi, and Frank D. Valencia.
Declarative diagnosis of temporal concurrent constraint programs.
In Verónica Dahl and Ilkka Niemelä, editors, Proceedings
of The 23rd International Conference in Logic Programming (ICLP'07), volume
4670 of Lecture Notes in Computer Science, pages 271-285. Springer,
2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Carlos/iclp07.pdf. [ bib ] |
| [13] |
Jean Goubault-Larrecq, Catuscia Palamidessi, and Angelo Troina.
A probabilistic applied pi-calculus.
In Proceedings of the 5th Asian Symposium on Programming
Languages and Systems (APLAS'07), volume 4807 of Lecture Notes in
Computer Science, pages 175-190. Springer, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Angelo/aplas.pdf. [ bib ] |
| [14] |
Julian Gutierrez, Jorge Perez, Camilo Rueda, and Frank D. Valencia.
Timed concurrent constraint programming for analyzing biological
systems.
In Proceedings of Workshop on Membrane Computing and
Biologically Inspired Process Calculi., volume 171 (2) of Electronic
Notes in Theoretical Computer Science, pages 117-137. Elsevier Science
B.V., 2007.
http://www.brics.dk/~fvalenci/papers/bioccp.pdf. [ bib ] |
| [15] |
Ruggero Lanotte, Andrea Maggiolo-Schettini, and Angelo Troina.
Parametric probabilistic transition systems for system design and
analysis.
Formal Aspects of Computing, 19(1):93-109, 2007. [ bib ] |
| [16] |
Gethin Norman, Catuscia Palamidessi, David Parker, and Peng Wu.
Model checking the probabilistic pi-calculus.
In 4th International Conference on the Quantitative Evaluation
of SysTems (QEST), pages 169-178. IEEE Computer Society, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Wu/qest1.pdf.
Full version in
http://www.lix.polytechnique.fr/~catuscia/papers/2009/TSE.pdf. [ bib ] |
| [17] |
Carlos Olarte, Catuscia Palamidessi, and Frank D. Valencia.
Universal timed concurrent constraint programming.
In Verónica Dahl and Ilkka Niemelä, editors, Proceedings
of the 23rd International Conference in Logic Programming (ICLP'07), volume
4670 of Lecture Notes in Computer Science, pages 464-465. Springer,
2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Carlos/iclp07DC.pdf. [ bib ] |
| [18] |
Maria Grazia Vigliotti, Iain Phillips, and Catuscia Palamidessi.
Tutorial on separation results in process calculi via leader election
problems.
Theoretical Computer Science, 388(1-3):267-289, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/2007/MariaGrazia/tcs.pdf. [ bib | http ] |
| [19] |
Peng Wu, Catuscia Palamidessi, and Huimin Lin.
Symbolic bisimulation for probabilistic systems.
In Proceedings of 4th International Conference on the
Quantitative Evaluation of SysTems (QEST), pages 179-188. IEEE Computer
Society, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Wu/qest2.pdf. [ bib ] |
This file has been generated by bibtex2html 1.74
Back
Page maintainer: Catuscia Palamidessi