Group COMETE

Group Comète

LIX, Ecole Polytechnique

Themes: digital trust

Comète focuses on the design, implementation and applications of formal languages for mobile, secure, stochastic and distributed systems. We are particularly interested in formal languages based on process calculi.

Contact person: Catuscia Palamidessi, http://www.lix.polytechnique.fr/~catuscia/

Web site: http://www.lix.polytechnique.fr/comete/

Journal articles

2022

ref_biblio: Héber Hwang Arcolezi, Jean-François Couchot, Denis Renaud, Bechara Al Bouna, Xiaokui Xiao. Differentially private multivariate time series forecasting of aggregated human mobility with deep learning: Input or gradient perturbation?. Neural Computing and Applications, Springer Verlag, 2022, pp.13355-13369. ⟨10.1007/s00521-022-07393-0⟩. ⟨hal-03689723⟩
Accès au texte intégral et bibtex

ref_biblio: Héber H. Arcolezi, Jean-François Couchot, Bechara Al Bouna, Xiaokui Xiao. Improving the utility of locally differentially private protocols for longitudinal and multidimensional frequency estimates. Digital Communications and Networks, Elsevier [Co-publisher] In press, ⟨10.1016/j.dcan.2022.07.003⟩. ⟨hal-03727621⟩
Accès au texte intégral et bibtex

2021

ref_biblio: Michell Guzmán, Sophia Knight, Santiago Quintero, Sergio Ramírez, Camilo Rueda, et al.. Algebraic Structures from Concurrent Constraint Programming Calculi for Distributed Information in Multi-Agent Systems. Journal of Logical and Algebraic Methods in Programming, Elsevier, In press. ⟨hal-03098441⟩
Accès au texte intégral et bibtex

ref_biblio: Karima Makhlouf, Sami Zhioua, Catuscia Palamidessi. On the Applicability of ML Fairness Notions. SIGKDD Explorations Newsletter, ACM 2021, 23 (1), pp.14-23. ⟨10.1145/3468507.3468511⟩. ⟨hal-03091436⟩
Accès au bibtex

ref_biblio: Karima Makhlouf, Sami Zhioua, Catuscia Palamidessi. Machine learning fairness notions: Bridging the gap with real-world applications. Information Processing and Management, Elsevier, 2021, 58 (5), ⟨10.1016/j.ipm.2021.102642⟩. ⟨hal-03624025⟩
Accès au bibtex

2020

ref_biblio: Valentina Castiglioni, Konstantinos Chatzikokolakis, Catuscia Palamidessi. A Logical Characterization of Differential Privacy. Science of Computer Programming, Elsevier, 2020, 188, pp.102388. ⟨10.1016/j.scico.2019.102388⟩. ⟨hal-02423048⟩
Accès au texte intégral et bibtex

ref_biblio: Konstantinos Chatzikokolakis, Natasha Fernandes, Catuscia Palamidessi. Refinement Orders for Quantitative Information Flow and Differential Privacy. Journal of Cybersecurity and Privacy, MDPI, 2020, 1, pp.40 - 77. ⟨10.3390/jcp1010004⟩. ⟨hal-03091754⟩
Accès au texte intégral et bibtex

ref_biblio: Moreno Falaschi, Maurizio Gabbrielli, Carlos Olarte, Catuscia Palamidessi. Dynamic slicing for Concurrent Constraint Languages. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2020, 177 (3-4), pp.331-357. ⟨10.3233/FI-2020-1992⟩. ⟨hal-02423973v2⟩
Accès au texte intégral et bibtex

ref_biblio: Daniele Gorla, Federica Granese, Catuscia Palamidessi. Enhanced Models for Privacy and Utility in Continuous-Time Diffusion Networks. International Journal of Information Security, Springer Verlag, In press, ⟨10.1007/s10207-020-00530-7⟩. ⟨hal-03094843⟩
Accès au texte intégral et bibtex

2019

ref_biblio: Mário S. Alvim, Konstantinos Chatzikokolakis, Carroll Morgan, Catuscia Palamidessi, Geoffrey Smith, et al.. An Axiomatization of Information Flow Measures. Theoretical Computer Science, Elsevier, 2019, 777, pp.32-54. ⟨10.1016/j.tcs.2018.10.016⟩. ⟨hal-01995712⟩
Accès au texte intégral et bibtex

ref_biblio: Frank D. Valencia. Semantic Structures for Spatially-Distributed Multi-Agent Systems. Electronic Proceedings in Theoretical Computer Science, EPTCS, 2019, Proceedings Combined 26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics, EXPRESS/SOS 2019, 300, pp.39-53. ⟨10.4204/EPTCS.300.3⟩. ⟨hal-02410770⟩
Accès au bibtex

2018

ref_biblio: Mário S. Alvim, Konstantinos Chatzikokolakis, Yusuke Kawamoto, Catuscia Palamidessi. A Game-Theoretic Approach to Information-Flow Control via Protocol Composition. Entropy, MDPI, 2018, 20 (5), pp.382. ⟨10.3390/e20050382⟩. ⟨hal-01966862⟩
Accès au texte intégral et bibtex

ref_biblio: Valentina Castiglioni, Daniel Gebler, Simone Tini. SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2018, 14 (2), ⟨10.23638/LMCS-14(2:18)2018⟩. ⟨hal-01966954⟩
Accès au bibtex

ref_biblio: Fabio Gadducci, Francesco Santini, Luis Fernando Pino Duque, Frank Valencia. Observational and Behavioural Equivalences for Soft Concurrent Constraint Programming. Journal of Logical and Algebraic Methods in Programming, Elsevier, 2018, 92, pp.45-63. ⟨10.1016/j.jlamp.2017.06.001⟩. ⟨hal-01675060⟩
Accès au bibtex

ref_biblio: Michell Guzmán, Salim Perchy, Camilo Rueda, Frank Valencia. Characterizing Right Inverses for Spatial Constraint Systems with Applications to Modal Logic. Theoretical Computer Science, Elsevier, 2018, 744 (56--77). ⟨hal-01675010v2⟩
Accès au texte intégral et bibtex

2017

ref_biblio: Konstantinos Chatzikokolakis, Ehab Elsalamouny, Catuscia Palamidessi. Efficient Utility Improvement for Location Privacy. Proceedings on Privacy Enhancing Technologies, De Gruyter Open, 2017, 2017 (4), pp.308-328. ⟨10.1515/popets-2017-0051⟩. ⟨hal-01422842v2⟩
Accès au texte intégral et bibtex

ref_biblio: Konstantinos Chatzikokolakis, Ehab Elsalamouny, Catuscia Palamidessi, Anna Pazii. Methods for Location Privacy: A comparative overview. Foundations and Trends® in Privacy and Security , Now publishers inc, 2017, 1 (4), pp.199-257. ⟨10.1561/3300000017⟩. ⟨hal-01421457v2⟩
Accès au texte intégral et bibtex

ref_biblio: Stefan Haar, Salim Perchy, Frank Valencia. Declarative Framework for Semantical Interpretations of Structured Information — An Applicative Approach. International Journal of Semantic Computing, World Scientific, 2017, 11 (04), pp.451 - 472. ⟨10.1142/S1793351X17400189⟩. ⟨hal-01673529⟩
Accès au texte intégral et bibtex

ref_biblio: Sardaouna Hamadou, Catuscia Palamidessi, Vladimiro Sassone. Quantifying Leakage in the Presence of Unreliable Sources of Information. Journal of Computer and System Sciences, Elsevier, 2017, 88, pp.27-52. ⟨hal-01421417⟩
Accès au texte intégral et bibtex

ref_biblio: Ali Kassem, Yliès Falcone, Pascal Lafourcade. Formal analysis and offline monitoring of electronic exams. Formal Methods in System Design, Springer Verlag, 2017, 51 (1), pp.117 - 153. ⟨10.1007/s10703-017-0280-0⟩. ⟨hal-01653884⟩
Accès au texte intégral et bibtex

ref_biblio: Yusuke Kawamoto, Konstantinos Chatzikokolakis, Catuscia Palamidessi. On the Compositionality of Quantitative Information Flow. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2017, 13 (3), pp.1-31. ⟨hal-01421424⟩
Accès au bibtex

2016

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi, Christelle Braun. Compositional methods for information-hiding. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2016, 26 (6), pp.908-932. ⟨10.1017/S0960129514000292⟩. ⟨hal-01006384⟩
Accès au texte intégral et bibtex

ref_biblio: Ehab Elsalamouny, Sébastien Gambs. Differential Privacy Models for Location- Based Services. Transactions on Data Privacy, IIIA-CSIC, 2016, 9 (1), pp.15 - 48. ⟨hal-01418136⟩
Accès au texte intégral et bibtex

ref_biblio: Ivan Gazeau, Dale Miller, Catuscia Palamidessi. Preserving differential privacy under finite-precision semantics. Theoretical Computer Science, Elsevier, 2016. ⟨hal-01390927⟩
Accès au texte intégral et bibtex

ref_biblio: Michell Guzmán, Stefan Haar, Salim Perchy, Camilo Rueda, Frank Valencia. Belief, Knowledge, Lies and Other Utterances in an Algebra for Space and Extrusion. Journal of Logical and Algebraic Methods in Programming, Elsevier, 2016, ⟨10.1016/j.jlamp.2016.09.001⟩. ⟨hal-01257113v4⟩
Accès au texte intégral et bibtex

2015

ref_biblio: Mário Sérgio Alvim, Miguel E. Andrés, Konstantinos Chatzikokolakis, Pierpaolo Degano, Catuscia Palamidessi. On the information leakage of differentially-private mechanisms. Journal of Computer Security, IOS Press, 2015, 23 (4), pp.427-469. ⟨10.3233/JCS-150528⟩. ⟨hal-00940425v2⟩
Accès au texte intégral et bibtex

ref_biblio: Filippo Bonchi, Stefan Milius, Alexandra Silva, Fabio Zanasi. Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure. Theoretical Computer Science, Elsevier, 2015, 604, pp. 102-126. ⟨10.1016/j.tcs.2015.03.024⟩. ⟨hal-01284933⟩
Accès au bibtex

ref_biblio: Filippo Bonchi, Fabio Gadducci, Paolo Baldan, Valentina Monreale. Concurrency cannot be observed, asynchronously. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2015, ⟨10.1017/S0960129513000108⟩. ⟨hal-01284912⟩
Accès au bibtex

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi, Marco Stronati. Constructing elastic distinguishability metrics for location privacy . Proceedings on Privacy Enhancing Technologies, De Gruyter Open, 2015, 2015 (2), pp.156-170. ⟨10.1515/popets-2015-0023⟩. ⟨hal-01270197⟩
Accès au bibtex

ref_biblio: Moreno Falaschi, Carlos Olarte, Catuscia Palamidessi. Abstract Interpretation of Temporal Concurrent Constraint Programs. Theory and Practice of Logic Programming, Cambridge University Press (CUP), 2015, 15 (3), pp.312-357. ⟨hal-00945462⟩
Accès au texte intégral et bibtex

ref_biblio: Luis Pino, Andres Aristizabal, Filippo Bonchi, Frank Valencia. Weak CCP bisimilarity with strong procedures. Science of Computer Programming, Elsevier, 2015, 100, pp.84-104. ⟨10.1016/j.scico.2014.09.007⟩. ⟨hal-00976768v2⟩
Accès au texte intégral et bibtex

ref_biblio: Luis Fernando Pino Duque, Filippo Bonchi, Frank Valencia. Efficient Algorithms for Program Equivalence for Confluent Concurrent Constraint Programming. Science of Computer Programming, Elsevier, 2015, 111, pp.135-155. ⟨10.1016/j.scico.2014.12.003⟩. ⟨hal-01098502⟩
Accès au texte intégral et bibtex

2014

ref_biblio: Thomas Given-Wilson, Daniele Gorla, Barry Jay. A Concurrent Pattern Calculus. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2014, 10 (3), pp.1-46. ⟨10.2168/LMCS-10(3:10)2014⟩. ⟨hal-00987578v2⟩
Accès au texte intégral et bibtex

