 |
|
|
|
| Papers |
|
Papers published in 2008
| [1] |
Jesús Aranda, Jorge A. Pérez, Camilo Rueda, and Frank D. Valencia.
Stochastic behavior and explicit discrete time in concurrent
constraint programming.
In Maria Garcia de la Banda and Enrico Pontelli, editors, 24th
International Conference on Logic Programming, volume 5366 of Lecture
Notes in Computer Science, pages 682-686. Springer, 2008. [ bib ] |
| [2] |
Romain Beauxis.
Probabilistic and concurrent models for security.
In Maria Garcia de la Banda and Enrico Pontelli, editors, 24th
International Conference on Logic Programming, volume 5366 of Lecture
Notes in Computer Science, pages 801-802. Springer, 2008. [ bib ] |
| [3] |
Romain Beauxis, Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash
Panangaden.
Formal approaches to information-hiding (tutorial).
In Gilles Barthe and Cédric Fournet, editors, Proceedings of
the Third Symposium on Trustworthy Global Computing (TGC 2007), volume 4912
of Lecture Notes in Computer Science, pages 347-362. Springer, 2008. [ bib | http | .pdf ] |
| [4] |
Romain Beauxis, Catuscia Palamidessi, and Frank D. Valencia.
On the asynchronous nature of the asynchronous pi-calculus.
In Pierpaolo Degano, Rocco De Nicola, and José Meseguer, editors,
Concurrency, Graphs and Models, volume 5065 of Lecture Notes in
Computer Science, pages 473-492. Springer, 2008. [ bib | http | .pdf ] |
| [5] |
Christelle Braun, Konstantinos Chatzikokolakis, and Catuscia Palamidessi.
Compositional methods for information-hiding.
In Roberto Amadio, editor, Proceedings of FOSSACS, volume 4962
of Lecture Notes in Computer Science, pages 443-457. Springer, 2008. [ bib | http | .pdf ] |
| [6] |
Diletta Cacciagrano, Flavio Corradini, Jesús Aranda, and Frank D. Valencia.
Linearity, persistence and testing semantics in the asynchronous
pi-calculus.
In Roberto Amadio and Thomas Hildenbrandt, editors, Proc. of
14th International Workshop on Expressiveness of Concurrency,
(EXPRESS'07), volume 194 of ENTCS, pages 59-84. Elsevier, 2008.
http://www.brics.dk/~fvalenci/papers/pers-test.pdf. [ bib ] |
| [7] |
Konstantinos Chatzikokolakis and Keye Martin.
A monotonicity principle for information theory.
In Andrej Bauer and Michael Mislove, editors, Proceedings of the
Twenty-fourth Conference on the Mathematical Foundations of Programming
Semantics, volume 218 of Electronic Notes in Theoretical Computer
Science, pages 111-129. Elsevier B.V., 2008. [ bib ] |
| [8] |
Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden.
Anonymity protocols as noisy channels.
Inf. and Comp., 206(2-4):378-401, 2008. [ bib | http ] |
| [9] |
Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden.
On the bayes risk in information-hiding protocols.
Journal of Computer Security, 16(5):531-571, 2008. [ bib | http | .pdf ] |
| [10] |
Alberto Credi, Marco Garavelli, Cosimo Laneve, Sylvain Pradalier, Serena Silvi,
and Gianluigi Zavattaro.
nanok: A calculus for the modeling and simulation of nano devices.
Theoretical Computer Science, 408(1):17-30, 2008. [ bib ] |
| [11] |
Simon Kramer.
Cryptographic protocol logic: Satisfaction for (timed) dolev-yao
cryptography.
Journal of Logic and Algebraic Programming, 77(1-2):60 - 91,
2008. [ bib | http ] |
| [12] |
Simon Kramer.
Reducing provability to knowledge in multi-agent systems.
In Proceedings of the LiCS-affiliated Intuitionistic Modal
Logics and Applications Workshop, Electronic Notes in Theoretical Computer
Science. Elsevier B.V., 2008.
To appear. Extended version submitted to Information and Computation. [ bib ] |
| [13] |
Simon Kramer and Julian C. Bradfield.
A general definition of malware.
In Proceedings of the Workshop on the Theory of Computer
Viruses, 2008.
Extended version submitted to the Journal of Computer Virology. [ bib | www: ] |
| [14] |
Jean Krivine, Robin Milner, and Angelo Troina.
Stochastic bigraphs.
In Andrej Bauer and Michael Mislove, editors, Proceedings of the
24th Conference on the Mathematical Foundations of Programming Semantics
(MFPS XXIV), volume 218 of Electronic Notes in Theoretical Computer
Science, pages 73-96. Elsevier B.V., 2008. [ bib ] |
| [15] |
Carlos Olarte and Frank D. Valencia.
The expressivity of universal timed ccp: undecidability of monadic
fltl and closure operators for security.
In Sergio Antoy and Elvira Albert, editors, Proceedings of the
10th International ACM SIGPLAN Conference on Principles and Practice of
Declarative Programming, pages 8-19, 2008. [ bib | http ] |
| [16] |
Carlos Olarte and Frank D. Valencia.
Universal concurrent constraint programing: Symbolic semantics and
applications to security.
In Proceedings of the 23rd ACM Symposium on Applied Computing
(SAC), pages 145-150. ACM, 2008.
http://www.lix.polytechnique.fr/~colarte/colarte/Publications_files/sac08.pdf. [ bib | http | .pdf ] |
| [17] |
Angelo Troina, Jean Goubault-Larrecq, and Catuscia Palamidessi.
A probabilistic applied pi-calculus.
Technical report, LIX, Ecole Polytechnique, 2008. [ bib ] |
This file has been generated by bibtex2html 1.74
Back
Page maintainer: Catuscia Palamidessi