Bibliography

Major publications by the team in recent years

[1]

D. Cacciagrano, F. Corradini, C. Palamidessi.
Separation of synchronous and asynchronous communication via testing, in: Theoretical Computer Science, 2007, vol. 386, n^o 3, p. 218-235
http://hal.inria.fr/inria-00200916/en/.

[2]

K. Chatzikokolakis, C. Palamidessi.
Probable Innocence Revisited, in: Theoretical Computer Science, 2006, vol. 367, n^o 1-2, p. 123–138
http://hal.inria.fr/inria-00201072/en/.

[3]

K. Chatzikokolakis, C. Palamidessi, P. Panangaden.
Anonymity Protocols as Noisy Channels, in: Information and Computation, 2008, vol. 206, n^o 2–4, p. 378–401
http://hal.inria.fr/inria-00349225/en/.

[4]

K. 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
http://hal.inria.fr/inria-00349224/en/.

[5]

Y. 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/.

[6]

P. 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.brics.dk/~fvalenci/papers/fossacs04.pdf.

[7]

C. 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/.

[8]

C. 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/.

[9]

C. 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/.

[10]

F. 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
http://www.brics.dk/~fvalenci/papers/tcs.pdf.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[11]

J. Aranda.
On the Expressivity of Infinite and Local Behaviour in Fragments of the pi-calculus, LIX, Ecole Polytechnique, France, and EISC, Universidad del Valle, Colombia, 2009
http://tel.archives-ouvertes.fr/tel-00430495/en/, Ph. D. Thesis.

[12]

R. Beauxis.
Asynchronous Process Calculi for Specification and Verification of Information Hiding Protocols, LIX, Ecole Polytechnique, France, 2009, Ph. D. Thesis.

[13]

C. Olarte.
Universal Temporal Concurrent Constraint Programming, LIX, Ecole Polytechnique, Palaiseau, France, 2009
http://tel.archives-ouvertes.fr/tel-00430446/en/, Ph. D. Thesis.

[14]

S. Pradalier.
An approach to the modeling, simulation and analysis of nano-devices, LIX, Ecole Polytechnique, France, 2009, Ph. D. Thesis.

Articles in International Peer-Reviewed Journal

[15]

R. Beauxis, C. Palamidessi.
Probabilistic and nondeterministic aspects of anonymity, in: Theoretical Computer Science, 2009, vol. 410, n^o 41, p. 4006–4025
http://hal.archives-ouvertes.fr/inria-00424855/en/.

[16]

D. Cacciagrano, F. Corradini, C. Palamidessi.
Explicit Fairness in Testing Semantics, in: Logical Methods in Computer Science, 2009, vol. 5, n^o 2 - 15
http://hal.archives-ouvertes.fr/hal-00444580/en/.

[17]

K. Chatzikokolakis, C. Palamidessi.
Making Random Choices Invisible to the Scheduler, in: Information and Computation, 2010
http://hal.archives-ouvertes.fr/inria-00424860/en/.

[18]

S. Kramer, J. C. Bradfield.
A General Definition of Malware, in: Journal in Computer Virology, 2009
http://dx.doi.org/10.1007/s11416-009-0137-1, To appear.

[19]

S. Kramer, C. Palamidessi, R. Segala, A. Turrini, C. Braun.
A Quantitative Doxastic Logic for Probabilistic Processes and Applications to Information-Hiding, in: The Journal of Applied Non-Classical Logics, 2010
http://hal.archives-ouvertes.fr/inria-00445212/en/.

[20]

G. 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/.

International Peer-Reviewed Conference/Proceedings

[21]

M. E. Andrés, C. Palamidessi, P. van Rossum, G. Smith.
Computing the Leakage of Information-Hiding Systems, in: Proceedings of the Sixteenth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2010
http://hal.archives-ouvertes.fr/hal-00445445/en/.

[22]

J. Aranda, G. Assayag, C. Olarte, J. A. Pérez, C. Rueda, M. Toro, F. D. Valencia.
An Overview of FORCES: An INRIA Project on Declarative Formalisms for Emergent Systems, in: Proceeding of the 25th International Conference, ICLP'09, P. M. Hill, D. S. Warren (editors), Lectures Notes in Computer Science, Springer, 2009, vol. 5649, p. 509-513
http://hal.inria.fr/inria-00426610/en/.