2013

ref_biblio: Sardaouna Hamadou, Vladimiro Sassone, Mu Yang. An analysis of trust in anonymity networks in the presence of adaptive attackers. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2013. ⟨hal-00760437v2⟩
Accès au texte intégral et bibtex

ref_biblio: Carlos Olarte, Camilo Rueda, Frank D. Valencia. Models and Emerging Trends of Concurrent Constraint Programming. Constraints, Springer Verlag, 2013, 18 (4), pp.535-578. ⟨10.1007/s10601-013-9145-3⟩. ⟨hal-00869192v2⟩
Accès au texte intégral et bibtex

2012

ref_biblio: Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi. Quantitative Information Flow in Interactive Systems. Journal of Computer Security, IOS Press, 2012, 20 (1), pp.3-50. ⟨inria-00637356⟩
Accès au texte intégral et bibtex

ref_biblio: Franck Cassez, Jérémy Dubreil, Hervé Marchand. Synthesis of opaque systems with static and dynamic masks. Formal Methods in System Design, Springer Verlag, 2012, 40 (1), pp.88-115. ⟨10.1007/s10703-012-0141-9⟩. ⟨hal-00662539⟩
Accès au texte intégral et bibtex

ref_biblio: Manuella Catel-Ferreira, Rony Nehmé, Virginie Molle, Jesus Aranda, Emeline Bouffartigues, et al.. Deciphering the Function of the Outer Membrane Protein OprD Homologue of Acinetobacter baumannii. Antimicrobial Agents and Chemotherapy, American Society for Microbiology, 2012, 56 (7), pp.3826-3832. ⟨10.1128/AAC.06022-11⟩. ⟨hal-02282677⟩
Accès au bibtex

ref_biblio: Konstantinos Chatzikokolakis, Sophia Knight, Catuscia Palamidessi, Prakash Panangaden. Epistemic Strategies and Games on Concurrent Processes. ACM Transactions on Computational Logic, Association for Computing Machinery, 2012, 13 (4), pp.28:1-28:35. ⟨10.1145/2362355.2362356⟩. ⟨inria-00637160⟩
Accès au texte intégral et bibtex

ref_biblio: Matteo Mio. Probabilistic modal mu-calculus with independent product. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2012, 8 (4), pp.1-36. ⟨hal-00763451⟩
Accès au bibtex

ref_biblio: Matteo Mio. On the equivalence of game and denotational semantics for the probabilistic μ -calculus. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2012, 8 (2), pp.1-21. ⟨hal-00763454⟩
Accès au bibtex

2011

ref_biblio: Miguel E. Andrés, Catuscia Palamidessi, Ana Sokolova, Peter van Rossum. Information Hiding in Probabilistic Concurrent Systems (journal version). Theoretical Computer Science, Elsevier, 2011, 412 (28), pp.3072-3089. ⟨hal-00573447⟩
Accès au texte intégral et bibtex

2010

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi. Making Random Choices Invisible to the Scheduler. Information and Computation, Elsevier, 2010, 208 (6), pp.694-715. ⟨10.1016/j.ic.2009.06.006⟩. ⟨inria-00424860v2⟩
Accès au texte intégral et bibtex

ref_biblio: Simon Kramer, Julian C. Bradfield. A general definition of malware. Journal in Computer Virology, Springer Verlag, 2010, 6 (2), pp.105-114. ⟨hal-00772694⟩
Accès au bibtex

2009

ref_biblio: Romain Beauxis, Catuscia Palamidessi. Probabilistic and nondeterministic aspects of anonymity. Theoretical Computer Science, Elsevier, 2009, 410 (41), pp.4006--4025. ⟨10.1016/j.tcs.2009.06.008⟩. ⟨inria-00424855⟩
Accès au texte intégral et bibtex

ref_biblio: Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi. Explicit Fairness in Testing Semantics. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2009, 5 (2), pp.Article 15. ⟨hal-00444580⟩
Accès au texte intégral et bibtex

ref_biblio: Simon Kramer, Catuscia Palamidessi, Roberto Segala, Andrea Turrini, Christelle Braun. A Quantitative Doxastic Logic for Probabilistic Processes and Applications to Information-Hiding. Journal of Applied Non-Classical Logics, Taylor & Francis, 2009, 19 (4), pp.489-516. ⟨10.3166/jancl.19.489-516⟩. ⟨inria-00445212v2⟩
Accès au texte intégral et bibtex

ref_biblio: Gethin Norman, Catuscia Palamidessi, David Parker, Peng Wu. Model checking probabilistic and stochastic extensions of the $\pi$-calculus. IEEE Transactions on Software Engineering, Institute of Electrical and Electronics Engineers, 2009, 35 (2), pp.209--223. ⟨inria-00424856⟩
Accès au texte intégral et bibtex

2008

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi, Prakash Panangaden. On the Bayes Risk in Information-Hiding Protocols. Journal of Computer Security, IOS Press, 2008, 16 (5), pp.531--571. ⟨10.3233/JCS-2008-0333⟩. ⟨inria-00349224⟩
Accès au texte intégral et bibtex

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi, Prakash Panangaden. Anonymity Protocols as Noisy Channels. Information and Computation, Elsevier, 2008, 206 (2-4), pp.378--401. ⟨10.1016/j.ic.2007.07.003⟩. ⟨inria-00349225⟩
Accès au texte intégral et bibtex

2007

ref_biblio: Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi. Separation of synchronous and asynchronous communication via testing. Theoretical Computer Science, Elsevier, 2007, 386 (3), pp.218-235. ⟨10.1016/j.tcs.2007.07.009⟩. ⟨inria-00200916⟩
Accès au texte intégral et bibtex

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi. A Framework for Analyzing Probabilistic Protocols and its Application to the Partial Secrets Exchange. Theoretical Computer Science, Elsevier, 2007, 389 (3), pp.512-527. ⟨10.1016/j.tcs.2007.09.006⟩. ⟨inria-00200913⟩
Accès au texte intégral et bibtex

ref_biblio: Yuxin Deng, Catuscia Palamidessi. Axiomatizations for probabilistic finite-state behaviors. Theoretical Computer Science, Elsevier, 2007, 373 (1-2), pp.92-114. ⟨10.1016/j.tcs.2006.12.008⟩. ⟨inria-00200928⟩
Accès au texte intégral et bibtex

ref_biblio: Maria Grazia Vigliotti, Iain Phillips, Catuscia Palamidessi. Tutorial on separation results in process calculi via leader election problems. Theoretical Computer Science, Elsevier, 2007, 388 (1-3), pp.267--289. ⟨10.1016/j.tcs.2007.09.001⟩. ⟨inria-00201071⟩
Accès au texte intégral et bibtex

2006

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi. Probable Innocence Revisited. Theoretical Computer Science, Elsevier, 2006, 367 (1-2), pp.123-138. ⟨10.1016/j.tcs.2006.08.033⟩. ⟨inria-00201072⟩
Accès au texte intégral et bibtex

ref_biblio: Catuscia Palamidessi, Frank D. Valencia. Languages for Concurrency. Bulletin- European Association for Theoretical Computer Science, European Association for Theoretical Computer Science; 1999, 2006, 90, pp.155-171. ⟨inria-00201082⟩
Accès au texte intégral et bibtex

2005

ref_biblio: Catuscia Palamidessi, Oltea Mihaela Herescu. A randomized encoding of the pi-calculus with mixed choice. Theoretical Computer Science, Elsevier, 2005, 335 (2-3), pp.373-404. ⟨10.1016/j.tcs.2004.11.020⟩. ⟨inria-00201105⟩
Accès au texte intégral et bibtex

ref_biblio: Catuscia Palamidessi, Frank D. Valencia. Recursion vs Replication in Process Calculi: Expressiveness. Bulletin- European Association for Theoretical Computer Science, European Association for Theoretical Computer Science; 1999, 2005, 87, pp.105-125. ⟨inria-00201158⟩
Accès au texte intégral et bibtex

2003

ref_biblio: Catuscia Palamidessi. Comparing the Expressive Power of the Synchronous and the Asynchronous pi-calculi. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2003, 13 (5), pp.685-719. ⟨10.1017/S0960129503004043⟩. ⟨inria-00201104⟩
Accès au texte intégral et bibtex

Conference papers

2022

ref_biblio: Carlos Pinzón, Catuscia Palamidessi, Pablo Piantanida, Frank Valencia. On the Impossibility of non-Trivial Accuracy in Presence of Fairness Constraints. 36th AAAI Conference on Artificial Intelligence, Feb 2022, Vancouver / Virtual, Canada. ⟨hal-03452324⟩
Accès au texte intégral et bibtex

2021

ref_biblio: Mário S. Alvim, Bernardo Amorim, Sophia Knight, Santiago Quintero, Frank Valencia. A Multi-agent Model for Polarization Under Confirmation Bias in Social Networks. FORTE 2021 - 41st International Conference on Formal Techniques for Distributed Objects, Components, and Systems, Jun 2021, Valletta, Malta. ⟨hal-03095987⟩
Accès au texte intégral et bibtex

ref_biblio: Nathalie Bertrand, Luca de Alfaro, Robert J van Glabbeek, Catuscia Palamidessi, Nobuko Yoshida. CONCUR Test-Of-Time Award 2021. Concur 2021 - International Conference on Concurrency Theory, Aug 2021, Paris, France. pp.1-3. ⟨hal-03480255⟩
Accès au texte intégral et bibtex

ref_biblio: Sayan Biswas, Kangsoo Jung, Catuscia Palamidessi. An Incentive Mechanism for Trading Personal Data in Data Markets. International Colloquium on Theoretical Aspects of Computing 2021, Sep 2021, Nur-Sultan, Kazakhstan. pp.197-213, ⟨10.1007/978-3-030-85315-0_12⟩. ⟨hal-03589835⟩
Accès au bibtex

ref_biblio: Natasha Fernandes, Yusuke Kawamoto, Takao Murakami. Locality Sensitive Hashing with Extended Differential Privacy. ESORICS 2021 - 26th European Symposium on Research in Computer Security, Oct 2021, Darmstadt / Virtual, Germany. pp.563--583, ⟨10.1007/978-3-030-88428-4_28⟩. ⟨hal-03319774⟩
Accès au texte intégral et bibtex

ref_biblio: Federica Granese, Marco Romanelli, Daniele Gorla, Catuscia Palamidessi, Pablo Piantanida. DOCTOR: A Simple Method for Detecting Misclassification Errors. Advances in Neural Information Processing Systems (NeurIPS), 2021, Virtual event, United States. ⟨hal-03624023⟩
Accès au texte intégral et bibtex

ref_biblio: Abhishek Kumar Mishra, Aline Carneiro Viana, Nadjib Achir, Catuscia Palamidessi. Public Wireless Packets Anonymously Hurt You. IEEE LCN 2021 (Doctoral-track - Promising ideas), Oct 2021, Edmonton / Virtual, Canada. ⟨10.1109/LCN52139.2021.9524956⟩. ⟨hal-03298339v2⟩
Accès au texte intégral et bibtex

ref_biblio: Santiago Quintero, Sergio Ramírez, Camilo Rueda, Frank D. Valencia. Computing Distributed Knowledge as the Greatest Lower Bound of Knowledge. RAMICS 2021 - Relational and Algebraic Methods in Computer Science, Nov 2021, Marseille, France. pp.413-432. ⟨hal-02422624v2⟩
Accès au texte intégral et bibtex

2020

ref_biblio: Ehab Elsalamouny, Catuscia Palamidessi. Full Convergence of the Iterative Bayesian Update and Applications to Mechanisms for Privacy Protection. EuroS&P 2020 - 5th IEEE European Symposium on Security and Privacy, Sep 2020, Genova, Italy. pp.490-507. ⟨hal-03091504⟩
Accès au bibtex

