The following pages link to Catuscia Palamidessi (Q507370):
Displaying 50 items.
- Preserving differential privacy under finite-precision semantics (Q507371) (← links)
- Information hiding in probabilistic concurrent systems (Q549174) (← links)
- A randomized encoding of the \(\pi\)-calculus with mixed choice (Q555750) (← links)
- Nondeterminism and infinite computations in constraint programming (Q671989) (← links)
- Probabilistic and nondeterministic aspects of anonymity (Q843094) (← links)
- Probable innocence revisited (Q860902) (← links)
- Axiomatizations for probabilistic finite-state behaviors (Q875517) (← links)
- Declarative modeling of the operational behavior of logic languages (Q913530) (← links)
- Making random choices invisible to the scheduler (Q979081) (← links)
- Contributions to the semantics of logic perpetual processes (Q1113661) (← links)
- (Q1177920) (redirect page) (← links)
- Semantic models for concurrent logic languages (Q1177921) (← links)
- From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic (Q1194328) (← links)
- Weak relative pseudo-complements of closure operators (Q1272226) (← links)
- Embedding as a tool for language comparison (Q1314270) (← links)
- A declarative approach for first-order built-in's of Prolog (Q1328181) (← links)
- Constraint logic programming with dynamic scheduling: A semantics based on closure operators (Q1368380) (← links)
- Confluence in concurrent constraint programming (Q1391102) (← links)
- Encoding transition systems in sequent calculus (Q1398474) (← links)
- Information leakage games (Q1675468) (← links)
- A model-theoretic reconstruction of the operational semantics of logic programs (Q1803658) (← links)
- Negation as instantiation (Q1898466) (← links)
- An incentive mechanism for trading personal data in data markets (Q2119975) (← links)
- Establishing the price of privacy in federated data trading (Q2154016) (← links)
- Enhanced models for privacy and utility in continuous-time diffusion networks (Q2279135) (← links)
- Leakage and protocol composition in a game-theoretic perspective (Q2324199) (← links)
- Quantifying leakage in the presence of unreliable sources of information (Q2361344) (← links)
- Slicing concurrent constraint programs (Q2409727) (← links)
- A framework for analyzing probabilistic protocols and its application to the partial secrets exchange (Q2463563) (← links)
- Tutorial on separation results in process calculi via leader election problems (Q2464946) (← links)
- Separation of synchronous and asynchronous communication via testing (Q2465029) (← links)
- Anonymity protocols as noisy channels (Q2482451) (← links)
- Kernel-LEAF: A logic plus functional language (Q2638759) (← links)
- (Q2723928) (← links)
- (Q2736349) (← links)
- (Q2767080) (← links)
- An algebraic perspective of constraint logic programming (Q2785838) (← links)
- Location Privacy via Geo-Indistinguishability (Q2787414) (← links)
- On the generalized dining philosophers problem (Q2787669) (← links)
- Quantitative Notions of Leakage for One-try Attacks (Q2805152) (← links)
- (Q2852065) (← links)
- (Q2852102) (← links)
- (Q2852344) (← links)
- Weak Probabilistic Anonymity (Q2864392) (← links)
- Fair Π (Q2866341) (← links)
- Spatial and Epistemic Modalities in Constraint-Based Process Calculi (Q2914378) (← links)
- Compositional methods for information-hiding (Q2971070) (← links)
- Deriving Labels and Bisimilarity for Concurrent Constraint Programming (Q3000605) (← links)
- On the Relation between Differential Privacy and Quantitative Information Flow (Q3012909) (← links)
- Quantitative Information Flow and Applications to Differential Privacy (Q3092184) (← links)
