BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × Canada
1 × Cyprus
1 × Estonia
1 × Hungary
1 × Switzerland
10 × USA
2 × France
2 × Portugal
2 × Spain
3 × Germany
3 × Italy
5 × United Kingdom
Collaborated with:
F.S.d.Boer G.Levi M.Martelli F.D.Valencia C.Olarte M.E.Andrés M.Falaschi A.D.Pierro Y.Deng I.Gazeau D.Miller M.S.Alvim K.Chatzikokolakis F.Valencia M.Gabbrielli E.Marchiori M.Stronati S.Pradalier D.R.Gilbert O.M.Herescu C.Braun M.Nielsen M.Bertolino S.Etalle A.Messora K.R.Apt J.W.Klop P.v.Rossum G.Smith V.A.Saraswat B.Victor T.Chothia J.Pang J.N.Kok J.J.M.M.Rutten A.Aristizábal F.Bonchi L.F.Pino H.A.López J.A.Pérez C.Rueda A.Cortesi G.Filé R.Giacobazzi F.Ranzato P.G.Bosco E.Giovannetti C.Moiso
Talks about:
program (20) constraint (16) concurr (14) logic (9) semant (7) languag (5) declar (5) probabilist (4) asynchron (4) express (4)

Person: Catuscia Palamidessi

DBLP DBLP: Palamidessi:Catuscia

Facilitated 4 volumes:

ICALP 2005Ed
ICLP 2003Ed
CL 2000Ed
ALP/PLILP 1998Ed

Contributed to:

QAPL 20132013
QAPL 20122012
FOSSACS 20112011
ICALP (2) 20112011
LICS 20102010
TACAS 20102010
PPDP 20092009
FoSSaCS 20082008
ICLP 20072007
ICLP 20062006
LICS 20062006
QAPL 20062006
FoSSaCS 20052005
QAPL 20052006
PPDP 20022002
CL 20002000
FoSSaCS 20002000
LOPSTR 19991999
POPL 19971997
SAS 19961996
SAS 19951995
ALP 19941994
ESOP 19941994
PLILP 19941994
POPL 19941994
ILPS 19931993
ALP 19921992
JICSLP 19921992
LICS 19921992
ICLP 19911991
ICALP 19901990
NACLP 19901990
ICLP/SPL 19881988
ICLP 19871987
SLP 19871987
SLP 19851985
TAPSOFT, Vol.1: CAAP 19911991

Wrote 42 papers:

QAPL-2013-GazeauMP #difference #privacy #semantics
Preserving differential privacy under finite-precision semantics (IG, DM, CP), pp. 1–18.
QAPL-2012-GazeauMP #analysis #float #robust #source code
A non-local method for robustness analysis of floating point programs (IG, DM, CP), pp. 63–76.
QAPL-2012-PalamidessiS #algebra #bound #constraints #difference #privacy #relational
Differential Privacy for Relational Algebra: Improving the Sensitivity Bounds via Constraint Systems (CP, MS), pp. 92–105.
FoSSaCS-2011-AristizabalBPPV #concurrent #constraints #programming #similarity
Deriving Labels and Bisimilarity for Concurrent Constraint Programming (AA, FB, CP, LFP, FDV), pp. 138–152.
ICALP-v2-2011-AlvimACP #data flow #difference #on the #privacy
On the Relation between Differential Privacy and Quantitative Information Flow (MSA, MEA, KC, CP), pp. 60–76.
LICS-2010-AlvimAP #data flow #probability
Probabilistic Information Flow (MSA, MEA, CP), pp. 314–321.
TACAS-2010-AndresPRS #information management
Computing the Leakage of Information-Hiding Systems (MEA, CP, PvR, GS), pp. 373–389.
PPDP-2009-FalaschiOP #abstract interpretation #concurrent #constraints #framework #source code
A framework for abstract interpretation of timed concurrent constraint programs (MF, CO, CP), pp. 207–218.
FoSSaCS-2008-BraunCP #composition #information management
Compositional Methods for Information-Hiding (CB, KC, CP), pp. 443–457.
ICLP-2007-FalaschiOPV #concurrent #constraints #declarative #source code
Declarative Diagnosis of Temporal Concurrent Constraint Programs (MF, CO, CP, FV), pp. 271–285.
ICLP-2007-OlartePV #concurrent #constraints #programming
Universal Timed Concurrent Constraint Programming (CO, CP, FV), pp. 464–465.
ICLP-2006-LopezPPRV #concurrent #constraints #declarative #framework #programming #security
A Declarative Framework for Security: Secure Concurrent Constraint Programming (HAL, CP, JAP, CR, FDV), pp. 449–450.
LICS-2006-PalamidessiSVV #on the #persistent #π-calculus
On the Expressiveness of Linearity vs Persistence in the Asychronous π-Calculus (CP, VAS, FDV, BV), pp. 59–68.
QAPL-2006-PradalierP #probability
Expressiveness of Probabilistic pi (SP, CP), pp. 119–136.
FoSSaCS-2005-DengP #axiom #behaviour #finite #probability
Axiomatizations for Probabilistic Finite-State Behaviors (YD, CP), pp. 110–124.
QAPL-2005-DengCPP06 #metric
Metrics for Action-labelled Quantitative Transition Systems (YD, TC, CP, JP), pp. 79–96.
PPDP-2002-NielsenPV #concurrent #constraints #on the #power of #programming language
On the expressive power of temporal concurrent constraint programming languages (MN, CP, FDV), pp. 156–167.
PPDP-2002-Palamidessi #calculus #distributed #mobile #programming
Mobile calculi for distributed programming (CP), pp. 74–75.
CL-2000-GilbertP #concurrent #constraints #process #programming
Concurrent Constraint Programming with Process Mobility (DRG, CP), pp. 463–477.
FoSSaCS-2000-HerescuP #probability #π-calculus
Probabilistic Asynchronous π-Calculus (OMH, CP), pp. 146–160.
LOPSTR-1999-BertolinoEP #source code
The Replacement Operation for CCP Programs (MB, SE, CP), pp. 216–233.
POPL-1997-Palamidessi #power of #π-calculus
Comparing the Expressive Power of the Synchronous and the Asynchronous π-calculus (CP), pp. 256–265.
SAS-1996-BoerGP #constraints #correctness #logic programming #proving #scheduling #source code
Proving Correctness of Constraint Logic Programs with Dynamic Scheduling (FSdB, MG, CP), pp. 83–97.
SAS-1995-CortesiFGPR #abstract interpretation
Complementation in Abstract Interpretation (AC, GF, RG, CP, FR), pp. 100–117.
ALP-1994-Palamidessi #concurrent #constraints #programming
Concurrent Constraint Programming (CP), pp. 1–2.
ESOP-1994-PierroP #constraints #logic #logic programming #semantics
A Logical Denotational Semantics for Constraint Logic Programming (ADP, CP), pp. 195–210.
PLILP-1994-Palamidessi #concurrent #constraints #programming
Concurrent Constraint Programming (CP), pp. 1–2.
POPL-1994-BoerGMP #concurrent #constraints #proving #source code
Proving Concurrent Constraint Programs Correct (FSdB, MG, EM, CP), pp. 98–108.
ILPS-1993-BoerKPR #concurrent #constraints #programming
Non-monotonic Concurrent Constraint Programming (FSdB, JNK, CP, JJMMR), pp. 315–334.
ILPS-1993-MartelliMP #fixpoint #semantics
Fixpoint Semantics of L-λ (MM, AM, CP), p. 666.
ALP-1992-AptMP #first-order #formal method #prolog
A Theory of First-Order Built-in’s of Prolog (KRA, EM, CP), pp. 69–83.
JICSLP-1992-BoerP #algebra #concurrent #constraints #process #programming
A Process Algebra of Concurrent Constraint Programming (FSdB, CP), pp. 463–477.
LICS-1992-BoerKP #algebra #communication #process
Asynchronous Communication in Process Algebra (FSdB, JWK, CP), pp. 137–147.
ICLP-1991-PierroMP #logic programming
Negation as Instantitation: A New Rule for the Treatment of Negation in Logic Programming (ADP, MM, CP), pp. 32–45.
ICALP-1990-Palamidessi #algebra
Algebraic Properties of Idempotent Substitutions (CP), pp. 386–399.
NACLP-1990-BoerP #comparison #concurrent #logic programming
Concurrent Logic Programming: Asynchronism and Language Comparison (FSdB, CP), pp. 175–194.
NACLP-1990-LeviMP #symmetry
Failure and Success made Symmetric (GL, MM, CP), pp. 3–22.
JICSCP-1988-FalaschiLMP88 #declarative #logic #semantics
A New Declarative Semantics for Logic Languages (MF, GL, MM, CP), pp. 993–1005.
ICLP-1987-LeviP87 #approach #declarative #logic #semantics
An Approach to the Declarative Semantics of Synchronization in Logic Languages (GL, CP), pp. 877–893.
SLP-1987-LeviPBGM87 #logic #semantics
A Complete Semantic Characterization of K-Leaf: A Logic Language with Partial Functions (GL, CP, PGB, EG, CM), pp. 318–327.
SLP-1985-LeviP85 #declarative #logic #semantics
The Declarative Semantics of Logical Read-Only Variables (GL, CP), pp. 128–137.
CAAP-1991-BoerP #concurrent #constraints #programming
A Fully Abstract Model for Concurrent Constraint Programming (FSdB, CP), pp. 296–319.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.