ref_biblio: Catuscia Palamidessi, Marco Romanelli. Modern Applications of Game-Theoretic Principles. CONCUR 2020 - 31st International Conference on Concurrency Theory, Sep 2020, Vienne / Virtual, Austria. pp.4:1-4:9, ⟨10.4230/LIPIcs.CONCUR.2020.4⟩. ⟨hal-03091743⟩
Accès au texte intégral et bibtex

ref_biblio: Marco Romanelli, Konstantinos Chatzikokolakis, Catuscia Palamidessi, Pablo Piantanida. Estimating g-Leakage via Machine Learning. CCS '20 - 2020 ACM SIGSAC Conference on Computer and Communications Security, Nov 2020, Online, United States. pp.697-716. ⟨hal-03091469⟩
Accès au bibtex

ref_biblio: Marco Romanelli, Konstantinos Chatzikokolakis, Catuscia Palamidessi. Optimal Obfuscation Mechanisms via Machine Learning. CSF 2020 - 33rd IEEE Computer Security Foundations Symposium, Jun 2020, Online, United States. pp.153-168. ⟨hal-03091514⟩
Accès au bibtex

2019

ref_biblio: Konstantinos Chatzikokolakis, Natasha Fernandes, Catuscia Palamidessi. Comparing systems: max-case refinement orders and application to differential privacy. CSF 2019 - 32nd IEEE Computer Security Foundations Symposium, Jun 2019, Hoboken, United States. pp.442--457, ⟨10.1109/CSF.2019.00037⟩. ⟨hal-02126848⟩
Accès au texte intégral et bibtex

ref_biblio: Giovanni Cherubin, Konstantinos Chatzikokolakis, Catuscia Palamidessi. F-BLEAU: Fast Black-Box Leakage Estimation. S&P 2019 - 40th IEEE Symposium on Security and Privacy, May 2019, San Francisco, United States. pp.835-852, ⟨10.1109/SP.2019.00073⟩. ⟨hal-02422945⟩
Accès au bibtex

ref_biblio: Adriano Di Luzio, Aline Carneiro Viana, Konstantinos Chatzikokolakis, Georgi Dikov, Catuscia Palamidessi, et al.. Catch Me If You Can: How Geo-indistinguishability Affects Utility in Mobility-based Geographic Datasets. LocalRec2019 workshop, jointly with ACM SIGSPATIAL 2019, Nov 2019, Chicago, United States. pp.1-10, ⟨10.1145/3356994.3365498⟩. ⟨hal-02423337⟩
Accès au texte intégral et bibtex

ref_biblio: Daniele Gorla, Federica Granese, Catuscia Palamidessi. Enhanced Models for Privacy and Utility in Continuous-Time Diffusion Networks. ICTAC 2019 - 16th International Colloquium on Theoretical Aspects of Computing, Oct 2019, Hammamet, Tunisia. pp.313-331, ⟨10.1007/978-3-030-32505-3_18⟩. ⟨hal-02424329⟩
Accès au texte intégral et bibtex

ref_biblio: Michell Guzmán, Sophia Knight, Santiago Quintero, Sergio Ramírez, Camilo Rueda, et al.. Reasoning about Distributed Knowledge of Groups with Infinitely Many Agents. CONCUR 2019 - 30th International Conference on Concurrency Theory, Aug 2019, Amsterdam, Netherlands. pp.1-29, ⟨10.4230/LIPIcs.CONCUR.2019.29⟩. ⟨hal-02172415v2⟩
Accès au texte intégral et bibtex

ref_biblio: Ali Kassem, Gergely Acs, Claude Castelluccia, Catuscia Palamidessi. Differential Inference Testing: A Practical Approach to Evaluate Sanitizations of Datasets. SPW 2019 - 40th IEEE Symposium on Security and Privacy Workshops, May 2019, San Francisco, United States. pp.72-79, ⟨10.1109/SPW.2019.00024⟩. ⟨hal-02422992⟩
Accès au texte intégral et bibtex

2018

ref_biblio: Mário S. Alvim, Konstantinos Chatzikokolakis, Catuscia Palamidessi, Anna Pazii. Metric-based local differential privacy for statistical applications. 31st Computer Security Foundations Symposium (CSF 2018), Jul 2018, Oxford, United Kingdom. pp.262-267. ⟨hal-01966869⟩
Accès au texte intégral et bibtex

ref_biblio: Mário S. Alvim, Konstantinos Chatzikokolakis, Yusuke Kawamoto, Catuscia Palamidessi. Leakage and Protocol Composition in a Game-Theoretic Perspective. 7th International Conference on Principles of Security and Trust (POST 2018), Apr 2018, Thessaloniki, Greece. pp.134-159. ⟨hal-01966871⟩
Accès au texte intégral et bibtex

ref_biblio: Valentina Castiglioni. Trace and Testing Metrics on Nondeterministic Probabilistic Processes. Proceedings Combined 25th International Workshop on Expressiveness in Concurrency and 15th Workshop on Structural Operational Semantics and 15th Workshop on Structural Operational Semantics, (EXPRESS/SOS) 2018, Sep 2018, Beijing, China. pp.19-36, ⟨10.4204/EPTCS.276.4⟩. ⟨hal-01966950⟩
Accès au bibtex

ref_biblio: Valentina Castiglioni, Konstantinos Chatzikokolakis, Catuscia Palamidessi. A Logical Characterization of Differential Privacy via Behavioral Metrics. Formal Aspects of Component Software (FACS 2018), Oct 2018, Pohang, South Korea. pp.75-96, ⟨10.1007/978-3-030-02146-7_4⟩. ⟨hal-01966870⟩
Accès au texte intégral et bibtex

ref_biblio: Konstantinos Chatzikokolakis. On the Additive Capacity Problem for Quantitative Information Flow. 15th International Conference on Quantitative Evaluation of SysTems (QEST 2018), Sep 2018, Beijing, China. pp.1-19. ⟨hal-01845330⟩
Accès au texte intégral et bibtex

ref_biblio: Lefki Kacem, Catuscia Palamidessi. Geometric Noise for Locally Private Counting Queries. Proceedings of the 13th Workshop on Programming Languages and Analysis for Security (PLAS 2018), 2018, Toronto, Canada. pp.13-16, ⟨10.1145/3264820.3264827⟩. ⟨hal-01966872⟩
Accès au texte intégral et bibtex

ref_biblio: Tomi Kinnunen, Kong Aik Lee, Héctor Delgado, Nicholas Evans, Massimiliano Todisco, et al.. t-DCF: a Detection Cost Function for the Tandem Assessment of Spoofing Countermeasures and Automatic Speaker Verification. Speaker Odyssey 2018 The Speaker and Language Recognition Workshop, Jun 2018, Les Sables d’Olonne, France. ⟨hal-01880306⟩
Accès au texte intégral et bibtex

ref_biblio: Catuscia Palamidessi, Marco Romanelli. Feature selection with Rényi min-entropy. Artificial Neural Networks in Pattern Recognition - 8th IAPR TC3 Workshop (ANNPR 2018), Sep 2018, Siena, Italy. pp.226-239. ⟨hal-01830177v2⟩
Accès au texte intégral et bibtex

ref_biblio: Sergio Ramírez, Miguel Romero, Camilo Rocha, Frank D. Valencia. Real-time Rewriting Logic Semantics for Spatial Concurrent Constraint Programming. Rewriting Logic and Its Applications - 12th International Workshop, Jun 2018, Thessaloniki, Greece. pp.226--244. ⟨hal-01934953⟩
Accès au texte intégral et bibtex

2017

ref_biblio: Mário S. Alvim, Konstantinos Chatzikokolakis, Yusuke Kawamoto, Catuscia Palamidessi. Information Leakage Games. Decision and Game Theory for Security - 8th International Conference, Oct 2017, Vienna, Austria. pp.437-457, ⟨10.1007/978-3-319-68711-7_23⟩. ⟨hal-01678950⟩
Accès au bibtex

ref_biblio: Konstantinos Chatzikokolakis, Serge Haddad, Ali Kassem, Catuscia Palamidessi. Trading Optimality for Performance in Location Privacy. 11th EAI International Conference on Performance Evaluation Methodologies and Tools, Dec 2017, Venice, Italy. ⟨hal-01678256⟩
Accès au texte intégral et bibtex

ref_biblio: Stefan Haar, Salim Perchy, Frank Valencia. D-SPACES: Implementing Declarative Semantics for Spatially Structured Information. 11th International Conference on Semantic Computing , IEEE, Jan 2017, San Diego, California, United States. ⟨hal-01328189v4⟩
Accès au texte intégral et bibtex

2016

ref_biblio: Mário S. Alvim, Konstantinos Chatzikokolakis, Annabelle Mciver, Carroll Morgan, Catuscia Palamidessi, et al.. Axioms for Information Leakage. 29th Computer Security Foundations Symposium (CSF 2016), IEEE, Jun 2016, Lisbon, Portugal. pp.16. ⟨hal-01330414⟩
Accès au texte intégral et bibtex

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi, Valeria Vignudelli. Up-To Techniques for Generalized Bisimulation Metrics. 27th International Conference on Concurrency Theory (CONCUR 2016), Aug 2016, Québec City, Canada. pp.35:1--35:14, ⟨10.4230/LIPIcs.CONCUR.2016.35⟩. ⟨hal-01335234⟩
Accès au texte intégral et bibtex

ref_biblio: Moreno Falaschi, Maurizio Gabbrielli, Carlos Olarte, Catuscia Palamidessi. Slicing Concurrent Constraint Programs. Pre-proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016), 2016, Edinburgh, United Kingdom. ⟨hal-01421407⟩
Accès au bibtex

ref_biblio: Michell Guzmán, Frank D Valencia. On the Expressiveness of Spatial Constraint Systems . ICLP 2016 - Proceedings of the Technical Communications of the 32nd International Conference on Logic Programming , John Gallagher; Germán Vidal, Oct 2016, New York, United States. pp.16:1 - 16:12, ⟨10.4230/OASIcs.ICLP.2016.16⟩. ⟨hal-01418166⟩
Accès au texte intégral et bibtex

ref_biblio: Michell Guzman, Salim Perchy, Camilo Rueda, Frank Valencia. Deriving Inverse Operators for Modal Logic. Theoretical Aspects of Computing – ICTAC 2016, Oct 2016, Taipei, Taiwan. pp.214-232, ⟨10.1007/978-3-319-46750-4_13⟩. ⟨hal-01328188v2⟩
Accès au texte intégral et bibtex

2015

ref_biblio: Paolo Baldan, Filippo Bonchi, Fabio Gadducci, Valentina Monreale. Asynchronous Traces and Open Petri Nets. Programming Languages with Applications to Biology and Security - Essays Dedicated to Pierpaolo Degano on the Occasion of His 65th Birthday, Jun 2015, Pisa, Italy. pp.86-102, ⟨10.1007/978-3-319-25527-9_8⟩. ⟨hal-01285297⟩
Accès au bibtex

ref_biblio: Paolo Baldan, Filippo Bonchi, Kerstan Henning, Barbara König. Towards Trace Metrics via Functor Lifting. 6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015, Jun 2015, Nijmegen, Netherlands. ⟨10.4230/LIPIcs.CALCO.2015.35⟩. ⟨hal-01285298⟩
Accès au bibtex

ref_biblio: Filippo Bonchi, Fabio Zanasi, Pawel Sobocinski. Full Abstraction for Signal Flow Graphs. Proceedings of the 42nd Annual Symposium on Principles of Programming Languages, 2015,, Jan 2015, Mumbai, India. ⟨10.1145/2676726.2676993⟩. ⟨hal-01178437v2⟩
Accès au bibtex

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi, Marco Stronati. Geo-indistinguishability: A Principled Approach to Location Privacy. ICDCIT 2015 - Proceedings of the 11th International Conference on Distributed Computing and Internet Technology, Feb 2015, Bhubaneswar, India. pp.49-72, ⟨10.1007/978-3-319-14977-6_4⟩. ⟨hal-01114241⟩
Accès au texte intégral et bibtex

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi, Marco Stronati. Location Privacy via Geo-Indistinguishability. Proceedings of the 12th International Colloquium on Theoretical Aspects of Computing (ICTAC), 2015, Cali, Colombia. pp.28-38. ⟨hal-01271276⟩
Accès au bibtex

