EN FR
EN FR


previous Previous | up Home


Bibliography

Major publications by the team in recent years
  • 1M. Alvim, K. Chatzikokolakis, C. Palamidessi, G. Smith.

    Measuring Information Leakage using Generalized Gain Functions, in: Computer Security Foundations, Cambridge MA, United States, IEEE, 2012, p. 265-279. [ DOI : 10.1109/CSF.2012.26 ]

    http://hal.inria.fr/hal-00734044
  • 2K. Chatzikokolakis, C. Palamidessi.

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

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

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

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

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

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

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

    http://hal.inria.fr/inria-00200928/en/
  • 6P. 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.

    http://www.lix.polytechnique.fr/~fvalenci/papers/fossacs04.pdf
  • 7S. 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
  • 8S. Knight, C. Palamidessi, P. Panangaden, F. D. Valencia.

    Spatial and Epistemic Modalities in Constraint-Based Process Calculi, in: CONCUR 2012 - Concurrency Theory - 23rd International Conference, CONCUR 2012, Newcastle upon Tyne, United Kingdom, September 2012, vol. 7454, p. 317-332. [ DOI : 10.1007/978-3-642-32940-1 ]

    http://hal.inria.fr/hal-00761116
  • 9C. Palamidessi.

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

    http://hal.inria.fr/inria-00201104/en/
  • 10C. 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/
Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 11A. Aristizábal.

    Techniques de Bisimulation et Algorithmes pour la Programmation Concurrente par Contraintes, Ecole Polytechnique X, October 2012.

    http://hal.inria.fr/pastel-00756952

Articles in International Peer-Reviewed Journals

  • 12M. Alvim, M. Andrés, C. Palamidessi.

    Quantitative Information Flow in Interactive Systems, in: Journal of Computer Security, 2012, vol. 20, no 1, p. 3-50.

    http://hal.inria.fr/inria-00637356
  • 13F. Cassez, J. Dubreil, H. Marchand.

    Synthesis of opaque systems with static and dynamic masks, in: Formal Methods in System Design, 2012, vol. 40, no 1, p. 88-115. [ DOI : 10.1007/s10703-012-0141-9 ]

    http://hal.inria.fr/hal-00662539
  • 14K. Chatzikokolakis, S. Knight, C. Palamidessi, P. Panangaden.

    Epistemic Strategies and Games on Concurrent Processes, in: Transactions on Computational Logic, October 2012, vol. 13, no 4, p. 28:1-28:35. [ DOI : 10.1145/2362355.2362356 ]

    http://hal.inria.fr/inria-00637160
  • 15K. Chatzikokolakis, C. Palamidessi, C. Braun.

    Compositional Methods for Information-Hiding, in: Mathematical Structures in Computer Science, 2013, to appear.

    http://hal.inria.fr/hal-00760596
  • 16S. Hamadou, V. Sassone, M. Yang.

    An analysis of trust in anonymity networks in the presence of adaptive attackers, in: Mathematical Structures in Computer Science, 2013, page : to appear.

    http://hal.inria.fr/hal-00760437
  • 17M. Mio.

    On the equivalence of game and denotational semantics for the probabilistic μ-calculus, in: Logical Methods in Computer Science, June 2012, vol. 8, no 2.

    http://hal.inria.fr/hal-00763454
  • 18M. Mio.

    Probabilistic modal μ-calculus with independent product, in: Logical Methods in Computer Science, November 2012, vol. 8, no 4.

    http://hal.inria.fr/hal-00763451

