 |
|
|
|
| Papers |
|
Papers published in 2012
| [1] |
Mario Alvim, S., Miguel Andres, E., and Catuscia Palamidessi.
Quantitative Information Flow in Interactive Systems.
Journal of Computer Security, 20(1):3-50, 2012. [ bib | http ] |
| [2] |
Mario Alvim, S., Konstantinos Chatzikokolakis, Catuscia Palamidessi, and
Geoffrey Smith.
Measuring Information Leakage using Generalized Gain Functions.
In Proceedings of Computer Security Foundations (CSF), pages
265-279, Cambridge MA, United States, 2012. IEEE. [ bib | http ] |
| [3] |
Miguel Andres, E., Nicolas E. Bordenabe, Konstantinos Chatzikokolakis, and
Catuscia Palamidessi.
Geo-Indistinguishability: Differential Privacy for Location-Based
Systems.
Technical report, 2012. [ bib | http ] |
| [4] |
Andrés Aristizabal.
Techniques de Bisimulation et Algorithmes pour la Programmation
Concurrente par Contraintes.
PhD thesis, Ecole Polytechnique X, October 2012. [ bib | http ] |
| [5] |
Andrés Aristizabal, Filippo Bonchi, Luis Pino, and Frank D. Valencia.
Partition Refinement for Bisimilarity in CCP.
In 27th ACM Symposium On Applied Computing, Trento, Italy,
2012. [ bib | http ] |
| [6] |
Andrés Aristizabal, Filippo Bonchi, Luis Pino, and Frank D. Valencia.
Partition Refinement for Bisimilarity in CCP.
In Proceedings of the 27th ACM Symposium On Applied Computing to
be held in Riva del Garda (Trento), Italy. March 26-30, 2012. ACM, 2012. [ bib | http ] |
| [7] |
Andrés Aristizabal, Filippo Bonchi, Luis Pino, and Frank D. Valencia.
Reducing Weak to Strong Bisimilarity in CCP.
In Fifth Interaction and Concurrency Experience, pages 2-16,
Stockholm, Sweden, December 2012.
EPTCS. [ bib | http ] |
| [8] |
Andrés Barco, Sophia Knight, and Frank 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. [ bib | http ] |
| [9] |
Mayla Brusó, Konstantinos Chatzikokolakis, Sandro Etalle, and Jerry
Den Hartog.
Linking Unlinkability.
In 7th International Symposium on Trustworthy Global Computing
(TGC), Newcastle upon Tyne, United Kingdom, 2012.
To appear. [ bib | http ] |
| [10] |
Michele Bugliesi, Lucia Gallina, Andrea Marin, Sabina Rossi, and Sardaouna
Hamadou.
Interference-Sensitive Preorders for MANETs.
In Ninth International Conference on Quantitative Evaluation of
Systems, QEST 2012, pages 189-198, London, United Kingdom, 2012. IEEE
Computer Society. [ bib | http ] |
| [11] |
Franck Cassez, Jeremy Dubreil, and Hervé Marchand.
Synthesis of opaque systems with static and dynamic masks.
Formal Methods in System Design, 40(1):88-115, 2012. [ bib | http ] |
| [12] |
Konstantinos Chatzikokolakis, Miguel Andres, E., Nicolas E. Bordenabe, and
Catuscia Palamidessi.
Enhancing Differential Privacy: from Hamming to General Metrics.
Technical report, 2012. [ bib | http ] |
| [13] |
Konstantinos Chatzikokolakis, Sophia Knight, Catuscia Palamidessi, and Prakash
Panangaden.
Epistemic Strategies and Games on Concurrent Processes.
Transactions on Computational Logic, 13(4):28:1-28:35,
October 2012. [ bib | http ] |
| [14] |
Ivan Gazeau, Dale Miller, and Catuscia Palamidessi.
A non-local method for robustness analysis of floating point
programs.
In Mieke Massink and Herbert Wiklicky, editors, QAPL - Tenth
Workshop on Quantitative Aspects of Programming Languages, Tallinn,
Estonia, March 2012. [ bib | http ] |
| [15] |
Marco Giunti, Catuscia Palamidessi, and Frank 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), pages 65-80, New Castle upon Tyne, United Kingdom, August 2012. [ bib | http ] |
| [16] |
Sophia Knight, Radu Mardare, and Prakash 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, pages 219-243, Ithaca, United
States, April 2012. [ bib | http ] |
| [17] |
Sophia Knight, Catuscia Palamidessi, Prakash Panangaden, and Frank D. Valencia.
Spatial and Epistemic Modalities in Constraint-Based Process
Calculi.
In Proceedings of CONCUR 2012 - Concurrency Theory - 23rd
International Conference, CONCUR 2012, volume 7454, pages 317-332,
Newcastle upon Tyne, United Kingdom, September 2012. [ bib | http ] |
| [18] |
Matteo Mio.
On the equivalence of game and denotational semantics for the
probabilistic μ-calculus.
Logical Methods in Computer Science, 8(2), June 2012. [ bib | http ] |
| [19] |
Matteo Mio.
Probabilistic modal μ-calculus with independent product.
Logical Methods in Computer Science, 8(4), November 2012. [ bib | http ] |
| [20] |
Catuscia Palamidessi and Marco Stronati.
Differential privacy for relational algebra: improving the
sensitivity bounds via constraint systems.
In Herbert Wiklicky and Mieke Massink, editors, QAPL - Tenth
Workshop on Quantitative Aspects of Programming Languages, volume 85, pages
92-105, Tallin, Estonia, 2012. Open Publishing Association. [ bib | http ] |
| [21] |
Mu Yang, Vladimiro Sassone, and Sardaouna Hamadou.
A Game-Theoretic Analysis of Cooperation in Anonymity Networks.
In Pierpaolo Degano and Joshua D. Guttman, editors, Principles
of Security and Trust - First International Conference, POST 2012, volume
7215, pages 269-289, Tallinn, Estonia, 2012. Springer. [ bib | http ] |
This file has been generated by bibtex2html 1.74
Back
Page maintainer: Catuscia Palamidessi