 |
|
|
|
| Papers |
|
Papers (co-)authored by Catuscia Palamidessi
| [1] |
Ehab Elsalamouny, Konstantinos Chatzikokolakis, and Catuscia 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)., 2013. [ bib | http ] |
| [2] |
Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Christelle Braun.
Compositional Methods for Information-Hiding.
Mathematical Structures in Computer Science, 2013.
To appear. [ bib | http ] |
| [3] |
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 ] |
| [4] |
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 ] |
| [5] |
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 ] |
| [6] |
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 ] |
| [7] |
Miguel Andres, E., Nicolas E. Bordenabe, Konstantinos Chatzikokolakis, and
Catuscia Palamidessi.
Geo-Indistinguishability: Differential Privacy for Location-Based
Systems.
Technical report, 2012. [ bib | http ] |
| [8] |
Konstantinos Chatzikokolakis, Miguel Andres, E., Nicolas E. Bordenabe, and
Catuscia Palamidessi.
Enhancing Differential Privacy: from Hamming to General Metrics.
Technical report, 2012. [ bib | http ] |
| [9] |
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 ] |
| [10] |
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 ] |
| [11] |
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 ] |
| [12] |
Mário Alvim, S., Miguel Andres, E., Konstantinos Chatzikokolakis, Pierpaolo
Degano, and Catuscia Palamidessi.
Differential Privacy: on the trade-off between Utility and
Information Leakage.
In Gilles Barthe, Anupam Datta, and Sandro Etalle, editors, The
8th International Workshop on Formal Aspects of Security & Trust (FAST),
Lecture Notes in Computer Science, Leuven, Belgium, March 2011. Springer. [ bib | http ] |
| [13] |
Miguel Andres, E., Catuscia Palamidessi, Ana Sokolova, and Peter Van Rossum.
Information Hiding in Probabilistic Concurrent Systems.
Journal of Theoretical Computer Science, 412(28):3072-3089,
2011. [ bib | http ] |
| [14] |
Andrés Aristizabal, Filippo Bonchi, Catuscia Palamidessi, Luis Pino, and
Frank D. Valencia.
Deriving Labels and Bisimilarity for Concurrent Constraint
Programming.
In Martin Hofmann, editor, Proceedings of the 14th
International Conference on Foundations of Software Science an Computation
Structures (FOSSACS 2011). , volume 6604 of Lecture Notes in Computer
Science, pages 138-152, Saarbrücken, Germany, 2011. Springer. [ bib | http ] |
| [15] |
Mário Alvim, S., Miguel Andres, E., Konstantinos Chatzikokolakis, and
Catuscia Palamidessi.
On the relation between Differential Privacy and Quantitative
Information Flow.
In Jiri Sgall Luca Aceto, Monika Henzinger, editor, 38th
International Colloquium on Automata, Languages and Programming - ICALP
2011, volume 6756 of Lecture Notes in Computer Science, pages 60-76,
Zurich, Switzerland, 2011. Springer. [ bib | http ] |
| [16] |
Mário Alvim, Miguel Andres, E., Konstantinos Chatzikokolakis, and Catuscia
Palamidessi.
Quantitative Information Flow and Applications to Differential
Privacy.
In Alessandro Aldini and Roberto Gorrieri, editors, Foundations
of Security Analysis and Design VI - FOSAD Tutorial Lectures, volume 6858
of Lecture Notes in Computer Science, pages 211-230. Springer, 2011. [ bib | http ] |
| [17] |
Sebastian Mödersheim and Catuscia Palamidessi, editors.
Post-proceedings of TOSCA - Theory of Security and
Applications, volume 6993 of Lecture Notes in Computer Science.
Springer, 2011. [ bib | http ] |
| [18] |
Catuscia Palamidessi and Alma Riska, editors.
Proceedings of the Eighth International Conference on
Quantitative Evaluation of SysTems. IEEE, 2011. [ bib | http ] |
| [19] |
Giuseppe Longo, Catuscia Palamidessi, and Paul Thierry.
Some Bridging Results and Challenges in Classical, Quantum and
Computational Randomnessi.
In Hector Zenil, editor, Randomness Through Computation. World
Scientific, 2011.
ISBN: 978-981-4327-74-9. [ bib | http ] |
| [20] |
Maurizio Gabbrielli, Catuscia Palamidessi, and Frank D. Valencia.
Concurrent and reactive constraint programming.
In Agostino Dovier and Enrico Pontelli, editors, A 25-Year
Perspective on Logic Programming, pages 231-253. Springer, June 2010. [ bib | http ] |
| [21] |
Sardaouna Hamadou, Catuscia Palamidessi, Vladimiro Sassone, and Ehab
ElSalamouny.
Probable innocence and independent knowledge.
In Pierpaolo Degano and Joshua D. Guttman, editors,
Postproceedings of the 6th International Workshop on Formal Aspects in
Security and Trust, volume 5983 of Lecture Notes in Computer Science,
pages 141-156, Eindhoven, The Netherlands, 2010. Springer. [ bib | http ] |
| [22] |
Catuscia Palamidessi.
Compositionality of Secure Information Flow.
In Claude Bolduc, Jules Desharnais, and Béchir Ktari,
editors, Joint Conference: 10th International Conference on the
Mathematics of Program Construction (MPC 2010), and 13th International
Conference on Algebraic Methodology And Software Technology (AMAST 2010),
volume 6120 of Lecture Notes in Computer Science, pages 19-19,
Lac Beaufort, Québec City, Canada, 2010. Springer. [ bib | http ] |
| [23] |
Catuscia Palamidessi, Mário S. Alvim, and Miguel E. Andres.
Interactive Information Flow.
In Alessandro Armando and Gavin Lowe, editors, Joint
Workshop on Automated Reasoning for Security Protocol Analysis
and Issues in the Theory of Security (ARSPA-WITS 2010), volume
6186 of Lecture Notes in Computer Science, pages 111-111,
Paphos, Cyprus, 2010. Springer. [ bib | http ] |
| [24] |
Mário S. Alvim, Miguel E. Andres, and Catuscia Palamidessi.
Entropy and Attack Models in Information Flow.
In Cristian S. Calude and Vladimiro Sassone, editors,
6th IFIP International Conference on Theoretical Computer Science
(TCS 2010), volume 323 of IFIP Advances in Information and
Communication Technology, pages 53-54, Brisbane, Australia, 2010.
Springer. [ bib | http ] |
| [25] |
Konstantinos Chatzikokolakis and Catuscia Palamidessi.
Making random choices invisible to the scheduler.
Information and Computation, 208(6):694-715, 2010. [ bib | http ] |
| [26] |
Davide Chiarugi, Moreno Falaschi, Carlos Olarte, and Catuscia Palamidessi.
Compositional modelling of signalling pathways in timed concurrent
constraint programming.
In First ACM International Conference on Bioinformatics and
Computational Biology (BCB 2010), pages 414-417, Niagara Falls, New York,
USA, 2010. ACM Digital Libraries. [ bib | http ] |
| [27] |
Miguel E. Andres, Catuscia Palamidessi, Peter Van Rossum, and Geoffrey Smith.
Computing the leakage of information-hiding systems.
In Javier Esparza and Rupak Majumdar, editors, 16th
International Conference on Tools and Algorithms for the Construction and
Analysis of Systems (TACAS 2010), volume 6015 of Lecture Notes in
Computer Science, pages 373-389, Cyprus, 2010. Springer. [ bib | http ] |
| [28] |
Miguel E. Andres, Catuscia Palamidessi, Peter Van Rossum, and Ana Sokolova.
Information hiding in probabilistic concurrent systems.
In 7th IEEE International Conference on Quantitative Evaluation
of SysTems (QEST 2010), pages 17-26, Williamsburg, VA, USA, 2010. IEEE
Computer Society. [ bib | http ] |
| [29] |
Mário S. Alvim, Miguel E. Andres, and Catuscia Palamidessi.
Information flow in interactive systems.
In Paul Gastin and François Laroussinie, editors, 21th
International Conference on Concurrency Theory (CONCUR 2010), volume 6269 of
Lecture Notes in Computer Science, pages 102-116, Paris, France, 2010.
Springer. [ bib | http ] |
| [30] |
Mário S. Alvim, Miguel E. Andres, Catuscia Palamidessi, and Peter
Van Rossum.
Safe equivalences for security properties.
In Cristian S. Calude and Vladimiro Sassone, editors, 6th IFIP
International Conference on Theoretical Computer Science (TCS 2010), volume
323 of IFIP Advances in Information and Communication Technology, pages
55-70, Brisbane, Australia, 2010. Springer. [ bib | http ] |
| [31] |
Sardaouna Hamadou, Vladimiro Sassone, and Catuscia Palamidessi.
Reconciling belief and vulnerability in information flow.
In 31st IEEE Symposium on Security and Privacy, pages 79-92,
Berleley/Oakland, California, USA, 2010. IEEE Computer Society. [ bib | http ] |
| [32] |
Mário S. Alvim, Miguel E. Andres, and Catuscia Palamidessi.
Probabilistic information flow.
In 25th Annual IEEE Symposium on Logic in Computer Science (LICS
2010), pages 314-321, Edinburgh, United Kingdom, 2010. IEEE Computer
Society. [ bib | http ] |
| [33] |
Mário S. Alvim, Konstantinos Chatzikokolakis, Pierpaolo Degano, and
Catuscia Palamidessi.
Differential privacy versus quantitative information flow.
Technical report, INRIA, 2010. [ bib | http ] |
| [34] |
Simon Kramer, Catuscia Palamidessi, Roberto Segala, Andrea Turrini, and
Christelle Braun.
A quantitative doxastic logic for probabilistic processes and
applications to information-hiding.
The Journal of Applied Non-Classical Logics, 19(4):489-516,
2009. [ bib | http ] |
| [35] |
Abhishek Bhowmick and Catuscia Palamidessi.
Bounds on the leakage of the input's distribution in
information-hiding protocols.
In Christos Kaklamanis and Flemming Nielson, editors,
Proceedings of the Fourth Symposium on Trustworthy Global Computing (TGC
2008), volume 5474 of Lecture Notes in Computer Science, pages 36-51.
Springer, 2009. [ bib | http ] |
| [36] |
Gethin Norman, Catuscia Palamidessi, David Parker, and Peng Wu.
Model checking probabilistic and stochastic extensions of the
π-calculus.
IEEE Transactions of Software Engineering, 35(2):209-223,
2009. [ bib | http ] |
| [37] |
Diletta Cacciagrano, Flavio Corradini, and Catuscia Palamidessi.
Explicit fairness in testing semantics.
Logical Methods in Computer Science, 5(2 - 15), 2009. [ bib | http ] |
| [38] |
Romain Beauxis and Catuscia Palamidessi.
Probabilistic and nondeterministic aspects of anonymity.
Theoretical Computer Science, 410(41):4006-4025, 2009. [ bib | http ] |
| [39] |
Christelle Braun, Konstantinos Chatzikokolakis, and Catuscia Palamidessi.
Quantitative notions of leakage for one-try attacks.
In Proceedings of the 25th Conf. on Mathematical Foundations of
Programming Semantics, volume 249 of Electronic Notes in Theoretical
Computer Science, pages 75-91. Elsevier B.V., 2009. [ bib | http ] |
| [40] |
Moreno Falaschi, Carlos Olarte, and Catuscia Palamidessi.
A framework for abstract interpretation of timed concurrent
constraint programs.
In António Porto and Francisco Javier López-Fraguas, editors,
Proceedings of the 11th International ACM SIGPLAN Conference on
Principles and Practice of Declarative Programming, PPDP'09, pages 207-218.
ACM, 2009. [ bib | http ] |
| [41] |
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 ] |
| [42] |
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 ] |
| [43] |
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 ] |
| [44] |
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 ] |
| [45] |
Angelo Troina, Jean Goubault-Larrecq, and Catuscia Palamidessi.
A probabilistic applied pi-calculus.
Technical report, LIX, Ecole Polytechnique, 2008. [ bib ] |
| [46] |
Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden.
Anonymity protocols as noisy channels.
Inf. and Comp., 206(2-4):378-401, 2008. [ bib | http ] |
| [47] |
Jesus Aranda, Cinzia Di Giusto, Catuscia Palamidessi, and Frank Valencia.
Expressiveness of recursion, replication and scope mechanisms in
process calculi.
In Frank S. de Boer and Marcello M. Bonsangue, editors,
Postproceedings of the 5th International Symposium on Formal Methods for
Components and Objects (FMCO'06), volume 4709 of Lecture Notes in
Computer Science, pages 185-206. Springer, 2007.
http://www.lix.polytechnique.fr/~fvalenci/papers/fmco07.pdf. [ bib ] |
| [48] |
Jean Goubault-Larrecq, Catuscia Palamidessi, and Angelo Troina.
A probabilistic applied pi-calculus.
In Proceedings of the 5th Asian Symposium on Programming
Languages and Systems (APLAS'07), volume 4807 of Lecture Notes in
Computer Science, pages 175-190. Springer, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Angelo/aplas.pdf. [ bib ] |
| [49] |
Maria Grazia Vigliotti, Iain Phillips, and Catuscia Palamidessi.
Tutorial on separation results in process calculi via leader election
problems.
Theoretical Computer Science, 388(1-3):267-289, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/2007/MariaGrazia/tcs.pdf. [ bib | http ] |
| [50] |
Gethin Norman, Catuscia Palamidessi, David Parker, and Peng Wu.
Model checking the probabilistic pi-calculus.
In 4th International Conference on the Quantitative Evaluation
of SysTems (QEST), pages 169-178. IEEE Computer Society, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Wu/qest1.pdf.
Full version in
http://www.lix.polytechnique.fr/~catuscia/papers/2009/TSE.pdf. [ bib ] |
| [51] |
Peng Wu, Catuscia Palamidessi, and Huimin Lin.
Symbolic bisimulation for probabilistic systems.
In Proceedings of 4th International Conference on the
Quantitative Evaluation of SysTems (QEST), pages 179-188. IEEE Computer
Society, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Wu/qest2.pdf. [ bib ] |
| [52] |
Carlos Olarte, Catuscia Palamidessi, and Frank D. Valencia.
Universal timed concurrent constraint programming.
In Verónica Dahl and Ilkka Niemelä, editors, Proceedings
of the 23rd International Conference in Logic Programming (ICLP'07), volume
4670 of Lecture Notes in Computer Science, pages 464-465. Springer,
2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Carlos/iclp07DC.pdf. [ bib ] |
| [53] |
Moreno Falaschi, Carlos Olarte, Catuscia Palamidessi, and Frank D. Valencia.
Declarative diagnosis of temporal concurrent constraint programs.
In Verónica Dahl and Ilkka Niemelä, editors, Proceedings
of The 23rd International Conference in Logic Programming (ICLP'07), volume
4670 of Lecture Notes in Computer Science, pages 271-285. Springer,
2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Carlos/iclp07.pdf. [ bib ] |
| [54] |
Konstantinos Chatzikokolakis and Catuscia Palamidessi.
Making random choices invisible to the scheduler.
In Luís Caires and Vasco Thudichum Vasconcelos, editors,
Proceedings of CONCUR'07, volume 4703 of Lecture Notes in Computer
Science, pages 42-58. Springer, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Scheduler/report.pdf. [ bib ] |
| [55] |
Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden.
Probability of error in information-hiding protocols.
In Proceedings of the 20th IEEE Computer Security Foundations
Symposium (CSF20), pages 341-354. IEEE Computer Society, 2007. [ bib ] |
| [56] |
Diletta Cacciagrano, Flavio Corradini, and Catuscia Palamidessi.
Fair π.
In Proceedings of the 13th International Workshop on
Expressiveness in Concurrency (EXPRESS'06), volume 175 (3) of
Electronic Notes in Theoretical Computer Science, pages 3-26. Elsevier
Science B.V., 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Diletta/FairPi/express06.pdf. [ bib ] |
| [57] |
Yuxin Deng and Catuscia Palamidessi.
Axiomatizations for probabilistic finite-state behaviors.
Theoretical Computer Science, 373(1-2):92-114, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Prob_Axiom/tcs.pdf. [ bib | http ] |
| [58] |
Diletta Cacciagrano, Flavio Corradini, and Catuscia Palamidessi.
Separation of synchronous and asynchronous communication via testing.
Theoretical Computer Science, 386(3):218-235, 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Diletta/Must/report.pdf. [ bib | http ] |
| [59] |
Konstantinos Chatzikokolakis and Catuscia Palamidessi.
A framework for analyzing probabilistic protocols and its application
to the partial secrets exchange.
Theoretical Computer Science, 389(3):512-527, 2007.
A short version of this paper appeared in the Proceedings of the
Symposium on Trustworthy Global Computing (TGC), volume 3705 of LNCS, pages
146-162. Springer.
http://www.lix.polytechnique.fr/~catuscia/papers/PartialSecrets/TCSreport.pdf. [ bib ] |
| [60] |
Yuxin Deng, Catuscia Palamidessi, and Jun Pang.
Weak probabilistic anonymity.
In Michael Backes and Andre Scedrov, editors, Proceedings of the
3rd International Workshop on Security Issues in Concurrency (SecCo), volume
180 (1) of Electronic Notes in Theoretical Computer Science, pages
55-76. Elsevier Science B.V., 2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/report_wa.pdf. [ bib ] |
| [61] |
C. Palamidessi and F. Valencia.
Languages for concurrency.
Bulletin of the European Association for Theoretical Computer
Science, 90:155-171, October 2006.
Column: Programming Languages.
http://www.lix.polytechnique.fr/~catuscia/papers/Frank/EATCS_06/paper.pdf. [ bib ] |
| [62] |
Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden.
Anonymity protocols as noisy channels.
In Proceedings of the 2nd Symposium on Trustworthy Global
Computing (TGC), volume 4661 of Lecture Notes in Computer Science,
pages 281-300. Springer, 2006.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/Channels/tgc.pdf. [ bib ] |
| [63] |
Hugo A. López, Catuscia Palamidessi, Jorge, Camilo Rueda, and Frank D.
Valencia.
A declarative framework for security: Secure concurrent constraint
programming.
In Sandro Etalle and Miroslaw Truszczynski, editors, Proceedings
of the 22nd International Conference on logic Programming, (ICLP), volume
4079 of Lecture Notes in Computer Science, pages 449-450. Springer,
2006. [ bib ] |
| [64] |
Catuscia Palamidessi, Vijay A. Saraswat, Frank D. Valencia, and Björn
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), pages 59-68. IEEE Computer Society, 2006.
http://www.lix.polytechnique.fr/~catuscia/papers/Frank/LICS_06/main.pdf. [ bib | http ] |
| [65] |
Konstantinos Chatzikokolakis and Catuscia Palamidessi.
Probable innocence revisited.
Theoretical Computer Science, 367(1-2):123-138, 2006.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/tcsPI.pdf. [ bib | http ] |
| [66] |
Sylvain Pradalier and Catuscia Palamidessi.
Expressiveness of probabilistic π-calculi.
In Proceedings of the 4th International Workshop on Quantitative
Aspects of Programming Languages (QAPL), volume 164 (3) of Electronic
Notes in Theoretical Computer Science, pages 119-136. Elsevier Science
B.V., 2006.
http://www.lix.polytechnique.fr/~catuscia/papers/Sylvain/QAPL06/FinalBis.pdf. [ bib ] |
| [67] |
Catuscia Palamidessi and Mohit Bhargava.
Probabilistic anonymity.
In José Luiz Fiadeiro, Ugo Montanari, and Martin Wirsing,
editors, Foundations of Global Computing, number 05081 in Dagstuhl
Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum
(IBFI), Schloss Dagstuhl, Germany, 2006.
drops.dagstuhl.de/opus/volltexte/2006/299. [ bib ] |
| [68] |
Yuxin Deng, Tom Chothia, Catuscia Palamidessi, and Jun Pang.
Metrics for action-labelled quantitative transition systems.
In Proceedings of the Third Workshop on Quantitative Aspects of
Programming Languages (QAPL 2005), volume 153 of Electronic Notes in
Theoretical Computer Science, pages 79-96. Elsevier Science Publishers,
2006.
http://www.lix.polytechnique.fr/~catuscia/papers/Metrics/QAPL/gts.pdf. [ bib ] |
| [69] |
Konstantinos Chatzikokolakis and Catuscia Palamidessi.
Probable innocence revisited.
In Theodosis Dimitrakos, Fabio Martinelli, Peter Y. A. Ryan, and
Steve A. Schneider, editors, Third International Workshop on Formal
Aspects in Security and Trust (FAST 2005), Revised Selected Papers, volume
3866 of Lecture Notes in Computer Science, pages 142-157. Springer,
2006. [ bib | .pdf ] |
| [70] |
Diletta Cacciagrano, Flavio Corradini, and Catuscia Palamidessi.
Separation of synchronous and asynchronous communication via testing.
In Proceedings of the 12th International Workshop on
Expressiveness in Concurrency (EXPRESS 2005), volume 154 of Electronic
Notes in Theoretical Computer Science, pages 95-108, San Francisco, USA,
2006. Elsevier Science B.V.
http://www.lix.polytechnique.fr/~catuscia/papers/Diletta/Must/report.pdf. [ bib ] |
| [71] |
Catuscia Palamidessi.
Probabilistic and nondeterministic aspects of anonymity.
In Proceedings of the 21st Conference on the Mathematical
Foundations of Programming Semantics (MFPS XXI), volume 155 of
Electronic Notes in Theoretical Computer Science, pages 33-42, Birmingham,
UK, 2006. Elsevier Science B.V.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/MFPS/paper.pdf. [ bib ] |
| [72] |
Catuscia Palamidessi.
Anonymity in probabilistic and nondeterministic systems.
In Proceedings of the Workshop on ``Essays on Algebraic Process
Calculi'' (APC 25), volume 162 of Electronic Notes in Theoretical
Computer Science, pages 277-279, Bertinoro, Italy, 2006. Elsevier Science
B.V.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/Bertinoro/paper.pdf. [ bib ] |
| [73] |
Axelle Ziegler, Dale Miller, and Catuscia Palamidessi.
A congruence format for name-passing calculi.
In Proceedings of the 2nd Workshop on Structural Operational
Semantics (SOS'05), volume 156 of Electronic Notes in Theoretical
Computer Science, pages 169-189, Lisbon, Portugal, 2006. Elsevier Science
B.V.
http://www.lix.polytechnique.fr/~catuscia/papers/Axelle/SOS_05/report.pdf. [ bib ] |
| [74] |
Catuscia Palamidessi, Iain Phillips, and Maria Grazia Vigliotti.
Expressiveness via leader election problems.
In Frank S. de Boer, Marcello M. Bonsangue, Susanne Graf, and
Willem P. de Roever, editors, Postproceedings of the 4th International
Symposium on Formal Methods for Components and Objects (FMCO), volume 4111
of Lecture Notes in Computer Science, pages 172-194. Springer, 2005.
http://www.lix.polytechnique.fr/~catuscia/papers/2006/MariaGrazia/FMCO/fmco-06.pdf. [ bib ] |
| [75] |
Yuxin Deng and Catuscia Palamidessi.
Axiomatizations for probabilistic finite-state behaviors.
In Proceedings of FOSSACS'05, volume 3441 of Lecture Notes
in Computer Science, pages 110-124. Springer, 2005.
http://www.lix.polytechnique.fr/~catuscia/papers/Prob_Axiom/fossacs05.pdf. [ bib ] |
| [76] |
Catuscia Palamidessi and Oltea M. Herescu.
A randomized encoding of the π-calculus with mixed choice.
Theoretical Computer Science, 335(2-3):373-404, 2005.
http://www.lix.polytechnique.fr/~catuscia/papers/prob_enc/report.pdf. [ bib | http ] |
| [77] |
Konstantinos Chatzikokolakis and Catuscia Palamidessi.
A framework for analyzing probabilistic protocols and its application
to the partial secrets exchange.
In Proceedings of the Symp. on Trustworthy Global Computing,
volume 3705 of Lecture Notes in Computer Science, pages 146-162.
Springer, 2005.
http://www.lix.polytechnique.fr/~catuscia/papers/PartialSecrets/tgc05.pdf. [ bib ] |
| [78] |
Mohit Bhargava and Catuscia Palamidessi.
Probabilistic anonymity.
In Martín Abadi and Luca de Alfaro, editors, Proceedings of
CONCUR, volume 3653 of Lecture Notes in Computer Science, pages
171-185. Springer, 2005.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/concur.pdf. [ bib ] |
| [79] |
Yuxin Deng, Catuscia Palamidessi, and Jun Pang.
Compositional reasoning for probabilistic finite-state behaviors.
In Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, and
Roel C. de Vrijer, editors, Processes, Terms and Cycles: Steps on the
Road to Infinity, volume 3838 of Lecture Notes in Computer Science,
pages 309-337. Springer, 2005.
http://www.lix.polytechnique.fr/~catuscia/papers/Yuxin/BookJW/par.pdf. [ bib ] |
| [80] |
Catuscia Palamidessi and Frank D. Valencia.
Recursion vs replication in process calculi: Expressiveness.
Bulletin of the EATCS, 87:105-125, 2005.
Column: Concurrency.
http://www.lix.polytechnique.fr/~catuscia/papers/Frank/EATCS_05/recrep.pdf. [ bib ] |
| [81] |
Mohit Bhargava and Catuscia Palamidessi.
Probabilistic anonymity.
Technical report, INRIA Futurs and LIX, 2005.
To appear in the proceedings of CONCUR 2005. Report version available
at
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/report.ps. [ bib ] |
| [82] |
Konstantinos Chatzikokolakis and Catuscia Palamidessi.
Probable innocence revisited.
Technical report, INRIA Futurs and LIX, 2005.
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/reportPI.pdf. [ bib ] |
| [83] |
Oltea M. Herescu and Catuscia Palamidessi.
Probabilistic asynchronous π-calculus.
Technical report, INRIA Futurs and LIX, 2004.
http://www.lix.polytechnique.fr/~catuscia/papers/Prob_asy_pi/report.ps. [ bib ] |
| [84] |
Catuscia Palamidessi.
Comparing the expressive power of the synchronous and the
asynchronous pi-calculus.
Mathematical Structures in Computer Science, 13(5):685-719,
2003.
Available at
http://www.lix.polytechnique.fr/~catuscia/papers/pi_calc/mscs.pdf. A
short version of this paper appeared in POPL'97. [ bib | http ] |
| [85] |
Raymond McDowell, Dale Miller, and Catuscia Palamidessi.
Encoding transition systems in sequent calculus.
Theoretical Computer Science, 294(3):411-437, 2003.
http://www.lix.polytechnique.fr/~catuscia/papers/Tran_Sys_in_SC/tcs.ps. [ bib ] |
| [86] |
Catuscia Palamidessi and Oltea M. Herescu.
A randomized encoding of the π-calculus with mixed choice.
In Proceedings of the 2nd IFIP International Conference on
Theoretical Computer Science, pages 537-549, 2002.
http://www.lix.polytechnique.fr/~catuscia/papers/prob_enc/ifiptcs02.ps. [ bib ] |
| [87] |
Mogens Nielsen, Catuscia Palamidessi, and Frank D. Valencia.
On the expressive power of temporal concurrent constraint programming
languages.
In Proceedings of the Fourth ACM SIGPLAN Conference on
Principles and Practice of Declarative Programming, pages 156-167, New
York, October6-8 2002. ACM Press.
http://www.lix.polytechnique.fr/~catuscia/papers/ppdp02.ps. [ bib ] |
| [88] |
Catuscia Palamidessi.
Mobile calculi for distributed programming.
In Proceedings of the Fourth ACM SIGPLAN Conference on
Principles and Practice of Declarative Programming (PPDP-02), pages
74-75, New York, 2002. ACM Press.
Invited talk. [ bib ] |
| [89] |
M. Nielsen, C. Palamidessi, and F. Valencia.
Temporal concurrent constraint programming: Denotation, logic and
applications.
Nordic Journal of Computing, 9:145-188, 2002.
http://www.lix.polytechnique.fr/ catuscia/papers/Ntcc/njc02.ps. [ bib ] |
| [90] |
Catuscia Palamidessi and Frank D. Valencia.
A temporal concurrent constraint programming calculus.
In Toby Walsh, editor, Proc. of the 7th International Conference
on Principles and Practice of Constraint Programming, volume 2239 of
Lecture Notes in Computer Science, pages 302-316. Springer, 2001.
http://www.lix.polytechnique.fr/~catuscia/papers/Ntcc/final.ps. [ bib ] |
| [91] |
Oltea Mihaela Herescu and Catuscia Palamidessi.
On the generalized dining philosophers problem.
In Proceedings of the 20th ACM Symposium on Principles of
Distributed Computing, pages 81-89, 2001.
http://www.lix.polytechnique.fr/~catuscia/papers/Gen_Phil/podc.ps. [ bib ] |
| [92] |
Catuscia Palamidessi, Joachim Parrow, and Rob J. van Glabbeek.
Preface.
Information and Computation, 156(1-2):1, 2000. [ bib ] |
| [93] |
Oltea Mihaela Herescu and Catuscia Palamidessi.
Probabilistic asynchronous π-calculus.
In Jerzy Tiuryn, editor, Proceedings of FOSSACS 2000 (Part of
ETAPS 2000), volume 1784 of Lecture Notes in Computer Science, pages
146-160. Springer, 2000.
http://www.lix.polytechnique.fr/~catuscia/papers/Prob_asy_pi/fossacs.ps. [ bib ] |
| [94] |
David Gilbert and Catuscia Palamidessi.
Concurrent constraint programming with process mobility.
In John Lloyd et al., editor, Proceedings of the Conference on
Computational Logic - CL 2000, Lecture Notes in Artificial Intelligence,
pages 463-477. Springer, 2000.
http://www.lix.polytechnique.fr/~catuscia/papers/CC_Migration/cl.ps. [ bib ] |
This file has been generated by bibtex2html 1.74
Back
Page maintainer: Catuscia Palamidessi