ref_biblio: Fabio Gadducci, Francesco Santini, Luis Pino, Frank Valencia. A Labelled Semantics for Soft Concurrent Constraint Programming. 17th International Conference on Coordination Languages and Models (COORDINATION), Jun 2015, Grenoble, France. pp.133-149, ⟨10.1007/978-3-319-19282-6_9⟩. ⟨hal-01149227⟩
Accès au texte intégral et bibtex

ref_biblio: Stefan Haar, Salim Perchy, Camilo Rueda, Frank Valencia. An Algebraic View of Space/Belief and Extrusion/Utterance for Concurrency/Epistemic Logic. 17th International Symposium on Principles and Practice of Declarative Programming (PPDP 2015), Jul 2015, Siena, Italy. pp.161-172, ⟨10.1145/2790449.2790520⟩. ⟨hal-01256984⟩
Accès au texte intégral et bibtex

ref_biblio: Yusuke Kawamoto, Thomas Given-Wilson. Quantitative Information Flow for Scheduler-Dependent Systems. The 13th International Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL 2015), Apr 2015, London, United Kingdom. ⟨hal-01114778⟩
Accès au texte intégral et bibtex

ref_biblio: Catuscia Palamidessi. Quantitative Approaches to the Protection of Private Information: State of the Art and Some Open Challenges. Proceedings of the 4th International Conference on Principles of Security and Trust (POST), 2015, London, United Kingdom. pp.3-7. ⟨hal-01271518⟩
Accès au bibtex

ref_biblio: Salim Perchy, Frank Valencia. Opinions and Beliefs as constraint system operators. Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015), Aug 2015, Cork, Ireland. pp.1. ⟨hal-01257098⟩
Accès au bibtex

2014

ref_biblio: Mário S. Alvim, Konstantinos Chatzikokolakis, Annabelle Mciver, Carroll Morgan, Catuscia Palamidessi, et al.. Additive and multiplicative notions of leakage, and their capacities. 27th Computer Security Foundations Symposium (CSF 2014), Jul 2014, Vienna, Austria. pp.308--322, ⟨10.1109/CSF.2014.29⟩. ⟨hal-00989462⟩
Accès au texte intégral et bibtex

ref_biblio: Nicolás E. Bordenabe, Konstantinos Chatzikokolakis, Catuscia Palamidessi. Optimal Geo-Indistinguishable Mechanisms for Location Privacy. CCS - 21st ACM Conference on Computer and Communications Security, Gail-Joon Ahn, Nov 2014, Scottsdale, Arizona, United States. pp.251-262, ⟨10.1145/2660267.2660345⟩. ⟨hal-00950479⟩
Accès au bibtex

ref_biblio: Konstantinos Chatzikokolakis, Daniel Gebler, Catuscia Palamidessi, Lili Xu. Generalized bisimulation metrics. CONCUR - 25th Conference on Concurrency Theory, Sep 2014, Rome, Italy. pp.32-46, ⟨10.1007/978-3-662-44584-6_4⟩. ⟨hal-01011471⟩
Accès au texte intégral et bibtex

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi, Marco Stronati. A Predictive Differentially-Private Mechanism for Mobility Traces. PETS 2014 - 14th Privacy Enhancing Technologies Symposium, Jul 2014, Amsterdam, Netherlands. pp.21-41, ⟨10.1007/978-3-319-08506-7_2⟩. ⟨hal-01011260⟩
Accès au bibtex

ref_biblio: Tom Chothia, Yusuke Kawamoto, Chris Novakovic. LeakWatch: Estimating Information Leakage from Java Programs. 19th European Symposium on Research in Computer Security (ESORICS 2014), Sep 2014, Wroclaw, Poland. pp.219-236, ⟨10.1007/978-3-319-11212-1_13⟩. ⟨hal-01097603⟩
Accès au texte intégral et bibtex

ref_biblio: Norman Ferns, Sophia Knight, Doina Precup. Bisimulation for Markov Decision Processes through Families of Functional Expressions. Horizons of the Mind. A Tribute to Prakash Panangaden (for his 60th birthday), Franck van Breugel; Elham Kashefi; Castucia Palamidessi; Jan Rutten, May 2014, Oxford, United Kingdom. pp.319-342, ⟨10.1007/978-3-319-06880-0_17⟩. ⟨hal-01098566⟩
Accès au bibtex

ref_biblio: Thomas Given-Wilson. On the Expressiveness of Intensional Communication. Combined 21th International Workshop on Expressiveness in Concurrency and 11th Workshop on Structural Operational Semantics, Sep 2014, Rome, Italy. pp.30-46, ⟨10.4204/EPTCS.160.4⟩. ⟨hal-01026301v2⟩
Accès au texte intégral et bibtex

ref_biblio: Thomas Given-Wilson. An Intensional Concurrent Faithful Encoding of Turing Machines. 7th Interaction and Concurrency Experience (ICE 2014), Jun 2014, Berlin, Germany. pp.21-37, ⟨10.4204/EPTCS.166.4⟩. ⟨hal-00987594v3⟩
Accès au texte intégral et bibtex

ref_biblio: Thomas Given-Wilson. Expressiveness via Intensionality and Concurrency. ICTAC 2014 - 11th International Colloquium on Theoretical Aspects of Computing, Sep 2014, Bucharest, Romania. pp.206-223, ⟨10.1007/978-3-319-10882-7_13⟩. ⟨hal-00999082⟩
Accès au texte intégral et bibtex

ref_biblio: Yusuke Kawamoto, Konstantinos Chatzikokolakis, Catuscia Palamidessi. Compositionality Results for Quantitative Information Flow. Proceedings of the 11th International Conference on Quantitative Evaluation of SysTems (QEST 2014), Sep 2014, Florence, Italy. pp.368-383, ⟨10.1007/978-3-319-10696-0⟩. ⟨hal-01006381v2⟩
Accès au texte intégral et bibtex

ref_biblio: Luis Fernando Pino Duque, Filippo Bonchi, Frank D. Valencia. A Behavioral Congruence for Concurrent Constraint Programming with Non-deterministic Choice. ICTAC 2014 - 11th International Colloquium on Theoretical Aspects of Computing, Sep 2014, Bucarest, Romania. pp.351-368, ⟨10.1007/978-3-319-10882-7_21⟩. ⟨hal-01006382v2⟩
Accès au texte intégral et bibtex

ref_biblio: Lili Xu, Konstantinos Chatzikokolakis, Huimin Lin. Metrics for Differential Privacy in Concurrent Systems. 34th Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2014, Berlin, Germany. pp.199-215, ⟨10.1007/978-3-662-43613-4_13⟩. ⟨hal-00879140v2⟩
Accès au texte intégral et bibtex

2013

ref_biblio: Miguel E. Andrés, Nicolás E. Bordenabe, Konstantinos Chatzikokolakis, Catuscia Palamidessi. Geo-Indistinguishability: Differential Privacy for Location-Based Systems. 20th ACM Conference on Computer and Communications Security, ACM, Nov 2013, Berlin, Germany. pp.901-914, ⟨10.1145/2508859.2516735⟩. ⟨hal-00766821⟩
Accès au bibtex

ref_biblio: Konstantinos Chatzikokolakis, Miguel E. Andrés, Nicolás E. Bordenabe, Catuscia Palamidessi. Broadening the Scope of Differential Privacy Using Metrics. The 13th Privacy Enhancing Technologies Symposium, Jul 2013, Bloomington, Indiana, United States. pp.82-102, ⟨10.1007/978-3-642-39077-7⟩. ⟨hal-00767210⟩
Accès au texte intégral et bibtex

ref_biblio: Ehab Elsalamouny, Konstantinos Chatzikokolakis, Catuscia Palamidessi. A differentially private mechanism of optimal utility for a region of priors. 2nd Conference on Principles of Security and Trust (POST 2013), Mar 2013, Rome, Italy. pp.41-62, ⟨10.1007/978-3-642-36830-1_3⟩. ⟨hal-00760735v2⟩
Accès au texte intégral et bibtex

ref_biblio: Ivan Gazeau, Dale Miller, Catuscia Palamidessi. Preserving differential privacy under finite-precision semantics. QAPL - 11th International Workshop on Quantitative Aspects of Programming Languages and Systems, Mar 2013, Rome, Italy. pp.1-18, ⟨10.4204/EPTCS.117.1⟩. ⟨hal-00780774v2⟩
Accès au texte intégral et bibtex

ref_biblio: Catuscia Palamidessi. Quantitative Approaches to Information Protection. Logic, Language, Information, and Computation - 20th International Workshop (WoLLIC 2013), Aug 2013, Darmstadt, Germany. pp.31-32, ⟨10.1007/978-3-642-39992-3_5⟩. ⟨hal-00945678⟩
Accès au bibtex

ref_biblio: Luis Pino, Filippo Bonchi, Frank D. Valencia. Efficient computation of program equivalence for confluent concurrent constraint programming. PPDP 2013 - 15th International Symposium on Principles and Practice of Declarative Programming, Sep 2013, Madrid, Spain. pp.263-274, ⟨10.1145/2505879.2505902⟩. ⟨hal-00909394⟩
Accès au bibtex

2012

ref_biblio: Mário S. Alvim, Konstantinos Chatzikokolakis, Catuscia Palamidessi, Geoffrey Smith. Measuring Information Leakage using Generalized Gain Functions. Computer Security Foundations, 2012, Cambridge MA, United States. pp.265-279, ⟨10.1109/CSF.2012.26⟩. ⟨hal-00734044⟩
Accès au texte intégral et bibtex

ref_biblio: Andrés Aristizábal, Filippo Bonchi, Luis Pino, Frank D. Valencia. Reducing Weak to Strong Bisimilarity in CCP. Fifth Interaction and Concurrency Experience, Jun 2012, Stockholm, Sweden. pp.2-16, ⟨10.4204/EPTCS.104⟩. ⟨hal-00761611⟩
Accès au texte intégral et bibtex

ref_biblio: Andrés Aristizábal, Filippo Bonchi, Luis Pino, Frank D. Valencia. Partition Refinement for Bisimilarity in CCP. 27th ACM Symposium On Applied Computing, Mar 2012, Trento, Italy. pp.88-93. ⟨hal-00641408v3⟩
Accès au texte intégral et bibtex

ref_biblio: Andres Felipe Barco Santa, Sophia Knight, Frank D. Valencia. K-Stores: A Spatial and Epistemic Concurrent Constraint Interpreter. 21st Workshop on Functional and Constraint Logic Programming (WFLP2012), May 2012, Nagoya, Japan. ⟨hal-00761679⟩
Accès au texte intégral et bibtex

ref_biblio: Mayla Brusó, Konstantinos Chatzikokolakis, Sandro Etalle, Jerry den Hartog. Linking Unlinkability. TGC 2012 - 7th International Symposium on Trustworthy Global Computing, Sep 2012, Newcastle upon Tyne, United Kingdom. pp.129-144, ⟨10.1007/978-3-642-41157-1_9⟩. ⟨hal-00760150⟩
Accès au texte intégral et bibtex

ref_biblio: Michele Bugliesi, Lucia Gallina, Andrea Marin, Sabina Rossi, Sardaouna Hamadou. Interference-Sensitive Preorders for MANETs. Ninth International Conference on Quantitative Evaluation of Systems, QEST 2012, Sep 2012, London, United Kingdom. pp.189-198. ⟨hal-00760455v2⟩
Accès au texte intégral et bibtex

ref_biblio: Ivan Gazeau, Dale Miller, Catuscia Palamidessi. A non-local method for robustness analysis of floating point programs. QAPL - Tenth Workshop on Quantitative Aspects of Programming Languages, Mar 2012, Tallinn, Estonia. pp.63-76, ⟨10.4204/EPTCS.85.5⟩. ⟨hal-00665995v3⟩
Accès au texte intégral et bibtex

