- Probable Innocence Revisited Konstantinos Chatzikokolakis a
- SOS 2005 Preliminary Version A congruence format for name-passing calculi
- Probabilistic asynchronous calculus ? Oltea Mihaela Herescu and Catuscia Palamidessi
- Proving Concurrent Constraint Programs Correct Frank S. de Boer \Lambda
- An algebraic perspective of constraint logic programming \Lambda
- A Fully Abstract Model for Concurrent Constraint Programming \Lambda .
- Compositional Methods for Information-Hiding Christelle Braun, Konstantinos Chatzikokolakis, Catuscia Palamidessi
- Symbolic Bisimulations for Probabilistic Systems CNRS and LIX, Ecole Polytechnique
- On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus Catuscia Palamidessi
- Accepted for publication in Math. Struct. in Comp. Science Comparing the Expressive Power of the
- A RANDOMIZED DISTRIBUTED ENCODING OF THE CALCULUS WITH MIXED CHOICE \Lambda
- Metrics for Action-labelled Quantitative Transition Systems 1
- Separation of synchronous and asynchronous communication via testing D. Cacciagranoa
- Axiomatizations for probabilistic nite-state Yuxin Deng 1? and Catuscia Palamidessi 2??
- Linear Constraint Systems as Highlevel Nets ? Institut fur Informatik, Universitat Hildesheim, Marienburger Platz 22,
- A randomized encoding of the #calculus with mixed choice #
- From Concurrent Logic Programming to Concurrent Constraint Programming
- Probabilistic Anonymity # Mohit Bhargava 1## and Catuscia Palamidessi 2
- Complete Herbrand Interpretations giving a Symmetric Characterization of Failure and Success #
- Confluence in Concurrent Constraint Programming Moreno Falaschi a;1;2 , Maurizio Gabbrielli b;1 , Kim Marriott c
- Proving Correctness of Constraint Logic Programs with Dynamic Scheduling \Lambda
- On the generalized dining philosophers problem \Lambda Oltea Mihaela Herescu Catuscia Palamidessi
- Nondeterminism and infinite computations in constraint programming \Lambda
- A Theory of FirstOrder Builtin's of Prolog Krzysztof R. Apt \Lambda \Lambda , Elena Marchiori y , Catuscia Palamidessi z x
- Algebraic Properties of Idempotent Substitutions \Lambda Catuscia Palamidessi
- Weak Relative PseudoComplements of Closure Operators
- A Paradigm for Asynchronous Communication and its Application to Concurrent Constraint Programming
- Nordic Journal of Computing TEMPORAL CONCURRENT CONSTRAINT
- Axiomatizations for Probabilistic Finite-State Yuxin Deng 1? and Catuscia Palamidessi 2??
- On the asynchronous nature of the asynchronous Romain Beauxis, Catuscia Palamidessi, and Frank D. Valencia
- Probabilistic and Nondeterministic Aspects of Romain Beauxis and Catuscia Palamidessi
- Model checking the probabilistic -calculus Gethin Norman1
- Comparing the Expressive Power of the Synchronous and the Asynchronous calculus \Lambda
- Negation as Instantiation Alessandra Di Pierro 1 , Maurizio Martelli 2 , Catuscia Palamidessi 2
- Separation results via leader election problems Maria Grazia Vigliotti1,3
- Compositional Reasoning for Probabilistic Finite-State Behaviors
- The Replacement Operation for CCP Programs Marco Bertolino 1 , Sandro Etalle 2 , and Catuscia Palamidessi 3
- Axiomatizations for probabilistic finite-state Yuxin Deng a
- RECURSION VS REPLICATION IN PROCESS CALCULI: EXPRESSIVENESS
- On the Bayes Risk in Information-Hiding Konstantinos Chatzikokolakis Catuscia Palamidessi
- IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1 Model checking probabilistic and stochastic
- Anonymity Protocols as Noisy Channels Konstantinos Chatzikokolakis a
- A Framework for Analyzing Probabilistic Protocols and its Application to the Partial
- Tutorial on separation results in process calculi via leader election problems
- Bounds on the leakage of the input's distribution in information-hiding protocols
- Bounds on the leakage of the input's distribution in information-hiding protocols
- Formal approaches to Information-Hiding A tutorial
- Probable Innocence Revisited Konstantinos Chatzikokolakis a
- Anonymity in probabilistic and nondeterministic systems 1
- MFPS XX1 Preliminary Version Probabilistic and nondeterministic aspects of
- Separation of synchronous and asynchronous communication via testing
- Weak Probabilistic Anonymity Yuxin Deng1
- A Framework for Analyzing Probabilistic Protocols and its Application to the Partial
- LANGUAGES FOR CONCURRENCY Catuscia Palamidessi
- Universal Timed Concurrent Constraint Programming
- Partial Order and SOS Semantics for Linear Constraint Programs ?
- EXPRESS 2006 Diletta Cacciagrano 1
- A randomized encoding of the -calculus with mixed choice
- Probabilistic asynchronous calculus ? Oltea Mihaela Herescu and Catuscia Palamidessi
- Declarative Diagnosis of Temporal Concurrent Constraint Programs
- A Probabilistic Applied PiCalculus Jean Goubault-Larrecq1
- Anonymity Protocols as Noisy Channels Konstantinos Chatzikokolakis1
- Compositional Analysis for Concurrent Constraint Programming \Lambda Moreno Falaschi y Maurizio Gabbrielli z Kim Marriott x Catuscia Palamidessi --
- Expressiveness of Recursion, Replication and Scope Mechanisms in Process Calculi
- Embedding as a tool for Language Comparison Frank S. de Boer 1 and Catuscia Palamidessi 2
- Constraint Logic Programming with Dynamic Scheduling: A Semantics Based on Closure Operators \Lambda
- Asynchronous Communication in Process Algebra (Extended Abstract)
- storeasvaluation Proving Concurrent Constraint Programs Correct
