Book chapters

Alvim, Mário; Andrés, Miguel; Chatzikokolakis, Kostas; Palamidessi, Catuscia, Quantitative Information Flow and Applications to Differential PrivacyFoundations of Security Analysis and Design VI -- FOSAD Tutorial Lectures, Alessandro Aldini and Roberto Gorrieri 6858 Lecture Notes in Computer Science Springer 211--230 (2011)

Knight, Sophia; Mardare, Radu; Panangaden, Prakash, Combining Epistemic Logic and Hennessy-Milner Logic, Logic and Program Semantics - Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday 219-243 (2012)


Journal papers

Chatzikokolakis, Konstantinos; Palamidessi, Catuscia; Braun, Christelle, Compositional Methods for Information-Hiding, Mathematical Structures in Computer Science, (2014)

Mio, Matteo, Probabilistic modal mu-calculus with independent product, Logical Methods in Computer Science, 8 4 (2012)

Chatzikokolakis, Kostas; Knight, Sophia; Palamidessi, Catuscia; Panangaden, Prakash. Epistemic Strategies and Games on Concurrent Processes, Transactions on Computational Logic, 13 4 28:1-28:35 (2012)

Mio, Matteo, On the equivalence of game and denotational semantics for the probabilistic μ -calculus, Logical Methods in Computer Science, 8 2 (2012)

Alvim, Mário, S.; Andrés, Miguel, E.; Palamidessi, Catuscia, Quantitative Information Flow in Interactive Systems, Journal of Computer Security, 20 1 3-50 (2012)

Andrés, Miguel, E.; Palamidessi, Catuscia; Sokolova, Ana; Van Rossum, Peter, Information Hiding in Probabilistic Concurrent Systems, Journal of Theoretical Computer Science, 412 28 3072-3089 (2011)

Mazza, Damiano, The True Concurrency of Differential Interaction Nets, Mathematical Structures in Computer Science, To appear


Refereed conference procedings

Dorman, Andrei; Mazza, Damiano, A Hirarchy of Expressiveness in Concurrent Interaction Nets, CONCUR (2013)

Mio, Matteo; Simpson, Alex, A Proof System for Compositional Verification of Probabilistic Concurrent Processes, FoSSaCS 15 (2013)

Mazza, Damiano, Non-Linearity as the Metric Completion of Linearity, TLCA (2013)

Andrés, Miguel, E.; Bordenabe, Nicolás, E.; Chatzikokolakis, Konstantinos; Palamidessi, Catuscia, Geo-Indistinguishability: Differential Privacy for Location-Based Systems, 20th ACM Conference on Computer and Communications Security 901-914 (2013)

Chatzikokolakis, Konstantinos; Andrés, Miguel, E.; Bordenabe, Nicolás, E.; Palamidessi, Catuscia, Broadening the Scope of Differential Privacy Using Metrics, The 13th Privacy Enhancing Technologies Symposium Lecture Notes in Computer Science 7981 82-102 (2013)

Elsalamouny, Ehab; Chatzikokolakis, Konstantinos; Palamidessi, Catuscia, A differentially private mechanism of optimal utility for a region of priors, POST-2nd Conference on Principles of Security and Trust. LNCS 7796, pages 41-62, Springer (2013)

Xu, Lili, Modular Reasoning about Differential Privacy in a Probabilistic Process Calculus, Proceedings of TGC, LNCS 8191, pages  198-212, Springer (2012)

Aristizábal, Andrés; Bonchi, Filippo; Pino, Luis; Valencia, Frank, D., Reducing Weak to Strong Bisimilarity in CCP, Fifth Interaction and Concurrency Experience 104 2-16 (2012)

Knight, Sophia; Palamidessi, Catuscia; Panangaden, Prakash; Valencia, Frank, D., Spatial and Epistemic Modalities in Constraint-Based Process Calculi, Proceedings of CONCUR 2012, LNCS 7454, pages 317-332, Springer (2012)

Giunti, Marco; Palamidessi, Catuscia; Valencia, Frank, D., Hide and New in the Pi-Calculus, Proceedings of EXPRESS/SOS 2012, EPTCS, Pages 65-80 (2012)