ref_biblio: Marco Giunti, Catuscia Palamidessi, Frank D. Valencia. Hide and New in the Pi-Calculus. Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics (EXPRESS/SOS 2012), Sep 2012, New Castle upon Tyne, United Kingdom. pp.65-80, ⟨10.4204/EPTCS.89⟩. ⟨hal-00761118⟩
Accès au texte intégral et bibtex

ref_biblio: Sophia Knight, Catuscia Palamidessi, Prakash Panangaden, Frank D. Valencia. Spatial and Epistemic Modalities in Constraint-Based Process Calculi. CONCUR 2012 - 23rd International Conference on Concurrency Theory, Sep 2012, Newcastle upon Tyne, United Kingdom. pp.317-332, ⟨10.1007/978-3-642-32940-1⟩. ⟨hal-00761116⟩
Accès au texte intégral et bibtex

ref_biblio: Sophia Knight, Radu Mardare, Prakash Panangaden. Combining Epistemic Logic and Hennessy-Milner Logic. Logic and Program Semantics - Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday, Apr 2012, Ithaca, United States. pp.219-243, ⟨10.1007/978-3-642-29485-3_14⟩. ⟨hal-00760967⟩
Accès au texte intégral et bibtex

ref_biblio: Catuscia Palamidessi, Marco Stronati. Differential privacy for relational algebra: improving the sensitivity bounds via constraint systems. QAPL - Tenth Workshop on Quantitative Aspects of Programming Languages, Apr 2012, Tallin, Estonia. pp.92-105, ⟨10.4204/EPTCS.85.7⟩. ⟨hal-00760688⟩
Accès au texte intégral et bibtex

ref_biblio: Lili Xu. Modular Reasoning about Differential Privacy in a Probabilistic Process Calculus. 7th International Symposium on Trustworthy Global Computing (TGC), Sep 2012, Newcastle upon Tyne, United Kingdom. pp.198-212. ⟨hal-00691284v3⟩
Accès au texte intégral et bibtex

ref_biblio: Mu Yang, Vladimiro Sassone, Sardaouna Hamadou. A Game-Theoretic Analysis of Cooperation in Anonymity Networks. Principles of Security and Trust - First International Conference, POST 2012, Mar 2012, Tallinn, Estonia. pp.269-289. ⟨hal-00760445v2⟩
Accès au texte intégral et bibtex

2011

ref_biblio: Mário S. Alvim, Miguel E. Andrés, Konstantinos Chatzikokolakis, Pierpaolo Degano, Catuscia Palamidessi. Differential Privacy: on the trade-off between Utility and Information Leakage. The 8th International Workshop on Formal Aspects of Security & Trust (FAST), Sep 2011, Leuven, Belgium. pp.39--54, ⟨10.1007/978-3-642-29420-4_3⟩. ⟨inria-00580122v5⟩
Accès au texte intégral et bibtex

ref_biblio: Mário S. Alvim, Miguel E. Andrés, Konstantinos Chatzikokolakis, Catuscia Palamidessi. On the relation between Differential Privacy and Quantitative Information Flow. 38th International Colloquium on Automata, Languages and Programming - ICALP 2011, 2011, Zurich, Switzerland. pp.60-76, ⟨10.1007/978-3-642-22012-8_4⟩. ⟨inria-00627937⟩
Accès au texte intégral et bibtex

ref_biblio: Andrés Aristizábal, Filippo Bonchi, Catuscia Palamidessi, Luis Pino, Frank D. Valencia. Deriving Labels and Bisimilarity for Concurrent Constraint Programming. FOSSACS 2011 : 14th International Conference on Foundations of Software Science and Computational Structures, Mar 2011, Saarbrücken, Germany. pp.138-152, ⟨10.1007/ISBN978-3-642-19804-5⟩. ⟨hal-00546722⟩
Accès au texte intégral et bibtex

ref_biblio: David Baelde, Romain Beauxis, Samuel Mimram. Liquidsoap: a High-Level Programming Language for Multimedia Streaming. SOFSEM 2011: Theory and Practice of Computer Science, Jan 2011, Nový Smokovec, Slovakia. pp.99-110, ⟨10.1007/978-3-642-18381-2_8⟩. ⟨inria-00585728⟩
Accès au texte intégral et bibtex

ref_biblio: Romain Beauxis, Samuel Mimram. A Non-Standard Semantics for Kahn Networks in Continuous Time. Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL, Sep 2011, Bergen, Norway. pp.35--50, ⟨10.4230/LIPIcs.CSL.2011.35⟩. ⟨inria-00616968⟩
Accès au texte intégral et bibtex

ref_biblio: Lucia Gallina, Sardaouna Hamadou, Andrea Marin, Sabina Rossi. A Probabilistic Energy-Aware Model for Mobile Ad-Hoc Networks. Analytical and Stochastic Modeling Techniques and Applications (ASMTA), Jun 2011, Venice, Italy. pp.316-330, ⟨10.1007/978-3-642-21713-5_23⟩. ⟨hal-00799156⟩
Accès au texte intégral et bibtex

ref_biblio: Lucia Gallina, Sardaouna Hamadou, Andrea Marin, Sabina Rossi. A Framework for Throughput and Energy Efficiency in Mobile ad Hoc Networks. IFIP Wireless Days Conference, Oct 2011, Niagara Falls, ON, Canada. pp.1-6. ⟨hal-00799168⟩
Accès au texte intégral et bibtex

ref_biblio: Marco Giunti. A type checking algorithm for qualified session types. 7th International Workshop on Automated Specification and Verification of Web Systems, Jun 2011, Reykjavik, Iceland. ⟨10.4204/EPTCS.61.7⟩. ⟨hal-00644061⟩
Accès au texte intégral et bibtex

ref_biblio: Diana Hermith, Carlos Olarte, Camilo Rueda, Frank D. Valencia. Modeling Cellular Signaling Systems: An Abstraction-Refinement Approach. PACBB 2011 - 5th International Conference on Practical Applications of Computational Biology & Bioinformatics, Apr 2011, Salamanca, Spain. pp.321-328, ⟨10.1007/ISBN978-3-642-19913-4⟩. ⟨hal-00641433⟩
Accès au texte intégral et bibtex

2010

ref_biblio: Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi. Entropy and Attack Models in Information Flow. 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. pp.53-54, ⟨10.1007/978-3-642-15240-5_4⟩. ⟨hal-00548212⟩
Accès au texte intégral et bibtex

ref_biblio: Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi. Information Flow in Interactive Systems. 21th International Conference on Concurrency Theory (CONCUR 2010), Aug 2010, Paris, France. pp.102-116, ⟨10.1007/978-3-642-15375-4_8⟩. ⟨inria-00479672v3⟩
Accès au texte intégral et bibtex

ref_biblio: Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum. Safe Equivalences for Security Properties. 6th IFIP International Conference on Theoretical Computer Science (TCS 2010), Sep 2010, Brisbane, Australia. pp.55-70, ⟨10.1007/978-3-642-15240-5_5⟩. ⟨inria-00479674v2⟩
Accès au texte intégral et bibtex

ref_biblio: Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi. Probabilistic Information Flow. 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010), Jul 2010, Edinburgh, United Kingdom. pp.314-321, ⟨10.1109/LICS.2010.53⟩. ⟨hal-00548200⟩
Accès au texte intégral et bibtex

ref_biblio: Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum, Ana Sokolova. Information Hiding in Probabilistic Concurrent Systems. 7th IEEE International Conference on Quantitative Evaluation of SysTems (QEST 2010), Sep 2010, Williamsburg, VA, United States. pp.17-26, ⟨10.1109/QEST.2010.11⟩. ⟨hal-00548187⟩
Accès au texte intégral et bibtex

ref_biblio: Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum, Geoffrey Smith. Computing the Leakage of Information-Hiding Systems. 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2010), Mar 2010, Paphos, Cyprus. pp.373-389, ⟨10.1007/978-3-642-12002-2_32⟩. ⟨hal-00445445v2⟩
Accès au texte intégral et bibtex

ref_biblio: Andrés Aristizábal. Bisimilarity in Concurrent Constraint Programming. 26th International Conference on Logic Programming, ICLP 2010, Jul 2010, Edinburgh, United Kingdom. pp.236-240. ⟨hal-00546857⟩
Accès au texte intégral et bibtex

ref_biblio: Davide Chiarugi, Moreno Falaschi, Carlos Olarte, Catuscia Palamidessi. Compositional modelling of signalling pathways in timed concurrent constraint programming. First ACM International Conference on Bioinformatics and Computational Biology (BCB '10)., Aug 2010, Niagara Falls, New York, United States. pp.414-417, ⟨10.1145/1854776.1854843⟩. ⟨hal-00548213⟩
Accès au texte intégral et bibtex

ref_biblio: Philippe Darondeau, Jérémy Dubreil, Hervé Marchand. Supervisory Control for Modal Specifications of Services. Workshop on Discrete Event Systems, WODES'10, Aug 2010, Berlin, Germany. pp.428-435. ⟨inria-00510013⟩
Accès au texte intégral et bibtex

ref_biblio: Sardaouna Hamadou, Vladimiro Sassone, Catuscia Palamidessi. Reconciling Belief and Vulnerability in Information Flow. 31st IEEE Symposium on Security and Privacy, May 2010, Berleley/Oakland, California, United States. pp.79-92, ⟨10.1109/SP.2010.13⟩. ⟨inria-00548007⟩
Accès au texte intégral et bibtex

ref_biblio: Catuscia Palamidessi, Mário S. Alvim, Miguel E. Andrés. Interactive Information Flow. Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security (ARSPA-WITS 2010), Mar 2010, Paphos, Cyprus. pp.111-111, ⟨10.1007/978-3-642-16074-5_8⟩. ⟨hal-00548211⟩
Accès au bibtex

ref_biblio: Catuscia Palamidessi. Compositionality of Secure Information Flow. 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), Jun 2010, Lac Beaufort, Québec City, Canada. pp.19-19, ⟨10.1007/978-3-642-13321-3_2⟩. ⟨hal-00548210⟩
Accès au bibtex

2009

ref_biblio: Jesus Aranda, Frank Valencia, Cristian Versari. On the Expressive Power of Restriction and Priorities in CCS with replication. Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, Mar 2009, York, UK, United Kingdom. ⟨10.1007/978-3-642-00596-1_18⟩. ⟨inria-00430531⟩
Accès au texte intégral et bibtex

ref_biblio: Jesus Aranda, Gérard Assayag, Carlos Olarte, Camilo Rueda, Toro Mauricio, et al.. An Overview of FORCES: An INRIA Project on Declarative Formalisms for Emergent Systems. ICLP 2009 - 25th International Conference on Logic Programming, Jul 2009, Pasadena, United States. pp.509-513, ⟨10.1007/978-3-642-02846-5⟩. ⟨inria-00426610⟩
Accès au texte intégral et bibtex

ref_biblio: Christelle Braun, Konstantinos Chatzikokolakis, Catuscia Palamidessi. Quantitative Notions of Leakage for One-try Attacks. Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics (MFPS 2009), May 2009, Oxford, United Kingdom. pp.75-91. ⟨inria-00424852⟩
Accès au texte intégral et bibtex

ref_biblio: Konstantinos Chatzikokolakis, Sophia Knight, Prakash Panangaden. Epistemic Strategies and Games on Concurrent Processes. SOFSEM 2009, Jan 2009, Špindlerův Mlýn, Czech Republic. pp.153-166. ⟨inria-00424854⟩
Accès au texte intégral et bibtex

ref_biblio: Moreno Falaschi, Carlos Olarte, Catuscia Palamidessi. A Framework for Abstract Interpretation of Timed Concurrent Constraint Programs. PPDP 2009 - ACM SIGPLAN 11th Conference on Principles and practice of declarative programming, Sep 2009, Coimbra, Portugal. pp.207-218, ⟨10.1145/1599410.1599436⟩. ⟨inria-00426608⟩
Accès au texte intégral et bibtex

