Bibliography

Major publications by the team in recent years

1K. Chatzikokolakis, C. Palamidessi.

Making Random Choices Invisible to the Scheduler, in: Information and Computation, 2010, vol. 208, n^o 6, p. 694-715. [ DOI : 10.1016/j.ic.2009.06.006 ]

http://hal.inria.fr/inria-00424860/en
2K. Chatzikokolakis, C. Palamidessi, P. Panangaden.

Anonymity Protocols as Noisy Channels, in: Information and Computation, 2008, vol. 206, n^o 2–4, p. 378–401. [ DOI : 10.1016/j.ic.2007.07.003 ]

http://hal.inria.fr/inria-00349225/en/
3K. Chatzikokolakis, C. Palamidessi, P. Panangaden.

On the Bayes risk in information-hiding protocols, in: Journal of Computer Security, 2008, vol. 16, n^o 5, p. 531–571. [ DOI : 10.3233/JCS-2008-0333 ]

http://hal.inria.fr/inria-00349224/en/
4Y. Deng, C. Palamidessi.

Axiomatizations for probabilistic finite-state behaviors, in: Theoretical Computer Science, 2007, vol. 373, n^o 1-2, p. 92–114.

http://hal.inria.fr/inria-00200928/en/
5P. Giambiagi, G. Schneider, F. D. Valencia.

On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi., in: Proceedings of FoSSaCS, Lecture Notes in Computer Science, Springer, 2004, vol. 2987, p. 226-240.
6S. Hamadou, C. Palamidessi, V. Sassone.

Reconciling Belief and Vulnerability in Information Flow, in: 31st IEEE Symposium on Security and Privacy, Berleley/Oakland, California, USA, IEEE Computer Society, 2010, p. 79-92. [ DOI : 10.1109/SP.2010.13 ]

http://hal.inria.fr/inria-00548007/en
7C. Palamidessi, O. M. Herescu.

A randomized encoding of the $π$ -calculus with mixed choice, in: Theoretical Computer Science, 2005, vol. 335, n^o 2-3, p. 73-404.

http://hal.inria.fr/inria-00201105/en/
8C. Palamidessi.

Comparing the Expressive Power of the Synchronous and the Asynchronous pi-calculus, in: Mathematical Structures in Computer Science, 2003, vol. 13, n^o 5, p. 685–719.

http://hal.inria.fr/inria-00201104/en/
9C. Palamidessi, V. A. Saraswat, F. D. Valencia, B. 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), IEEE Computer Society, 2006, p. 59–68.

http://hal.inria.fr/inria-00201096/en/
10F. D. Valencia.

Decidability of infinite-state timed CCP processes and first-order LTL, in: Theoretical Computer Science, 2005, vol. 330, n^o 3, p. 577–607.

Publications of the year

Doctoral Dissertations and Habilitation Theses

11M. Alvim.

Des approches formelles pour le cachement d'information: Une analyse des systèmes interactifs, contrôle de divulgation statistique, et le raffinement des spécifications, Ecole Polytechnique X, October 2011.

http://hal.inria.fr/tel-00639948/en
12M. Andres.

Quantitative Analysis of Information Leakage in Probabilistic and Nondeterministic Systems, Radboud University, Nijmegen, July 2011.

http://hal.inria.fr/tel-00655506/en

Articles in International Peer-Reviewed Journal

13M. Alvim, M. Andres, C. Palamidessi.

Information Flow in Interactive Systems, in: Journal of Computer Security, 2011, To appear.

http://hal.inria.fr/inria-00637356/en
14M. Andres, C. Palamidessi, A. Sokolova, P. Van Rossum.

Information Hiding in Probabilistic Concurrent Systems, in: Journal of Theoretical Computer Science, 2011, vol. 412, n^o 28, p. 3072-3089.

http://hal.inria.fr/hal-00573447/en
15K. Chatzikokolakis, S. Knight, C. Palamidessi, P. Panangaden.

Epistemic Strategies and Games on Concurrent Processes, in: Transactions on Computational Logic, 2011.

http://hal.inria.fr/inria-00637160/en

Invited Conferences

16M. Alvim, M. Andres, K. Chatzikokolakis, C. Palamidessi.