Aristizábal, Andrés; Bonchi, Filippo; Pino, Luis; Valencia, Frank, D., Partition Refinement for Bisimilarity in CCP, 27th ACM Symposium On Applied Computing 6 pages (2012)

Palamidessi, Catuscia; Stronati, Marco, Differential privacy for relational algebra: improving the sensitivity bounds via constraint systems, Proceeddings of QAPL, EPTCS 85, pages 92-105. (2012)

Mazza, Damiano, An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus, LICS (2012)

Mazza, Damiano; Ross, Neil J., Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators, FOSSACS (2012)

Alvim, Mário, S.; Andrés, Miguel, E.; Chatzikokolakis, Konstantinos; Degano, Pierpaolo; Palamidessi, Catuscia, Differential Privacy: on the trade-off between Utility and Information Leakage, Proceedings of FAST, Springer (2011)

Alvim, Mário, S.; Andrés, Miguel, E.; Chatzikokolakis, Konstantinos; Palamidessi, Catuscia, On the relation between Differential Privacy and Quantitative Information Flow, Proceedings of ICALP 2011, LNCS  6756, pages 60-76, Springer (2011)

Beauxis, Romain; Mimram, Samuel, A Non-Standard Semantics for Kahn Networks in Continuous Time, Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL 12 35--50 (2011)

Hamadou, Sardaouna; Palamidessi, Catuscia; Sassone, Vladimiro; Elsalamouny, Ehab,  Probable Innocence and Independent Knowledge, Postproceedings of FAST, LNCS 5983, pages 141-156, Springer (2009)

Fajstrup, Lisbeth; Goubault, Eric; Haucourt, Emmanuel; Mimram, Samuel; Raussen, Martin,  Trace Spaces: an Efficient New Technique for State-Space Reduction,  Proceedings of ESOP 2012, LNCS 7211, pages 274-294, Springer (2012)

Daniel Hirschkoff, Jean-Marie Madiot and Davide Sangiorgi. Duality and i/o-types in the pi-calculus, Proceedings of CONCUR 2012, LNCS 7454, pages 302--316, LNCS, Springer, 2012.

F. Jacquemard, E. Lozes, R. Treinen, and J. Villard. Multiple congruence relations, first-order theories on terms, and the frames of the applied pi-calculus. In Proceedings of TOSCA’11, volume 6993 of LNCS, pages 166–185, Springer, 2012.

J. Villard, E. Lozes, and C. Calcagno. Tracking heaps that hop with Heap-Hop. In Proceedings of TACAS’10, LNCS, pages 275–279,  Springer, 2010.

T. Balabonski and E. Haucourt. A Geometric Approach to the problem of Unique Decomposition of Processes. In Proceedings of CONCUR 2010, LNCS 6269, pages 132–146. Springer, 2010.

E. Goubault and S. Mimram. Formal Relationships Between Geometrical and Classical Models for Concurrency. ENTCS, (283):77–109, 2012.

S. Krishnan, E. Goubault, and E. Haucourt. Future Path-components in Directed Topology. In proceedings of MFPS, Ottawa Canada, 2010.

E. Beffara and V. Mogbil. Proofs as executions. In IFIP TCS, LNCS 7604, pages 280–294. Springer, 2012.

Tristan Fevat and Emmanuel Godard. Minimal obstructions for the coordinated attack problem and beyond.  In Proc. of IPDPS 2011, 2011.

R. Bonichon, G. Canet, R. Correnson, E. Goubault, E. Haucourt, M. Hirschowitz, S. Labbé, and S. Mimram. Rigorous Evidence of freedom from concurrency faults in industrial control software. In Proceedings of SafeComp, 2011.

A. Dorman, T. Heindel. SOS for Graph Rewriting. In Proceedings of ICE 2011, ENTCS, 2011.

E. Lozes. Towards Information as Resource in Separation Logic. In Proceedings of FCS-PrivMod 2010 (FloC 2010, Edimbourgh)