ref_biblio: Sardaouna Hamadou, Catuscia Palamidessi, Vladimiro Sassone, Ehab Elsalamouny. Probable Innocence and Independent Knowledge. Formal Aspects of Security and Trust, Nov 2009, Eindhoven, Netherlands. pp.141-156, ⟨10.1007/978-3-642-12459-4_11⟩. ⟨inria-00424853v2⟩
Accès au texte intégral et bibtex

ref_biblio: Hugo Lopez, Carlos Olarte, Jorge Perez. Towards a Unified Framework for Declarative Structured Communications. 2nd PLACES 2009 - Second International Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, Mar 2009, York, United Kingdom. 15p. ⟨inria-00426609v2⟩
Accès au texte intégral et bibtex

ref_biblio: Carlos Olarte, Camilo Rueda. A Declarative Language for Dynamic Multimedia Interaction Systems. MCM 2009 - Second International Conference of the Society for Mathematics and Computation in Music, Jun 2009, New Haven, United States. ⟨10.1007/978-3-642-02394-1_20⟩. ⟨inria-00426607⟩
Accès au texte intégral et bibtex

ref_biblio: Angela Villota, Jesus Aranda, Diaz Juan Francisco. Modelando Sistemas de Membranas en ntcc. XXXV Latin American Informatics Conference, Sep 2009, Pelotas, Brazil. ⟨inria-00430537⟩
Accès au texte intégral et bibtex

2008

ref_biblio: Jesus Aranda, Perez Jorge, Camilo Rueda, Frank Valencia. Stochastic Behavior and Explicit Discrete Time in Concurrent Constraint Programmin. Logic Programming, Dec 2008, Udine, Italy. ⟨10.1007/978-3-540-89982-2_57⟩. ⟨inria-00430533⟩
Accès au texte intégral et bibtex

ref_biblio: Abhishek Bhowmick, Catuscia Palamidessi. Bounds on the leakage of the input's distribution in information-hiding protocols. Fourth Symposium on Trustworthy Global Computing (TGC), 2008, France. pp.36--51. ⟨hal-00444579⟩
Accès au texte intégral et bibtex

ref_biblio: Christelle Braun, Konstantinos Chatzikokolakis, Catuscia Palamidessi. Compositional Methods for Information-Hiding. Foundations of Software Science and Computation Structures (FOSSACS), 2008, Budapest, Hungary. ⟨10.1007/978-3-540-78499-9_31⟩. ⟨inria-00349227⟩
Accès au texte intégral et bibtex

ref_biblio: Carlos Olarte, Frank D. Valencia. The Expressivity of Universal Timed CCP: Undecidability of Monadic FLTL and Closure Operators for Security. 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, ACM, Jul 2008, Valencia, Spain. pp.8-19, ⟨10.1145/1389449.1389452⟩. ⟨inria-00349353⟩
Accès au texte intégral et bibtex

ref_biblio: Carlos Olarte, Frank D. Valencia. Universal Concurrent Constraint Programing: Symbolic Semantics and Applications to Security. 23rd Annual ACM Symposium on Applied Computing, ACM, Mar 2008, Fortaleza, Brazil. ⟨inria-00201497⟩
Accès au texte intégral et bibtex

2007

