Catuscia Palamidessi

From MaRDI portal
Person:507370

Available identifiers

zbMath Open palamidessi.catusciaDBLPp/CPalamidessiWikidataQ93944827 ScholiaQ93944827MaRDI QIDQ507370

List of research outcomes





PublicationDate of PublicationType
When causality meets fairness: a survey2024-10-08Paper
Comparing the expressive power of the synchronous and asynchronous \(\pi\)-calculi2024-09-30Paper
On the impact of multi-dimensional local differential privacy on fairness2024-09-20Paper
Utility-preserving privacy mechanisms for counting queries2024-02-23Paper
CONCUR Test-Of-Time Award 2021 (Invited Paper)2023-08-21Paper
Linear constraint systems as high-level nets2023-06-28Paper
Confluence in concurrent constraint programming2022-08-16Paper
https://portal.mardi4nfdi.de/entity/Q50892672022-07-18Paper
Establishing the price of privacy in federated data trading2022-07-13Paper
PRIVIC: A privacy-preserving method for incremental collection of location data2022-06-21Paper
An incentive mechanism for trading personal data in data markets2022-03-31Paper
Proving correctness of Constraint Logic Programs with dynamic scheduling2022-02-16Paper
https://portal.mardi4nfdi.de/entity/Q49925202021-06-09Paper
Slicing concurrent constraint programs2021-05-20Paper
https://portal.mardi4nfdi.de/entity/Q49862602021-04-27Paper
https://portal.mardi4nfdi.de/entity/Q58587252021-04-14Paper
https://portal.mardi4nfdi.de/entity/Q58587272021-04-14Paper
Enhanced models for privacy and utility in continuous-time diffusion networks2019-12-12Paper
Leakage and protocol composition in a game-theoretic perspective2019-09-16Paper
https://portal.mardi4nfdi.de/entity/Q46086882018-03-21Paper
Abstract interpretation of temporal concurrent constraint programs2017-11-09Paper
Information leakage games2017-10-27Paper
Slicing concurrent constraint programs2017-10-13Paper
On the Compositionality of Quantitative Information Flow2017-10-12Paper
Quantifying leakage in the presence of unreliable sources of information2017-06-30Paper
Compositional methods for information-hiding2017-04-04Paper
Preserving differential privacy under finite-precision semantics2017-02-06Paper
Quantitative notions of leakage for one-try attacks2016-05-10Paper
On the generalized dining philosophers problem2016-03-04Paper
Location Privacy via Geo-Indistinguishability2016-02-25Paper
A Declarative View of Signaling Pathways2016-01-08Paper
Epistemic Strategies and Games on Concurrent Processes2015-09-17Paper
Generalized Bisimulation Metrics2014-09-15Paper
Generalized Differential Privacy: Regions of Priors That Admit Robust Optimal Mechanisms2014-06-02Paper
Fair \(\pi\)2013-12-13Paper
Weak probabilistic anonymity2013-12-06Paper
Probabilistic and nondeterministic aspects of anonymity2013-10-08Paper
A congruence format for name-passing calculi2013-10-07Paper
Separation of synchronous and asynchronous communication via testing2013-10-07Paper
A Differentially Private Mechanism of Optimal Utility for a Region of Priors2013-08-06Paper
Spatial and Epistemic Modalities in Constraint-Based Process Calculi2012-09-25Paper
https://portal.mardi4nfdi.de/entity/Q32240802012-03-29Paper
Quantitative Information Flow and Applications to Differential Privacy2011-09-16Paper
On the Relation between Differential Privacy and Quantitative Information Flow2011-07-07Paper
Information hiding in probabilistic concurrent systems2011-07-07Paper
Deriving labels and bisimilarity for concurrent constraint programming2011-05-19Paper
Safe equivalences for security properties2010-10-27Paper
Entropy and attack models in information flow (Invited talk)2010-10-27Paper
Information flow in interactive systems2010-08-31Paper
Concurrent and reactive constraint programming2010-07-20Paper
Making random choices invisible to the scheduler2010-06-25Paper
A quantitative doxastic logic for probabilistic processes and applications to information-hiding2010-03-10Paper
Probabilistic and nondeterministic aspects of anonymity2009-09-29Paper
https://portal.mardi4nfdi.de/entity/Q33965692009-09-19Paper
Explicit fairness in testing semantics2009-06-30Paper
Declarative Diagnosis of Temporal Concurrent Constraint Programs2009-03-05Paper
Anonymity Protocols as Noisy Channels2009-03-05Paper
Making Random Choices Invisible to the Scheduler2008-09-18Paper
On Recursion, Replication and Scope Mechanisms in Process Calculi2008-09-17Paper
On the Asynchronous Nature of the Asynchronous π-Calculus2008-06-19Paper
A Probabilistic Applied Pi–Calculus2008-05-15Paper
Anonymity protocols as noisy channels2008-04-16Paper
Compositional Methods for Information-Hiding2008-04-11Paper
A Declarative Framework for Security: Secure Concurrent Constraint Programming2008-03-11Paper
Separation of synchronous and asynchronous communication via testing2007-12-19Paper
Tutorial on separation results in process calculi via leader election problems2007-12-18Paper
A framework for analyzing probabilistic protocols and its application to the partial secrets exchange2007-12-14Paper
Separation Results Via Leader Election Problems2007-09-11Paper
Axiomatizations for probabilistic finite-state behaviors2007-04-13Paper
Probable innocence revisited2007-01-09Paper
Processes, Terms and Cycles: Steps on the Road to Infinity2006-11-13Paper
Trustworthy Global Computing2006-11-01Paper
CONCUR 2005 – Concurrency Theory2006-11-01Paper
Foundations of Software Science and Computational Structures2005-11-10Paper
A randomized encoding of the \(\pi\)-calculus with mixed choice2005-06-10Paper
https://portal.mardi4nfdi.de/entity/Q44756402004-08-09Paper
Encoding transition systems in sequent calculus2003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q31502072002-12-10Paper
https://portal.mardi4nfdi.de/entity/Q45375012002-07-01Paper
https://portal.mardi4nfdi.de/entity/Q27670802002-01-28Paper
https://portal.mardi4nfdi.de/entity/Q27363492001-08-29Paper
https://portal.mardi4nfdi.de/entity/Q27239282001-07-08Paper
https://portal.mardi4nfdi.de/entity/Q45082992000-10-03Paper
https://portal.mardi4nfdi.de/entity/Q42228391998-12-14Paper
Weak relative pseudo-complements of closure operators1998-11-24Paper
Confluence in concurrent constraint programming1998-07-22Paper
Constraint logic programming with dynamic scheduling: A semantics based on closure operators1997-09-28Paper
https://portal.mardi4nfdi.de/entity/Q43536031997-09-10Paper
An algebraic perspective of constraint logic programming1997-04-21Paper
Nondeterminism and infinite computations in constraint programming1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q48787721996-05-14Paper
Negation as instantiation1996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48585781995-12-17Paper
A declarative approach for first-order built-in's of Prolog1994-07-04Paper
Embedding as a tool for language comparison1994-03-10Paper
A model-theoretic reconstruction of the operational semantics of logic programs1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40387061993-05-18Paper
From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic1992-09-27Paper
Semantic models for concurrent logic languages1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39751391992-06-26Paper
Kernel-LEAF: A logic plus functional language1991-01-01Paper
Comments on “logic programming with equations”1991-01-01Paper
Declarative modeling of the operational behavior of logic languages1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42054251989-01-01Paper
Contributions to the semantics of logic perpetual processes1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37426941986-01-01Paper
A synchronization logic: Axiomatics and formal semantics of generalized horn clauses1984-01-01Paper

Research outcomes over time

This page was built for person: Catuscia Palamidessi