On the relation between Differential Privacy and Quantitative Information Flow, in: 38th International Colloquium on Automata, Languages and Programming - ICALP 2011, Zurich, Switzerland, L. Aceto, M. Henzinger, J. Sgall (editors), Lecture Notes in Computer Science, Springer, 2011, vol. 6756, p. 60-76. [ DOI : 10.1007/978-3-642-22012-8_4 ]

http://hal.inria.fr/inria-00627937/en

International Conferences with Proceedings

17M. Alvim, M. Andres, K. Chatzikokolakis, P. Degano, C. Palamidessi.

Differential Privacy: on the trade-off between Utility and Information Leakage, in: The 8th International Workshop on Formal Aspects of Security & Trust (FAST), Leuven, Belgium, G. Barthe, A. Datta, S. Etalle (editors), Lecture Notes in Computer Science, Springer, March 2011.

http://hal.inria.fr/inria-00580122/en
18A. Aristizabal, F. Bonchi, C. Palamidessi, L. Pino, F. D. Valencia.

Deriving Labels and Bisimilarity for Concurrent Constraint Programming, in: Proceedings of the 14th International Conference on Foundations of Software Science an Computation Structures (FOSSACS 2011). , Saarbrücken, Germany, M. Hofmann (editor), Lecture Notes in Computer Science, Springer, 2011, vol. 6604, p. 138-152. [ DOI : 10.1007/ISBN 978-3-642-19804-5 ]

http://hal.inria.fr/hal-00546722/en
19A. Aristizabal, F. Bonchi, L. Pino, F. D. Valencia.

Partition Refinement for Bisimilarity in CCP, in: Proceedings of the 27th ACM Symposium On Applied Computing, Riva del Garda (Trento), Italy, ACM, March 26-30 2011, To appear.

http://hal.inria.fr/hal-00641408/en
20D. Baelde, R. Beauxis, S. Mimram.

Liquidsoap: a High-Level Programming Language for Multimedia Streaming, in: SOFSEM 2011: Theory and Practice of Computer Science, Nový Smokovec, Slovakia, I. Cerná, T. Gyimóthy, J. Hromkovic, K. Jefferey, R. Královic, M. Vukolic, S. Wolf (editors), Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 2011, vol. 6543, p. 99-110. [ DOI : 10.1007/978-3-642-18381-2_8 ]

http://hal.inria.fr/inria-00585728/en
21R. Beauxis, S. Mimram.

A Non-Standard Semantics for Kahn Networks in Continuous Time, in: Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL, Bergen, Norway, M. Bezem (editor), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2011, vol. 12, p. 35–50. [ DOI : 10.4230/LIPIcs.CSL.2011.35 ]

http://hal.inria.fr/inria-00616968/en
22M. Giunti.

A type checking algorithm for qualified session types, in: 7th International Workshop on Automated Specification and Verification of Web Systems, Reykjavik, Iceland, L. Kovács, R. Pugliese, F. Tiezzi (editors), Electronic Proceedings in Theoretical Computer Science, August 2011. [ DOI : 10.4204/EPTCS.61.7 ]

http://hal.inria.fr/hal-00644061/en
23D. Hermith, C. Olarte, C. Rueda, F. D. Valencia.

Modeling Cellular Signaling Systems: An Abstraction-Refinement Approach, in: PACBB, Salamanca, Spain, M. P. Rocha, J. M. C. Rodriguez, F. Fdez-Riverola, A. Valencia (editors), Advances in Intelligent and Soft Computing, Springer, 2011, vol. 93, p. 321-328. [ DOI : 10.1007/ISBN 978-3-642-19913-4 ]

http://hal.inria.fr/hal-00641433/en

Scientific Books (or Scientific Book chapters)

24M. Alvim, M. Andres, K. Chatzikokolakis, C. Palamidessi.

Quantitative Information Flow and Applications to Differential Privacy, in: Foundations of Security Analysis and Design VI – FOSAD Tutorial Lectures, A. Aldini, R. Gorrieri (editors), Lecture Notes in Computer Science, Springer, 2011, vol. 6858, p. 211–230. [ DOI : 10.1007/978-3-642-23082-0_8 ]

http://hal.inria.fr/hal-00655522/en
25G. Longo, C. Palamidessi, P. Thierry.

Some Bridging Results and Challenges in Classical, Quantum and Computational Randomness, in: Randomness Through Computation, H. Zenil (editor), World Scientific, 2011, ISBN: 978-981-4327-74-9.

http://hal.inria.fr/hal-00445553/en