International Conferences with Proceedings

  • 19M. Alvim, K. Chatzikokolakis, C. Palamidessi, G. Smith.

    Measuring Information Leakage using Generalized Gain Functions, in: Computer Security Foundations, Cambridge MA, United States, IEEE, 2012, p. 265-279. [ DOI : 10.1109/CSF.2012.26 ]

    http://hal.inria.fr/hal-00734044
  • 20A. Aristizábal, F. Bonchi, L. Pino, F. D. Valencia.

    Partition Refinement for Bisimilarity in CCP, in: 27th ACM Symposium On Applied Computing, Trento, Italy, 2012, 6 p.

    http://hal.inria.fr/hal-00641408
  • 21A. Aristizábal, F. Bonchi, L. Pino, F. D. Valencia.

    Reducing Weak to Strong Bisimilarity in CCP, in: Fifth Interaction and Concurrency Experience, Stockholm, Sweden, December 2012, p. 2-16, To appear in EPTCS. [ DOI : 10.4204/EPTCS.104 ]

    http://hal.inria.fr/hal-00761611
  • 22M. Brusó, K. Chatzikokolakis, S. Etalle, J. Den Hartog.

    Linking Unlinkability, in: 7th International Symposium on Trustworthy Global Computing (TGC), Newcastle upon Tyne, United Kingdom, 2012, To appear.

    http://hal.inria.fr/hal-00760150
  • 23M. Bugliesi, L. Gallina, A. Marin, S. Rossi, S. Hamadou.

    Interference-Sensitive Preorders for MANETs, in: Ninth International Conference on Quantitative Evaluation of Systems, QEST 2012, London, United Kingdom, IEEE Computer Society, 2012, p. 189-198.

    http://hal.inria.fr/hal-00760455
  • 24I. Gazeau, D. Miller, C. Palamidessi.

    A non-local method for robustness analysis of floating point programs, in: QAPL - Tenth Workshop on Quantitative Aspects of Programming Languages, Tallinn, Estonia, M. Massink, H. Wiklicky (editors), March 2012. [ DOI : 10.4204/EPTCS.85.5 ]

    http://hal.inria.fr/hal-00665995
  • 25M. Giunti, C. Palamidessi, F. D. Valencia.

    Hide and New in the Pi-Calculus, in: Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics (EXPRESS/SOS 2012), New Castle upon Tyne, United Kingdom, August 2012, p. 65-80. [ DOI : 10.4204/EPTCS.89 ]

    http://hal.inria.fr/hal-00761118
  • 26S. Knight, C. Palamidessi, P. Panangaden, F. D. Valencia.

    Spatial and Epistemic Modalities in Constraint-Based Process Calculi, in: CONCUR 2012 - Concurrency Theory - 23rd International Conference, CONCUR 2012, Newcastle upon Tyne, United Kingdom, September 2012, vol. 7454, p. 317-332. [ DOI : 10.1007/978-3-642-32940-1 ]

    http://hal.inria.fr/hal-00761116
  • 27M. Mio, A. Simpson.

    A Proof System for Compositional Verification of Probabilistic Concurrent Processes, in: FoSSaCS, Rome, Italy, F. Pfenning (editor), March 2013, 15 p.

    http://hal.inria.fr/hal-00766384
  • 28C. Palamidessi, M. Stronati.

    Differential privacy for relational algebra: improving the sensitivity bounds via constraint systems, in: QAPL - Tenth Workshop on Quantitative Aspects of Programming Languages, Tallin, Estonia, H. Wiklicky, M. Massink (editors), Open Publishing Association, 2012, vol. 85, p. 92-105. [ DOI : 10.4204/EPTCS.85.7 ]

    http://hal.inria.fr/hal-00760688
  • 29L. Xu.

    Modular Reasoning about Differential Privacy in a Probabilistic Process Calculus, in: 7th International Symposium on Trustworthy Global Computing (TGC), Newcastle upon Tyne, United Kingdom, 2013, page : to appear.

    http://hal.inria.fr/hal-00691284
  • 30M. Yang, V. Sassone, S. Hamadou.

    A Game-Theoretic Analysis of Cooperation in Anonymity Networks, in: Principles of Security and Trust - First International Conference, POST 2012, Tallinn, Estonia, P. Degano, J. D. Guttman (editors), Springer, 2012, vol. 7215, p. 269-289.

    http://hal.inria.fr/hal-00760445

Conferences without Proceedings

  • 31A. Barco, S. Knight, F. D. Valencia.

    K-Stores: A Spatial and Epistemic Concurrent Constraint Interpreter, in: 21st Workshop on Functional and (Constraint) Logic Programming (WFLP2012), Nagoya, Japan, May 2012.

    http://hal.inria.fr/hal-00761679

Scientific Books (or Scientific Book chapters)

  • 32S. Knight, R. Mardare, P. Panangaden.

    Combining Epistemic Logic and Hennessy-Milner Logic, in: Logic and Program Semantics - Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday, April 2012, p. 219-243. [ DOI : 10.1007/978-3-642-29485-3_14 ]

    http://hal.inria.fr/hal-00760967

Books or Proceedings Editing

  • 33S. Abramsky, M. W. Mislove, C. Palamidessi (editors)

    Special issue dedicated to a selection of papers from Mathematical Foundations of Programming Semantics (MFPS XXV). Theoretical Computer Science 430 (1-2), Elsevier B.V., 2012, 125 p.

    http://hal.inria.fr/hal-00778536
  • 34S. Mödersheim, C. Palamidessi (editors)

    Proceedings of the Joint Workshop on Theory of Security and Applications (TOSCA), Lecture Notes in Computer Science, Springer, 2012, vol. 6993, 224 p. [ DOI : 10.1007/978-3-642-27375-9 ]

    http://hal.inria.fr/hal-00778535
  • 35M. D. Ryan, C. Palamidessi (editors)

    Proceedings of the 7th International Symposium on Trustworthy Global Computing (TGC), Lecture Notes in Computer Science, Springer, 2013, To appear.

    http://hal.inria.fr/hal-00778538

Internal Reports

  • 36M. Andrés, N. E. Bordenabe, K. Chatzikokolakis, C. Palamidessi.

    Geo-Indistinguishability: Differential Privacy for Location-Based Systems, 2012.

    http://hal.inria.fr/hal-00766821
  • 37K. Chatzikokolakis, M. Andrés, N. E. Bordenabe, C. Palamidessi.

    Enhancing Differential Privacy: from Hamming to General Metrics, 2012.

    http://hal.inria.fr/hal-00767210

Other Publications

  • 38E. Elsalamouny, K. Chatzikokolakis, C. Palamidessi.

    A differentially private mechanism of optimal utility for a region of priors, This paper is to appear in the proceedings of POST 2013 (Principles of Security and Trust)..

    http://hal.inria.fr/hal-00760735
References in notes
  • 39K. Chatzikokolakis, C. Palamidessi, P. Panangaden.

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

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

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

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

    Grand Challenges for Computing Research, in: Computer Journal, 2005, vol. 48, no 1, p. 49-52.
  • 42G. 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, no 2, p. 209–223.

    http://hal.archives-ouvertes.fr/inria-00424856/en/
  • 43V. 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.
  • 44P. 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 Previous | up Home