ref_biblio: Jesus Aranda, Cinzia Di Giusto, Mogens Nielsen, Frank Valencia. CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence. 5th Asian Symposium on Programming Languages and Systems (APLAS'07), Nov 2007, Singapore, Singapore. pp.383-398, ⟨10.1007/978-3-540-76637-7_26⟩. ⟨inria-00201547⟩
Accès au texte intégral et bibtex

ref_biblio: Romain Beauxis, Konstantinos Chatzikokolakis, Catuscia Palamidessi, Prakash Panangaden. Formal Approaches to Information-Hiding (Tutorial). Trustworthy Global Computing, Nov 2007, Sophia-Antipolis, France. pp.347-362, ⟨10.1007/978-3-540-78663-4_23⟩. ⟨inria-00261827⟩
Accès au texte intégral et bibtex

ref_biblio: Diletta Cacciagrano, Flavio Corradini, Jesus Aranda, Frank Valencia. Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus. 14th International Workshop on Expressiveness in Concurrency (EXPRESS'07), Sep 2007, Lisbon, Portugal. pp.58-71. ⟨inria-00201502⟩
Accès au texte intégral et bibtex

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi, Prakash Panangaden. Probability of Error in Information-Hiding Protocols. 20th IEEE Computer Security Foundations Symposium (CSF20), Jul 2007, Venice, Italy. pp.341-354, ⟨10.1109/CSF.2007.13⟩. ⟨inria-00200957⟩
Accès au texte intégral et bibtex

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi. Making Random Choices Invisible to the Scheduler. CONCUR'07, Sep 2007, Lisboa, Portugal. ⟨10.1007/978-3-540-74407-8_4⟩. ⟨inria-00200967⟩
Accès au texte intégral et bibtex

ref_biblio: Moreno Falaschi, Carlos Olarte, Catuscia Palamidessi, Frank D. Valencia. Declarative Diagnosis of Temporal Concurrent Constraint Programs. 23rd International Conference in Logic Programming (ICLP'07), Sep 2007, Porto, Portugal. pp.271--285, ⟨10.1007/978-3-540-74610-2_19⟩. ⟨inria-00201065⟩
Accès au texte intégral et bibtex

ref_biblio: Jean Goubault-Larrecq, Catuscia Palamidessi, Angelo Troina. A Probabilistic Applied Pi-Calculus. 5th Asian Symposium on Programming Languages and Systems (APLAS'07), Nov 2007, Singapore, Singapore. pp.175-190, ⟨10.1007/978-3-540-76637-7_12⟩. ⟨inria-00201070⟩
Accès au texte intégral et bibtex

ref_biblio: Gethin Norman, Catuscia Palamidessi, David Parker, Peng Wu. Model checking the probabilistic pi-calculus. 4th International Conference on the Quantitative Evaluation of SysTems (QEST), Sep 2007, Edinburgh, United Kingdom. pp.169-178, ⟨10.1109/QEST.2007.27⟩. ⟨inria-00201069⟩
Accès au texte intégral et bibtex

ref_biblio: Carlos Olarte, Catuscia Palamidessi, Frank D. Valencia. Universal Timed Concurrent Constraint Programming. 23rd International Conference in Logic Programming (ICLP'07), Sep 2007, Porto, Portugal. pp.464-465, ⟨10.1007/978-3-540-74610-2_47⟩. ⟨inria-00201066⟩
Accès au texte intégral et bibtex

ref_biblio: Peng Wu, Catuscia Palamidessi, Huimin Lin. Symbolic Bisimulation for Probabilistic Systems. 4th International Conference on the Quantitative Evaluation of SysTems (QEST), Sep 2007, Edinburgh, United Kingdom. pp.179-188, ⟨10.1109/QEST.2007.46⟩. ⟨inria-00201068⟩
Accès au texte intégral et bibtex

2006

ref_biblio: Jesus Aranda, Cinzia Di Giusto, Catuscia Palamidessi, Frank D. Valencia. Expressiveness of Recursion, Replication and Scope Mechanisms in Process Calculi. 5th International Symposium on Formal Methods for Components and Objects (FMCO'06), Nov 2006, Amsterdam, Netherlands. pp.185-206, ⟨10.1007/978-3-540-74792-5⟩. ⟨inria-00239497⟩
Accès au texte intégral et bibtex

ref_biblio: Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi. Fair Pi. 13th International Workshop on Expressiveness in Concurrency (EXPRESS'06), Aug 2006, Bonn, Germany. pp.3-26, ⟨10.1016/j.entcs.2007.04.010⟩. ⟨inria-00200937⟩
Accès au texte intégral et bibtex

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi, Prakash Panangaden. Anonymity Protocols as Noisy Channels. 2nd Symposium on Trustworthy Global Computing (TGC), Nov 2006, Lucca, Italy. pp.281-300, ⟨10.1007/978-3-540-75336-0_18⟩. ⟨inria-00201110⟩
Accès au texte intégral et bibtex

ref_biblio: Hugo A. López, Catuscia Palamidessi, Jorge Andrés Pérez, Camilo Rueda, Frank D. Valencia. A Declarative Framework for Security: Secure Concurrent Constraint Programming. 22nd International Conference on logic Programming (ICLP), Sandro Etalle and Miroslaw Truszczynski, Aug 2006, Seattle, United States. pp.449-450, ⟨10.1007/11799573_43⟩. ⟨inria-00201148⟩
Accès au texte intégral et bibtex

ref_biblio: Catuscia Palamidessi. Probabilistic and nondeterministic aspects of Anonymity. 21st Conference on the Mathematical Foundations of Programming Semantics (MFPS XXI), May 2006, Birmingham, United Kingdom. pp.33-42, ⟨10.1016/j.entcs.2005.11.050⟩. ⟨inria-00201106⟩
Accès au texte intégral et bibtex

ref_biblio: Catuscia Palamidessi, Vijay Saraswat, Frank D. Valencia, Bjorn Victor. On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus. Twenty First Annual IEEE Symposium on Logic in Computer Science (LICS), Aug 2006, Seattle, United States. pp.59-68, ⟨10.1109/LICS.2006.39⟩. ⟨inria-00201096⟩
Accès au texte intégral et bibtex

ref_biblio: Sylvain Pradalier, Catuscia Palamidessi. Expressiveness of probabilistic \pi-calculi. 4th International Workshop on Quantitative Aspects of Programming Languages (QAPL), Apr 2006, Vienna, Austria. ⟨10.1016/j.entcs.2006.07.015⟩. ⟨inria-00201088⟩
Accès au texte intégral et bibtex

2005

ref_biblio: Mohit Bhargava, Catuscia Palamidessi. Probabilistic Anonymity. CONCUR'05, Aug 2005, San Francisco, United States. pp.171-185, ⟨10.1007/11539452_16⟩. ⟨inria-00201101⟩
Accès au texte intégral et bibtex

ref_biblio: Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi. Separation of synchronous and asynchronous communication via testing. Proceedings of the 12th International Workshop on Expressiveness in Concurrency (EXPRESS 2005), Aug 2005, San Francisco, United States. pp.95-108, ⟨10.1016/j.entcs.2006.05.009⟩. ⟨inria-00201107⟩
Accès au texte intégral et bibtex

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi. A Framework for Analyzing Probabilistic Protocols and its Application to the Partial Secrets Exchange. First Symposium on Trustworthy Global Computing, Apr 2005, Edinburgh, United Kingdom. pp.146-162, ⟨10.1007/11580850_9⟩. ⟨inria-00201111⟩
Accès au texte intégral et bibtex

ref_biblio: Konstantinos Chatzikokolakis, Catuscia Palamidessi. Probable Innocence Revisited. Third International Workshop on Formal Aspects in Security and Trust (FAST 2005), Jul 2005, Newcastle Upon Tyne, United Kingdom. pp.142-157. ⟨inria-00201109⟩
Accès au texte intégral et bibtex

ref_biblio: Yuxin Deng, Catuscia Palamidessi. Axiomatizations for probabilistic finite-state behaviors. 8th International Conference on Foundations of Software Science and Computational Structures (FOSSACS 2005), Apr 2005, Edinburgh, United Kingdom. pp.110-124, ⟨10.1007/b106850⟩. ⟨inria-00201123⟩
Accès au texte intégral et bibtex

ref_biblio: Yuxin Deng, Catuscia Palamidessi, Jun Pang. Weak Probabilistic Anonymity. 3rd International Workshop on Security Issues in Concurrency (SecCo), Aug 2005, San Francisco, United States. pp.55-76, ⟨10.1016/j.entcs.2005.05.043⟩. ⟨inria-00200912⟩
Accès au texte intégral et bibtex

ref_biblio: Yuxin Deng, Tom Chothia, Catuscia Palamidessi, Jun Pang. Metrics for Action-labelled Quantitative Transition Systems. Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005), Apr 2005, Edinburgh, United Kingdom. pp.79-96, ⟨10.1016/j.entcs.2005.10.033⟩. ⟨inria-00201087⟩
Accès au texte intégral et bibtex

ref_biblio: Maria Grazia Vigliotti, Iain Phillips, Catuscia Palamidessi. Expressiveness via Leader Election Problems. 4th International Symposium on Formal Methods for Components and Objects (FMCO), Nov 2005, Amsterdam, Netherlands. pp.172-194, ⟨10.1007/11804192_9⟩. ⟨inria-00201124⟩
Accès au texte intégral et bibtex

ref_biblio: Axelle Ziegler, Dale Miller, Catuscia Palamidessi. A Congruence Format for Name-passing Calculi. 2nd Workshop on Structural Operational Semantics (SOS'05), Jul 2005, Lisboa, Portugal. pp.169-189, ⟨10.1016/j.entcs.2005.09.032⟩. ⟨inria-00201085⟩
Accès au texte intégral et bibtex

Book sections

2021

ref_biblio: Kangsoo Jung, Sayan Biswas, Catuscia Palamidessi. Establishing the Price of Privacy in Federated Data Trading. Protocols, Strands, and Logic, 13066, Springer International Publishing, pp.232-250, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-91631-2_13⟩. ⟨hal-03589837⟩
Accès au bibtex

2020

ref_biblio: Moreno Falaschi, Catuscia Palamidessi, Marco Romanelli. Derivation of Constraints from Machine Learning Models and Applications to Security and Privacy. Frank S. de Boer and Jacopo Mauro. Recent Developments in the Design and Implementation of Programming Languages, 86, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp.11:1-11:20, 2020, OASICS, ⟨10.4230/OASIcs.Gabbrielli.2020.11⟩. ⟨hal-03091740⟩
Accès au texte intégral et bibtex

2019

ref_biblio: Mário S. Alvim, Sophia Knight, Frank D. Valencia. Toward a Formal Model for Group Polarization in Social Networks. Mário S. Alvim; Konstantinos Chatzikokolakis; Carlos Olarte; Frank Valencia. The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy - Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday, 11760, Springer, pp.419-441, 2019, Lecture Notes in Computer Science, 978-3-030-31174-2. ⟨10.1007/978-3-030-31175-9_24⟩. ⟨hal-02410747⟩
Accès au bibtex

ref_biblio: Nicolás Aristizabal, Carlos Pinzón, Camilo Rueda, Frank D. Valencia. Make Puzzles Great Again. Mário S. Alvim; Konstantinos Chatzikokolakis; Carlos Olarte; Frank Valencia. The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy - Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday, 11760, Springer, pp.442-459, 2019, Lecture Notes in Computer Science, 978-3-030-31174-2. ⟨10.1007/978-3-030-31175-9_25⟩. ⟨hal-02410767⟩
Accès au bibtex

ref_biblio: Konstantinos Chatzikokolakis, Geoffrey Smith. Refinement Metrics for Quantitative Information Flow. Mário S. Alvim; Kostas Chatzikokolakis; Carlos Olarte; Frank Valencia. The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy. Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday., 11760, Springer, pp.397-416, 2019, Lecture Notes in Computer Science, 978-3-030-31174-2. ⟨10.1007/978-3-030-31175-9_23⟩. ⟨hal-02350777⟩
Accès au texte intégral et bibtex

ref_biblio: Natasha Fernandes, Kacem Lefki, Catuscia Palamidessi. Utility-Preserving Privacy Mechanisms for Counting Queries. Michele Boreale; Flavio Corradini; Michele Loreti; Rosario Pugliese. Models, Languages and Tools for Concurrent and Distributed Programming, 11665, Springer, pp.487-495, 2019, Lecture Notes in Computer Science. ⟨hal-02169218⟩
Accès au bibtex

2015

ref_biblio: Davide Chiarugi, Moreno Falaschi, Carlos Olarte, Catuscia Palamidessi. A Declarative View of Signaling Pathways. Chiara Bodei; Gian Luigi Ferrari; Corrado Priami. Programming Languages with Applications to Biology and Security, 9465, Springer, pp.183-201, 2015, Lecture Notes in Computer Science, 978-3-319-25526-2. ⟨hal-01271650⟩
Accès au bibtex

2014

ref_biblio: Ehab Elsalamouny, Konstantinos Chatzikokolakis, Catuscia Palamidessi. Generalized differential privacy: regions of priors that admit robust optimal mechanisms. van Breugel, Franck and Kashefi, Elham and Palamidessi, Catuscia and Rutten, Jan. Horizons of the Mind. A Tribute to Prakash Panangaden, 8464, Springer International Publishing, pp.292-318, 2014, Lecture Notes in Computer Science, 978-3-319-06879-4. ⟨10.1007/978-3-319-06880-0_16⟩. ⟨hal-01006380⟩
Accès au texte intégral et bibtex

2011

ref_biblio: Mário Alvim, Miguel E. Andrés, Konstantinos Chatzikokolakis, Catuscia Palamidessi. Quantitative Information Flow and Applications to Differential Privacy. Alessandro Aldini and Roberto Gorrieri. Foundations of Security Analysis and Design VI -- FOSAD Tutorial Lectures, 6858, Springer, pp.211--230, 2011, Lecture Notes in Computer Science, ⟨10.1007/978-3-642-23082-0_8⟩. ⟨hal-00655522⟩
Accès au texte intégral et bibtex

ref_biblio: Giuseppe Longo, Catuscia Palamidessi, Paul Thierry. Some Bridging Results and Challenges in Classical, Quantum and Computational Randomness. Hector Zenil. Randomness Through Computation, World Scientific, pp.NA, 2011. ⟨hal-00445553v3⟩
Accès au texte intégral et bibtex

ref_biblio: Mauricio Toro, Camilo Rueda, Frank Valencia, Gerardo Sarria, Carlos Olarte. Concurrent constraints models of music interaction. Constraint Programming in Music, Wiley, pp.133, 2011. ⟨hal-00662257⟩
Accès au texte intégral et bibtex

2010

ref_biblio: Maurizio Gabbrielli, Catuscia Palamidessi, Frank D. Valencia. Concurrent and Reactive Constraint Programming. Agostino Dovier and Enrico Pontelli. A 25-Year Perspective on Logic Programming, Springer, pp.231-253, 2010, ⟨10.1007/978-3-642-14309-0_11⟩. ⟨hal-00545256⟩
Accès au texte intégral et bibtex

2009

ref_biblio: Carlos Olarte, Camilo Rueda, Frank D. Valencia. Concurrent Constraint Calculi: a Declarative Paradigm for Modeling Music Systems.. Gérard Assayag and Andrew Gerzso. New Computational Paradigms for Computer Music, Delatour France / Ircam-Centre Pompidou, 2009. ⟨inria-00429592⟩
Accès au texte intégral et bibtex

2008

ref_biblio: Romain Beauxis, Catuscia Palamidessi, Frank D. Valencia. On the asynchronous nature of the asynchronous π-calculus. Rocco De Nicola, Pierpaolo Degano, and José Meseguer. Concurrency, Graphs and Models, Springer, pp.473-492, 2008, Lecture Notes in Computer Science, ⟨10.1007/978-3-540-68679-8_29⟩. ⟨inria-00349226v2⟩
Accès au texte intégral et bibtex

2005

ref_biblio: Yuxin Deng, Catuscia Palamidessi, Jun Pang. Compositional Reasoning for Probabilistic Finite-State Behaviors. Aart Middeldorp and Vincent van Oostrom and Femke van Raamsdonk and Roel C. de Vrijer. Processes, Terms and Cycles: Steps on the Road to Infinity, 3838, Springer, pp.309-337, 2005, Lecture Notes in Computer Science, ⟨10.1007/11601548_17⟩. ⟨inria-00201100⟩
Accès au texte intégral et bibtex

Directions of work or proceedings

2019

ref_biblio: Mário S. Alvim, Konstantinos Chatzikokolakis, Carlos Olarte, Frank Valencia. The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy - Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday. Mário S. Alvim; Konstantinos Chatzikokolakis; Carlos Olarte; Frank Valencia. 11760, Springer, 2019, Lecture Notes in Computer Science, 978-3-030-31174-2. ⟨10.1007/978-3-030-31175-9⟩. ⟨hal-02411252⟩
Accès au bibtex

ref_biblio: Anuj Dawar, Anca Muscholl, Catuscia Palamidessi. Selected Papers of the 44th International Colloquium on Automata, Languages and Programming (ICALP 2017). Anuj Dawar; Anca Muscholl; Catuscia Palamidessi. Logical Methods in Computer Science, 2019. ⟨hal-01997414⟩
Accès au bibtex

2018

ref_biblio: Martin Leucker, Jorge A. Pérez, Camilo Rueda, Frank D. Valencia. Special Issue: Best Papers Presented at ICTAC 2015. Cambridge University Press, 2018, Mathematical Structures in Computer Science. ⟨hal-01837891⟩
Accès au bibtex

ref_biblio: Catuscia Palamidessi. Special issue of Logical Methods in Computer Science dedicated to selected papers of LICS 2015 and LICS 2016. Palamidessi, Catuscia; Silva, Alexandra; Shankar, Natarajan. IEEE, 2018. ⟨hal-01995888⟩
Accès au bibtex

2015

ref_biblio: Miguel E. Andrés, Geoffrey Smith, Catuscia Palamidessi. Special Issue on Quantitative Information Flow. Andrés, Miguel; Palamidessi, Catuscia; Smith, Geoffrey. Cambridge University Press, 2015, ⟨10.1017/S0960129513000583⟩. ⟨hal-01271678⟩
Accès au bibtex

ref_biblio: Martin Leucker, Camilo Rueda, Frank Valencia. Theoretical Aspects of Computing - ICTAC 2015: 12th International Colloquium, Cali, Colombia, October 29-31, 2015, Proceedings. France. 9399, Springer, 2015, Lecture Notes in Computer Science, 978-3-319-25149-3. ⟨10.1007/978-3-319-25150-9⟩. ⟨hal-01257171⟩
Accès au bibtex

ref_biblio: Catuscia Palamidessi. Proceedings of the IEEE/ACM Symposium on Logic in Computer Science (LICS). Palamidessi, Catuscia. 2015. ⟨hal-01995887⟩
Accès au bibtex

2014

ref_biblio: Erika Ábrahám, Catuscia Palamidessi. Proceedings of the 34th International Conference on Formal Techniques for Distributed Objects, Components, and Systems: IFIP WG 6.1. Erika Abraham; Catuscia Palamidessi. 2014, France. 8461, Springer, 2014, Lecture Notes in Computer Science. ⟨hal-01271977⟩
Accès au bibtex

2013

ref_biblio: Catuscia Palamidessi, Mark D. Ryan. Proceedings of the 7th International Symposium on Trustworthy Global Computing (TGC). Catuscia Palamidessi and Mark D. Ryan. 8191, Springer, pp.1-212, 2013, Lecture Notes in Computer Science, 978-3-642-41156-4. ⟨10.1007/978-3-642-41157-1⟩. ⟨hal-00778538⟩
Accès au bibtex

2012

ref_biblio: Samson Abramsky, Michael W. Mislove, Catuscia Palamidessi. Special issue dedicated to a selection of papers from Mathematical Foundations of Programming Semantics (MFPS XXV). Theoretical Computer Science 430 (1-2). Samson Abramsky and Michael W. Mislove and Catuscia Palamidessi. Elsevier B.V., pp.125, 2012. ⟨hal-00778536⟩
Accès au bibtex

ref_biblio: Sebastian Mödersheim, Catuscia Palamidessi. Proceedings of the Joint Workshop on Theory of Security and Applications (TOSCA). Sebastian Mödersheim and Catuscia Palamidessi. 6993, Springer, pp.224, 2012, Lecture Notes in Computer Science, 978-3-642-27374-2. ⟨10.1007/978-3-642-27375-9⟩. ⟨hal-00778535⟩
Accès au bibtex

2011

ref_biblio: Konstantinos Chatzikokolakis, Véronique Cortier. Proceedings of the 8th International Workshop on Security Issues in Concurrency. Konstantinos Chatzikokolakis and Véronique Cortier. 51, Electronic Proceedings in Theoretical Computer Science, pp.51, 2011, Electronic Proceedings in Theoretical Computer Science, ⟨10.4204/EPTCS.51⟩. ⟨hal-00641020⟩
Accès au bibtex

ref_biblio: Bas Luttik, Frank D. Valencia. Proceedings 18th International Workshop on Expressiveness in Concurrency. Bas Luttik and Frank Valencia. France. 64, Open Publishing Association, pp.1-131, 2011, Electronic Proceedings in Theoretical Computer Science, ⟨10.4204/EPTCS.64⟩. ⟨hal-00655577⟩
Accès au bibtex

2010

ref_biblio: Sibylle Fröschle, Frank D. Valencia. Proceedings 17th International Workshop on Expressiveness in Concurrency. Electronic Proceedings in Theoretical Computer Science, 2010, ⟨10.4204/EPTCS.41⟩. ⟨hal-00547314⟩
Accès au bibtex

ref_biblio: Daniele Gorla, Catuscia Palamidessi. Special Issue dedicated to a selection of the best papers presented at SECCO'07. Journal of Computer Security 18(2).. IOS Press, pp.187-377, 2010, ⟨10.3233/JCS-2010-0359⟩. ⟨hal-00548217⟩
Accès au bibtex

2009

ref_biblio: Samson Abramsky, Michael W. Mislove, Catuscia Palamidessi. Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics. Samson Abramsky and Michael W. Mislove and Catuscia Palamidessi. 249, Elsevier, pp.1-490, 2009, Electronic Notes in Theoretical Computer Science. ⟨hal-00772697⟩
Accès au bibtex

Books

2020

ref_biblio: Mário S. Alvim, Konstantinos Chatzikokolakis, Annabelle Mciver, Carroll Morgan, Catuscia Palamidessi, et al.. The Science of Quantitative Information Flow. Springer, pp.XXVIII, 478, 2020, ⟨10.1007/978-3-319-96131-6⟩. ⟨hal-01971490⟩
Accès au bibtex

2014

ref_biblio: Erika Ábrahám, Catuscia Palamidessi. Formal Techniques for Distributed Objects, Components, and Systems: 34th IFIPWG6.1 International Conference, FORTE 2014, Held as Part of the 9th International Federated Conference on Distributed Computing Techniques, DisCoTec 2014, Berlin, Germany, June 3-5, 2014. Springer, LNCS-8461, 2014, Lecture Notes in Computer Science, 978-3-662-43612-7. ⟨10.1007/978-3-662-43613-4⟩. ⟨hal-01398026⟩
Accès au bibtex

ref_biblio: Sibylle Fröschle, Frank D. Valencia. Special Issue of the Journal of Mathematical Structures in Computer Science dedicated to a selection of papers presented at the 17th International Workshop on Expressiveness in Concurrency (EXPRESS'10). Sibylle Fröschle and Frank D. Valencia. Cambridge University Press, 2014, Mathematical Structures in Computer Science, ⟨10.1017/S0960129514000371⟩. ⟨hal-01116286⟩
Accès au bibtex

ref_biblio: Bas Luttik, Frank D. Valencia. Special Issue of the Journal of Mathematical Structures in Computer Science dedicated to a selection of papers presented at the 18th International Workshop on Expressiveness in Concurrency (EXPRESS'11). Bas Luttik and Frank D. Valencia. Cambridge University Press, 2014, Mathematical Structures in Computer Science, ⟨10.1017/S0960129514000607⟩. ⟨hal-01116285⟩
Accès au bibtex

2011

ref_biblio: Catuscia Palamidessi, Alma Riska. Proceedings of the Eighth International Conference on Quantitative Evaluation of SysTems. Catuscia Palamidessi and Alma Riska. IEEE, 276 p., 2011, 978-1-4577-0973-9. ⟨hal-00655524⟩
Accès au bibtex

2009

ref_biblio: Marco Carbone, Pawel Sobocinski, Frank D. Valencia. Festschrift for Mogens Nielsen's 60th Birthday. Elsevier, pp.4001-4168, 2009, Theoretical Computer Science, 0304-3975. ⟨10.1016/j.tcs.2009.06.007⟩. ⟨hal-00779099⟩
Accès au bibtex

ref_biblio: Maurizio Gabbrielli, Moreno Falaschi, Catuscia Palamidessi. Abstract Interpretation and Logic Programming: Festschrift in honor of professor Giorgio Levi. Elsevier, 410, pp.4601-4800, 2009, Theoretical Computer Science. ⟨hal-00772696⟩
Accès au bibtex

ref_biblio: Mogens Nielsen, Antonin Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, et al.. SOFSEM 2009: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science. Springer, 5404, pp.1-670, 2009, Lecture Notes in Computer Science, 978-3-540-95890-1. ⟨10.1007/978-3-540-95891-8⟩. ⟨hal-00772695⟩
Accès au bibtex

Reports

2018

ref_biblio: Ali Kassem, Gergely Acs, Claude Castelluccia, Catuscia Palamidessi. Differential Inference Testing A Practical Approach to Evaluate Anonymized Data. [Research Report] INRIA. 2018, pp.1-21. ⟨hal-01681014v2⟩
Accès au texte intégral et bibtex

2010

ref_biblio: Philippe Darondeau, Jérémy Dubreil, Hervé Marchand. Supervisory Control for Modal Specifications of Services. [Research Report] RR-7247, INRIA. 2010. ⟨inria-00472736⟩
Accès au texte intégral et bibtex

Theses

2017

ref_biblio: Michell Guzmán. On the expressiveness of spatial constraint systems. Logic in Computer Science [cs.LO]. Université Paris Saclay (COmUE), 2017. English. ⟨NNT : 2017SACLX064⟩. ⟨tel-01674956v3⟩
Accès au texte intégral et bibtex

2015

ref_biblio: Marco Stronati. Designing Location Privacy Mechanisms for flexibility over time and space. Cryptography and Security [cs.CR]. Ecole Polytechnique, 2015. English. ⟨tel-01243295⟩
Accès au texte intégral et bibtex

ref_biblio: Lili Xu. Formal Verification of Differential Privacy in Concurrent Systems. Cryptography and Security [cs.CR]. Ecole Polytechnique (Palaiseau, France), 2015. English. ⟨tel-01384363⟩
Accès au texte intégral et bibtex

2014

ref_biblio: Nicolás E. Bordenabe. Mesurer la confidentialité avec des métriques de discernabilité: définitions, mécanismes et confidentialité des informations liées à la localisation. Cryptographie et sécurité [cs.CR]. École Polytechnique, 2014. Français. ⟨tel-01098088⟩
Accès au texte intégral et bibtex

ref_biblio: Thomas Nowak. Transient Behavior of Distributed Algorithms and Digital Circuit Models. Distributed, Parallel, and Cluster Computing [cs.DC]. Ecole Polytechnique X, 2014. English. ⟨pastel-01061470⟩
Accès au texte intégral et bibtex

ref_biblio: Luis Fernando Pino Duque. Efficient Verification and New Reasoning Techniques for Concurrent Constraint Programming. Data Structures and Algorithms [cs.DS]. Ecole Polytechnique, 2014. English. ⟨tel-01111979⟩
Accès au texte intégral et bibtex

2013

ref_biblio: Ivan Gazeau. Programmation sûre en précision finie : Contrôler les erreurs et les fuites d'informations. Analyse numérique [cs.NA]. Ecole Polytechnique X, 2013. Français. ⟨pastel-00913469⟩
Accès au texte intégral et bibtex

ref_biblio: Sophia Knight. The Epistemic View of Concurrency Theory. Logic in Computer Science [cs.LO]. Ecole Polytechnique X, 2013. English. ⟨tel-00940413⟩
Accès au texte intégral et bibtex

2012

ref_biblio: Andrés Aristizábal. Bisimulation Techniques and Algorithms for Concurrent Constraint Programming. Other [cs.OH]. Ecole Polytechnique X, 2012. English. ⟨pastel-00756952⟩
Accès au texte intégral et bibtex

2011

ref_biblio: Mário S. Alvim. Formal approaches to information hiding : An analysis of interactive systems, statistical disclosure control, and refinement of specifications. Cryptography and Security [cs.CR]. Ecole Polytechnique X, 2011. English. ⟨tel-00639948v3⟩
Accès au texte intégral et bibtex

ref_biblio: Miguel Andrés. Quantitative Analysis of Information Leakage in Probabilistic and Nondeterministic Systems. Computation and Language [cs.CL]. Radboud University, Nijmegen, 2011. English. ⟨tel-00655506⟩
Accès au texte intégral et bibtex

2010

ref_biblio: Christelle Braun. Quantitative Approaches to Information Hiding. Other [cs.OH]. Ecole Polytechnique X, 2010. English. ⟨tel-00527367⟩
Accès au texte intégral et bibtex

2009

ref_biblio: Jesus Aranda. On the Expressivity of Infinite and Local Behaviour in Fragments of the pi-calculus. Modeling and Simulation. Ecole Polytechnique X; Universidad del Valle, 2009. English. ⟨tel-00430495⟩
Accès au texte intégral et bibtex

ref_biblio: Romain Beauxis. Asynchronous Process Calculi for Specification and Verification of Information Hiding Protocols. Cryptography and Security [cs.CR]. Ecole Polytechnique X, 2009. English. ⟨tel-00772693⟩
Accès au texte intégral et bibtex

ref_biblio: Carlos Olarte. Universal Temporal Concurrent Constraint Programming. Modeling and Simulation. Ecole Polytechnique X, 2009. English. ⟨tel-00430446⟩
Accès au texte intégral et bibtex

Preprints, Working Papers, ...

2022

ref_biblio: Guilherme Alves, Fabien Bernier, Miguel Couceiro, Karima Makhlouf, Catuscia Palamidessi, et al.. Survey on Fairness Notions and Related Tensions. 2022. ⟨hal-03484009v2⟩
Accès au texte intégral et bibtex

2021

ref_biblio: Natalia Díaz-Rodríguez, Rūta Binkytė-Sadauskienė, Wafae Bakkali, Sannidhi Bookseller, Paola Tubaro, et al.. Questioning causality on sex, gender and COVID-19, and identifying bias in large-scale data-driven analyses: the Bias Priority Recommendations and Bias Catalog for Pandemics. 2021. ⟨hal-03228983⟩
Accès au bibtex

2020

ref_biblio: Mário S. Alvim, Konstantinos Chatzikokolakis, Yusuke Kawamoto, Catuscia Palamidessi. Information Leakage Games: Exploring Information as a Utility Function. 2020. ⟨hal-03091413⟩
Accès au bibtex

ref_biblio: Konstantinos Chatzikokolakis, Giovanni Cherubin, Catuscia Palamidessi, Carmela Troncoso. The Bayes Security Measure. 2020. ⟨hal-03091416⟩
Accès au bibtex

ref_biblio: Sophia Knight, Prakash Panangaden, Frank Valencia. Computing with Epistemic and Spatial Modalities. 2020. ⟨hal-03148149⟩
Accès au bibtex

ref_biblio: Karima Makhlouf, Sami Zhioua, Catuscia Palamidessi. Survey on Causal-based Machine Learning Fairness Notions. 2020. ⟨hal-03091428⟩
Accès au bibtex

2010

ref_biblio: Mário S. Alvim, Konstantinos Chatzikokolakis, Pierpaolo Degano, Catuscia Palamidessi. Differential Privacy versus Quantitative Information Flow. 2010. ⟨hal-00548214⟩
Accès au texte intégral et bibtex

ref_biblio: Luis Pino. Analysis of the reachability problem in fragments of the Pi-calculus. 2010. ⟨hal-00546849⟩
Accès au texte intégral et bibtex

CSDA

Group COMETE