[23]

J. Aranda, F. D. Valencia, C. Versari.
On the Expressive Power of Restriction and Priorities in CCS with replication, in: Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures, FOSSACS'09, L. de Alfaro (editor), Lectures Notes in Computer Science, Springer, 2009, vol. 5504, p. 242-256
http://hal.inria.fr/inria-00430531/en/.

[24]

A. Bhowmick, C. Palamidessi.
Bounds on the leakage of the input's distribution in information-hiding protocols, in: Proceedings of the Fourth Symposium on Trustworthy Global Computing (TGC 2008), C. Kaklamanis, F. Nielson (editors), Lecture Notes in Computer Science, Springer, 2009, vol. 5474, p. 36–51
http://hal.archives-ouvertes.fr/hal-00444579/en/.

[25]

C. Braun, K. Chatzikokolakis, C. Palamidessi.
Quantitative Notions of Leakage for One-try Attacks, in: Proceedings of the 25th Conf. on Mathematical Foundations of Programming Semantics, Electronic Notes in Theoretical Computer Science, Elsevier B.V., 2009, vol. 249, p. 75-91
http://hal.archives-ouvertes.fr/inria-00424852/en/.

[26]

M. Falaschi, C. Olarte, C. Palamidessi.
A framework for abstract interpretation of timed concurrent constraint programs, in: Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP'09, A. Porto, F. J. López-Fraguas (editors), ACM, 2009, p. 207-218
http://hal.inria.fr/inria-00426608/en/.

[27]

S. Hamadou, C. Palamidessi, V. Sassone, E. ElSalamouny.
Probable innocence in the presence of independent knowledge, in: Proceedings of the 6th International Workshop on Formal Aspects in Security and Trust, P. Degano, J. Guttman (editors), Lectures Notes in Computer Science, Springer, 2010
http://hal.archives-ouvertes.fr/inria-00424853/en/.

[28]

H. López, C. Olarte, J. A. Pérez.
Towards a Unified Framework for Declarative Structured Communications, in: Proceedings of the workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software (PLACES), Electronic Notes in Theoretical Computer Science, Elsevier, 2009
http://hal.inria.fr/inria-00426609/en/, To appear.

[29]

C. Olarte, C. Rueda.
A Declarative Language for Dynamic Multimedia Interaction Systems, in: Proceedings of the Second International Conference on Mathematics and Computation in Music (MCM), E. Chew, A. Childs, H.-H. Chuan (editors), Communications in Computer and Information Science, Springer, 2009, vol. 38, p. 218-227
http://hal.inria.fr/inria-00426607/.

National Peer-Reviewed Conference/Proceedings

[30]

C. Olarte, C. Rueda, F. D. Valencia.
Concurrent Constraint Programming: a Declarative Paradigm for Modeling Music Systems, in: New Computational Paradigms for Computer Music, Paris, France, G. Assayag, A. Gerzso (editors), Delatour France / Ircam-Centre Pompidou, 2009, p. 400–402
http://hal.inria.fr/inria-00429592/en/.

[31]

A. Villota, J. Aranda, D. Juan Francisco.
Modelando Sistemas de Membranas en ntcc, in: Proceedings of the XXXV Latin American Informatics Conference, CLEI'09, 2009
http://hal.inria.fr/inria-00430537/en/.

Books or Proceedings Editing

[32]

S. Abramsky, M. W. Mislove, C. Palamidessi (editors)
Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, Elsevier B.V., 2009, vol. 249, p. 1-490
http://dx.doi.org/10.1016/j.entcs.2009.07.080.

[33]

M. Carbone, P. Sobocinski, F. D. Valencia (editors)
Foreword: Festschrift for Mogens Nielsen's 60th birthday, Elsevier B.V., 2009, vol. 410, n^o 41
http://dx.doi.org/10.1016/j.tcs.2009.06.007.

[34]

M. Falaschi, M. Gabbrielli, C. Palamidessi (editors)
Abstract Interpretation and Logic Programming: Festschrift in honor of professor Giorgio Levi, Elsevier B.V., 2009, vol. 410, n^o 46
http://dx.doi.org/10.1016/j.tcs.2009.07.034.

