List of Publications
Most of the papers available from this document appear in print, and the corresponding copyright is held by the publisher.
While the papers can be used for personal use, redistribution or reprinting for commercial purposes is prohibited.
Journals
- R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch, O. Pereira and R. Segala.
Analyzing Security Protocols Using Time-Bounded Task-PIOAs.
Discrete Event Dynamic Systems, 2008.
SpringerLink.
- K. Chatzikokolakis and C. Palamidessi.
Probable innocence revisited.
Theoretical Computer Science 367(1-2): 123-138, 2006.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/reportPI.pdf.
-
K. Chatzikokolakis and C. Palamidessi.
A Framework to Analyze Probabilistic Protocols and its Application to the Partial Secrets Exchange.
Theoretical Computer Science, to appear.
http://www.lix.polytechnique.fr/~catuscia/papers/PartialSecrets/TCSreport.pdf.
- L. Cheung, N. Lynch, R. Segala and F. Vaandrager.
Switched PIOA: Parallel Composition via Distributed Scheduling.
Theoretical Computer Science 365:83-108, 2007.
- Y. Deng and C. Palamidessi.
Axiomatizations for probabilistic finite-state behaviors.
Theoretical Computer Science 373:92-114, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Prob_Axiom/tcs.pdf.
- R. Lanotte, A. Maggiolo-Schettini and A. Troina.
Parametric Probabilistic Transition Systems for System Design and Analysis.
Formal Aspects of Computing 19:93-109, 2007.
http://www.lix.polytechnique.fr/~troina/publications/fac07.pdf.
- N. Lynch, R. Segala and F. Vaandrager.
Observing Branching Structure through Probabilistic Contexts.
SIAM Journal on Computing, to appear.
-
I. Phillips, M. G. Vigliotti and C. Palamidessi.
Expressiveness via leader election problems.
Theoretical Computer Science. To appear.
http://www.lix.polytechnique.fr/~catuscia/papers/2007/MariaGrazia/tcs.pdf.
Conference proceedings
- R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch, O. Pereira and R. Segala.
Task-Structured Probabilistic I/O Automata.
In Proceedings the 8th International Workshop on Discrete Event Systems (WODES'06), 2006.
- R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch,O. Pereira and R. Segala.
Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols.
In Proceedings of the 20th International Symposium on Distributed Computing (DISC '06),
Springer LNCS 4167, 238-253, 2006.
- R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch, O. Pereira and R. Segala.
Using Task-Structured Probabilistic I/O Automata to Analyze Cryptographic Protocols.
In Proceedings of the Workshop on Formal and Computational Cryptography (FCC '06), 34-39, 2006.
-
K. Chatzikokolakis and C. Palamidessi.
Making Random Choices Invisible to the Scheduler.
In Proceedings of CONCUR'07, Springer LNCS, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Scheduler/report.pdf.
-
K. Chatzikokolakis, C. Palamidessi and P. Panangaden.
Anonymity Protocols as Noisy Channels.
In Proceedings of the 2nd Symposium on Trustworthy Global Computing (TGC'06), Springer LNCS, 2006.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/Channels/full.pdf.
-
K. Chatzikokolakis, C. Palamidessi and P. Panangaden.
Probability of Error in Information-Hiding Protocols.
In Proceedings of the 20th IEEE Computer Security Foundations Symposium, IEEE Computer Society Press, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/ProbabilityError/full.pdf.
- J. Goubault-Larrecq.
Continuous Previsions.
In Proceedings of CSL'07, Springer LNCS, 2007.
http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-07.pdf.
- J. Goubault-Larrecq.
Continuous Capacities on Continuous State Spaces.
In Proceedings of ICALP'07, Springer LNCS, 2007.
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JGL-icalp07.pdf.
- J. Goubault-Larrecq.
On Noetherian Spaces.
In Proceedings of LICS'07, IEEE Computer Society Press, 2007.
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JGL-lics07.pdf.
- J. Goubault-Larrecq, C. Palamidessi, A. Troina
A Probabilistic Applied Pi-Calculus
In Proceedings of APLAS'07, Springer LNCS, 2007.
http://www.lix.polytechnique.fr/~troina/publications/aplas07.pdf.
- G. Norman, C. Palamidessi, D. Parker and P. Wu.
Model checking the probabilistic pi-calculus.
In Proceedings of QEST'07, Springer LNCS, 2007.
http://www.prismmodelchecker.org/bibitem.php?key=NPPW07.
-
C. Palamidessi, V. Saraswat, F. Valencia and Bjorn Victor.
On the expressiveness of linearity vs. persistence in the asychronous pi-calculus.
In Proceedings of LICS'06, IEEE Computer Society Press, 2006.
http://www.lix.polytechnique.fr/~catuscia/papers/Frank/LICS_06/main.pdf.
- A. Parma and R. Segala.
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems.
In Proceedings of FOSSACS'07, Springer LNCS, 2007.
-
S. Pradalier and C. Palamidessi.
Expressiveness of probabilistic π-calculi.
In Proceedings of QAPL'06.Elesevier ENTCS, to appear.
http://www.lix.polytechnique.fr/~catuscia/papers/Sylvain/QAPL06/FinalBis.pdf.
- R. Segala.
Probability and Nondeterminism in Operational Models of Concurrency.
In Proceedings of CONCUR'06, Springer LNCS 4137, 64-78, 2006.
- R. Segala and A. Turrini.
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata.
In Proceedings of the 20th IEEE Computrer Security Foundations Symposium,
IEEE Computer Society Press, 2007.
- P. Wu, C. Palamidessi and H. Lin.
Symbolic bisimulations for probabilistic systems.
In Proceedings of QEST'07, Springer LNCS, 2007.
http://www.lix.polytechnique.fr/~wu/papers/qest07-rr.pdf.
Technical Reports
-
J. Goubault-Larrecq.
Continuous capacities on continuous state spaces.
Research Report LSV-07-06, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2007.
37 pages.
-
J. Goubault-Larrecq.
Continuous previsions.
Research Report LSV-07-07, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2007.
29 pages.