Books or Proceedings Editing

26K. Chatzikokolakis, V. Cortier (editors)

Proceedings of the 8th International Workshop on Security Issues in Concurrency, Electronic Proceedings in Theoretical Computer Science, Electronic Proceedings in Theoretical Computer Science, 2011, vol. 51, 51 p. [ DOI : 10.4204/EPTCS.51 ]

http://hal.inria.fr/hal-00641020/en
27B. Luttik, F. D. Valencia (editors)

Proceedings of the Eighth International Conference on Quantitative Evaluation of SysTems, Electronic Proceedings in Theoretical Computer Science, Electronic Proceedings in Theoretical Computer Science, 2011, vol. 64, 131 p. [ DOI : 10.4204/EPTCS.64 ]
28S. Mödersheim, C. Palamidessi (editors)

Post-proceedings of TOSCA – Theory of Security and Applications, Lecture Notes in Computer Science, Springer, 2011, vol. 6993, 235 p.

http://hal.inria.fr/hal-00655523/en
29C. Palamidessi, A. Riska (editors)

Proceedings of the Eighth International Conference on Quantitative Evaluation of SysTems, IEEE, 2011, 276 p.

http://hal.inria.fr/hal-00655524/en

Internal Reports

30F. Cassez, J. Dubreil, H. Marchand.

Synthesis of Opaque Systems with Static and Dynamic Masks., INRIA, 2011, Submitted to Formal Methods in System Design (FORM).

References in notes

31R. Canetti, L. Cheung, N. Lynch, O. Pereira.

On the Role of Scheduling in Simulation-Based Security, 2007, Cryptology ePrint Archive, Report 2007/102.
32K. Chatzikokolakis, C. Palamidessi.

Making Random Choices Invisible to the Scheduler, in: Information and Computation, 2010, vol. 208, n^o 6, p. 694-715. [ DOI : 10.1016/j.ic.2009.06.006 ]

http://hal.inria.fr/inria-00424860/en
33K. Chatzikokolakis, C. Palamidessi, P. Panangaden.

Anonymity Protocols as Noisy Channels, in: Inf. and Comp., 2008, vol. 206, n^o 2–4, p. 378–401. [ DOI : 10.1016/j.ic.2007.07.003 ]

http://hal.inria.fr/inria-00349225/en/
34K. Chatzikokolakis, C. Palamidessi, P. Panangaden.

On the Bayes risk in information-hiding protocols, in: Journal of Computer Security, 2008, vol. 16, n^o 5, p. 531–571. [ DOI : 10.3233/JCS-2008-0333 ]

http://hal.inria.fr/inria-00349224/en/
35T. Hoare, R. Milner.

Grand Challenges for Computing Research, in: Computer Journal, 2005, vol. 48, n^o 1, p. 49-52.
36N. P. Mendler, P. Panangaden, P. J. Scott, R. A. G. Seely.

A Logical View of Concurrent Constraint Programming, in: Nord. J. Comput., 1995, vol. 2, n^o 2, p. 181-220.
37R. Milner, J. Parrow, D. Walker.

A Calculus of Mobile Processes, I and II, in: Information and Computation, 1992, vol. 100, n^o 1, p. 1–40 & 41–77, A preliminary version appeared as Technical Reports ECF-LFCS-89-85 and -86, University of Edinburgh, 1989..
38G. Norman, C. Palamidessi, D. Parker, P. Wu.

Model checking probabilistic and stochastic extensions of the $π$ -calculus, in: IEEE Transactions of Software Engineering, 2009, vol. 35, n^o 2, p. 209–223.

http://hal.archives-ouvertes.fr/inria-00424856/en/
39V. A. Saraswat, M. Rinard, P. Panangaden.

Semantic foundations of concurrent constraint programming, in: Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, ACM Press, 1991, p. 333–352.
40V. A. Saraswat, M. C. Rinard.

Concurrent Constraint Programming, in: POPL, ACM Press, 1990, p. 232-245.
41P. Wu, C. Palamidessi, H. Lin.

Symbolic Bisimulation for Probabilistic Systems, in: Proceedings of 4th International Conference on the Quantitative Evaluation of SysTems (QEST), IEEE Computer Society, 2007, p. 179-188.

http://www.lix.polytechnique.fr/~catuscia/papers/Wu/qest2.pdf

Previous |

Home