[35]

M. Nielsen, A. Kucera, P. B. Miltersen, C. Palamidessi, P. Tuma, F. D. Valencia (editors)
SOFSEM 2009: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science, Lecture Notes in Computer Science, Springer, Spindleruv Mlýn, Czech Republic, 2009, vol. 5404, p. 1-670
http://www.springer.com/computer/foundations/book/978-3-540-95890-1.

Scientific Popularization

[36]

G. Longo, C. Palamidessi, T. Paul.
Randomnes: five questions and some challenges, in: Randomnes: 5 questions, H. Zenil (editor), Automatic Press / VIP, 2010
http://hal.archives-ouvertes.fr/hal-00445553/en/.

References in notes

[37]

R. Beauxis, C. Palamidessi, F. D. Valencia.
On the Asynchronous Nature of the Asynchronous pi-Calculus, in: Concurrency, Graphs and Models, P. Degano, R. De Nicola, J. Meseguer (editors), Lecture Notes in Computer Science, Springer, 2008, vol. 5065, p. 473-492
http://hal.inria.fr/inria-00349226/en/.

[38]

E. Brinksma, A. Rensink, W. Vogler.
Fair Testing, in: Proceedings of the 6th International Conference on Concurrency Theory (CONCUR), I. Lee, S. A. Smolka (editors), Lecture Notes in Computer Science, Springer-Verlag, 1995, vol. 962, p. 313–327.

[39]

N. Busi, M. Gabbrielli, G. Zavattaro.
Replication vs. recursive definition in Channel Based Calculi, in: Proc. of ICALP 03, LNCS, Springer-Verlag, 2003.

[40]

N. Busi, M. Gabbrielli, G. Zavattaro.
Comparing Recursion, Replication, and Iteration in Process Calculi, in: Proc. of ICALP 04, LNCS, Springer-Verlag, 2004.

[41]

R. Canetti, L. Cheung, N. Lynch, O. Pereira.
On the Role of Scheduling in Simulation-Based Security, 2007, Cryptology ePrint Archive, Report 2007/102.

[42]

K. Chatzikokolakis, C. Palamidessi, P. Panangaden.
Anonymity Protocols as Noisy Channels, in: Information and Computation, 2008, vol. 206, n^o 2–4, p. 378–401
http://hal.inria.fr/inria-00349225/en/.

[43]

K. 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
http://hal.inria.fr/inria-00349224/en/.

[44]

G. Costa, C. Stirling.
A Fair Calculus of Communicating Systems, in: Acta Informatica, 1984, vol. 21, p. 417–441.

[45]

G. Costa, C. Stirling.
Weak and Strong Fairness in CCS, in: Information and Computation, June 1987, vol. 73, n^o 3, p. 207–244.

[46]

T. Hoare, R. Milner.
Grand Challenges for Computing Research, in: Computer Journal, 2005, vol. 48, n^o 1, p. 49-52.

[47]

K. Honda, V. T. Vasconcelos, M. Kubo.
Language Primitives and Type Discipline for Structured Communication-Based Programming, in: Proceedings of the 7th European Symposium on Programming (ESOP), C. Hankin (editor), Lecture Notes in Computer Science, Springer, 1998, vol. 1381, p. 122-138.

[48]

V. Natarajan, R. Cleaveland.
Divergence and Fair Testing, in: Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP), Z. Fülöp, F. Gécseg (editors), Lecture Notes in Computer Science, Springer, 1995, vol. 944, p. 648–659.

[49]

V. 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.

[50]

V. A. Saraswat.
Concurrent Programming Languages, Carnegie-Mellon University, 1989, In ACM distinguished dissertation series. The MIT Press, 1993.

[51]

G. Smith.
On the Foundations of Quantitative Information Flow, in: Proc. of the 12th Int. Conf. on Foundations of Software Science and Computation Structures, York, UK, L. de Alfaro (editor), LNCS, Springer, 2009, vol. 5504, p. 288–302.

[52]

P. Yang, C. R. Ramakrishnan, S. A. Smolka.
A logical encoding of the pi-calculus: model checking mobile processes using tabled resolution, in: International Journal on Software Tools for Technology Transfer, 2004, vol. 6, n^o 1, p. 38–66.