The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Catuscia Palamidessi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Moreno Falaschi, Giorgio Levi, Maurizio Martelli, Catuscia Palamidessi
    A New Declarative Semantics for Logic Languages. [Citation Graph (2, 0)][DBLP]
    ICLP/SLP, 1988, pp:993-1005 [Conf]
  2. Moreno Falaschi, Giorgio Levi, Catuscia Palamidessi, Maurizio Martelli
    Declarative Modeling of the Operational Behavior of Logic Languages. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:69, n:3, pp:289-318 [Journal]
  3. Marco Bertolino, Sandro Etalle, Catuscia Palamidessi
    The Replacement Operation for CCP Programs. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:441-454 [Conf]
  4. Moreno Falaschi, Maurizio Gabbrielli, Kim Marriott, Catuscia Palamidessi
    Confluence and Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    GULP-PRODE (1), 1994, pp:140-154 [Conf]
  5. Maurizio Martelli, Alessandro Messora, Catuscia Palamidessi, Alain Hui-Bon-Hoa
    Fixpoint Semantics of L lambda. [Citation Graph (0, 0)][DBLP]
    GULP-PRODE (1), 1994, pp:187-201 [Conf]
  6. Krzysztof R. Apt, Elena Marchiori, Catuscia Palamidessi
    A Theory of First-Order Built-in's of Prolog. [Citation Graph (0, 0)][DBLP]
    ALP, 1992, pp:69-83 [Conf]
  7. Catuscia Palamidessi
    Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    ALP, 1994, pp:1-2 [Conf]
  8. Frank S. de Boer, Catuscia Palamidessi
    On the Semantics of Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    ALPUK, 1992, pp:145-173 [Conf]
  9. Moreno Falaschi, Maurizio Gabbrielli, Kim Marriott, Catuscia Palamidessi
    Confluence in Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    AMAST, 1995, pp:531-545 [Conf]
  10. Yuxin Deng, Catuscia Palamidessi, Jun Pang
    Compositional Reasoning for Probabilistic Finite-State Behaviors. [Citation Graph (0, 0)][DBLP]
    Processes, Terms and Cycles, 2005, pp:309-337 [Conf]
  11. David Gilbert, Catuscia Palamidessi
    Concurrent Constraint Programming with Process Mobility. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:463-477 [Conf]
  12. Eike Best, Catuscia Palamidessi
    Linear Constraint Systems as High-Level Nets. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1996, pp:498-513 [Conf]
  13. Mohit Bhargava, Catuscia Palamidessi
    Probabilistic Anonymity. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:171-185 [Conf]
  14. Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
    The Failure of Failures in a Paradigm for Asynchronous Communication. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1991, pp:111-126 [Conf]
  15. Frank S. de Boer, Catuscia Palamidessi
    On the Asynchronous Nature of Communication in Concurrent Logic Languages: A Fully Abstract Model Based on Sequences. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:99-114 [Conf]
  16. Frank S. de Boer, Catuscia Palamidessi
    Embedding as a Tool for Language Comparison: On the CSP Hierarchy. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1991, pp:127-141 [Conf]
  17. Catuscia Palamidessi
    Expressiveness and Distributed Implementation of Conciurrent Calculi with Link Mobility. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:28-29 [Conf]
  18. Eike Best, Frank S. de Boer, Catuscia Palamidessi
    Partial Order and SOS Semantics for Linear Constraint Programs. [Citation Graph (0, 0)][DBLP]
    COORDINATION, 1997, pp:256-273 [Conf]
  19. Catuscia Palamidessi, Frank D. Valencia
    A Temporal Concurrent Constraint Programming Calculus. [Citation Graph (0, 0)][DBLP]
    CP, 2001, pp:302-316 [Conf]
  20. Catuscia Palamidessi, Mohit Bhargava
    Probabilistic Anonymity. [Citation Graph (0, 0)][DBLP]
    Foundations of Global Computing, 2005, pp:- [Conf]
  21. Alessandra Di Pierro, Catuscia Palamidessi
    A Logical Denotational Semantics for Constraint Logic Programming. [Citation Graph (0, 0)][DBLP]
    ESOP, 1994, pp:195-210 [Conf]
  22. Maria Grazia Vigliotti, Iain Phillips, Catuscia Palamidessi
    Separation Results Via Leader Election Problems. [Citation Graph (0, 0)][DBLP]
    FMCO, 2005, pp:172-194 [Conf]
  23. Yuxin Deng, Catuscia Palamidessi
    Axiomatizations for Probabilistic Finite-State Behaviors. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:110-124 [Conf]
  24. Oltea Mihaela Herescu, Catuscia Palamidessi
    Probabilistic Asynchronous pi-Calculus. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2000, pp:146-160 [Conf]
  25. Catuscia Palamidessi
    Algebraic Properties of Idempotent Substitutions. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:386-399 [Conf]
  26. Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
    Semantic Models for a Version of PARLOG. [Citation Graph (0, 0)][DBLP]
    ICLP, 1989, pp:621-636 [Conf]
  27. Frank S. de Boer, Catuscia Palamidessi
    A Process Algebra of Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1992, pp:463-477 [Conf]
  28. Giorgio Levi, Catuscia Palamidessi
    An Approach to the Declarative Semantics of Synchronization in Logic Languages. [Citation Graph (0, 0)][DBLP]
    ICLP, 1987, pp:877-893 [Conf]
  29. 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. [Citation Graph (0, 0)][DBLP]
    ICLP, 2006, pp:449-450 [Conf]
  30. Alessandra Di Pierro, Maurizio Martelli, Catuscia Palamidessi
    Negation as Instantitation: A New Rule for the Treatment of Negation in Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:32-45 [Conf]
  31. Konstantinos Chatzikokolakis, Catuscia Palamidessi
    Probable Innocence Revisited. [Citation Graph (0, 0)][DBLP]
    Formal Aspects in Security and Trust, 2005, pp:142-157 [Conf]
  32. Catuscia Palamidessi, Oltea Mihaela Herescu
    A Randomized Distributed Encoding of the Pi-Calculus with Mixed Choice. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:537-549 [Conf]
  33. Catuscia Palamidessi
    Constraint programming for concurrent and distributed computing. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1997, pp:11-0 [Conf]
  34. Frank S. de Boer, Jan Willem Klop, Catuscia Palamidessi
    Asynchronous Communication in Process Algebra [Citation Graph (0, 0)][DBLP]
    LICS, 1992, pp:137-147 [Conf]
  35. Moreno Falaschi, Maurizio Gabbrielli, Kim Marriott, Catuscia Palamidessi
    Compositional Analysis for Concurrent Constraint Programming [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:210-221 [Conf]
  36. Catuscia Palamidessi, Vijay A. Saraswat, Frank D. Valencia, Björn Victor
    On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:59-68 [Conf]
  37. Marco Bertolino, Sandro Etalle, Catuscia Palamidessi
    The Replacement Operation for CCP Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1999, pp:216-233 [Conf]
  38. Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
    Control Flow versus Logic: A Denotational and a Declarative Model for Guarded Horn Clauses. [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:165-176 [Conf]
  39. Marco Bellia, Pier Giorgio Bosco, Elio Giovannetti, Giorgio Levi, Corrado Moiso, Catuscia Palamidessi
    A Two-Level Approach to Logic plus Functional Programming Integration. [Citation Graph (0, 0)][DBLP]
    PARLE (1), 1987, pp:374-393 [Conf]
  40. Seif Haridi, Catuscia Palamidessi
    Structural Operational Semantics for Kernel Andorra Prolog. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1991, pp:238-253 [Conf]
  41. Catuscia Palamidessi, M. Pilquist
    A Randomized Solution to the Distributed Resource Allocation Problem. [Citation Graph (0, 0)][DBLP]
    IASTED PDCS, 2002, pp:247-252 [Conf]
  42. Catuscia Palamidessi
    Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    PLILP, 1994, pp:1-2 [Conf]
  43. Oltea Mihaela Herescu, Catuscia Palamidessi
    On the generalized dining philosophers problem. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:81-89 [Conf]
  44. Frank S. de Boer, Maurizio Gabbrielli, Elena Marchiori, Catuscia Palamidessi
    Proving Concurrent Constraint Programs Correct. [Citation Graph (0, 0)][DBLP]
    POPL, 1994, pp:98-108 [Conf]
  45. Catuscia Palamidessi
    Comparing the Expressive Power of the Synchronous and the Asynchronous pi-calculus. [Citation Graph (0, 0)][DBLP]
    POPL, 1997, pp:256-265 [Conf]
  46. Mogens Nielsen, Catuscia Palamidessi, Frank D. Valencia
    On the expressive power of temporal concurrent constraint programming languages. [Citation Graph (0, 0)][DBLP]
    PPDP, 2002, pp:156-167 [Conf]
  47. Catuscia Palamidessi
    Mobile calculi for distributed programming. [Citation Graph (0, 0)][DBLP]
    PPDP, 2002, pp:74-75 [Conf]
  48. Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
    On Blocks: Locality and Asynchronous Communication (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1992, pp:73-90 [Conf]
  49. Agostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato
    Complementation in Abstract Interpretation [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:100-117 [Conf]
  50. Frank S. de Boer, Maurizio Gabbrielli, Catuscia Palamidessi
    Proving Correctness of Constraint Logic Programs with Dynamic Scheduling. [Citation Graph (0, 0)][DBLP]
    SAS, 1996, pp:83-97 [Conf]
  51. Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
    Non-monotonic Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    ILPS, 1993, pp:315-334 [Conf]
  52. Frank S. de Boer, Catuscia Palamidessi
    Concurrent Logic Programming: Asynchronism and Language Comparison. [Citation Graph (0, 0)][DBLP]
    NACLP, 1990, pp:175-194 [Conf]
  53. Giorgio Levi, Maurizio Martelli, Catuscia Palamidessi
    Failure and Success made Symmetric. [Citation Graph (0, 0)][DBLP]
    NACLP, 1990, pp:3-22 [Conf]
  54. Giorgio Levi, Catuscia Palamidessi
    The Declarative Semantics of Logical Read-Only Variables. [Citation Graph (0, 0)][DBLP]
    SLP, 1985, pp:128-137 [Conf]
  55. Giorgio Levi, Catuscia Palamidessi, Pier Giorgio Bosco, Elio Giovannetti, Corrado Moiso
    A Complete Semantic Characterization of K-Leaf: A Logic Language with Partial Functions. [Citation Graph (0, 0)][DBLP]
    SLP, 1987, pp:318-327 [Conf]
  56. Maurizio Martelli, Alessandro Messora, Catuscia Palamidessi
    Fixpoint Semantics of L-lambda. [Citation Graph (0, 0)][DBLP]
    ILPS, 1993, pp:666- [Conf]
  57. Frank S. de Boer, Catuscia Palamidessi
    A Fully Abstract Model for Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:296-319 [Conf]
  58. Konstantinos Chatzikokolakis, Catuscia Palamidessi
    A Framework for Analyzing Probabilistic Protocols and Its Application to the Partial Secrets Exchange. [Citation Graph (0, 0)][DBLP]
    TGC, 2005, pp:146-162 [Conf]
  59. Krzysztof R. Apt, Elena Marchiori, Catuscia Palamidessi
    A Declarative Approach for First-Order Built-in's of Prolog. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1994, v:5, n:, pp:159-191 [Journal]
  60. Giorgio Levi, Catuscia Palamidessi
    Contributions to the Semantics of Logic Perpetual Processes. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1988, v:25, n:6, pp:691-711 [Journal]
  61. Oltea Mihaela Herescu, Catuscia Palamidessi
    Probabilistic asynchronous pi-calculus [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  62. Oltea Mihaela Herescu, Catuscia Palamidessi
    On the generalized dining philosophers problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  63. Catuscia Palamidessi
    Comparing the expressive power of the Synchronous and the Asynchronous pi-calculus [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  64. Dale Miller, Catuscia Palamidessi
    Foundational Aspects of Syntax. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1999, v:31, n:3es, pp:11- [Journal]
  65. Catuscia Palamidessi, Frank D. Valencia
    Recursion vs Replication in Process Calculi: Expressiveness. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:87, n:, pp:105-125 [Journal]
  66. Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi
    Separation of Synchronous and Asynchronous Communication Via Testing. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:154, n:3, pp:95-108 [Journal]
  67. Ilaria Castellani, Catuscia Palamidessi
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:16, n:2, pp:- [Journal]
  68. Yuxin Deng, Tom Chothia, Catuscia Palamidessi, Jun Pang
    Metrics for Action-labelled Quantitative Transition Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:153, n:2, pp:79-96 [Journal]
  69. Raymond McDowell, Dale Miller, Catuscia Palamidessi
    Encoding Transition Systems in Sequent Calculus. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1996, v:3, n:, pp:- [Journal]
  70. Catuscia Palamidessi
    On the Expressive Power of Temporal Concurrent Constraint Programming Languages (invited talk). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:68, n:2, pp:- [Journal]
  71. Catuscia Palamidessi
    Probabilistic and Nondeterministic Aspects of Anonymity. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:155, n:, pp:33-42 [Journal]
  72. Catuscia Palamidessi, Joachim Parrow
    Foreword. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:7, n:, pp:- [Journal]
  73. Axelle Ziegler, Dale Miller, Catuscia Palamidessi
    A Congruence Format for Name-passing Calculi. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:156, n:1, pp:169-189 [Journal]
  74. Catuscia Palamidessi
    Anonymity in Probabilistic and Nondeterministic Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:162, n:, pp:277-279 [Journal]
  75. Sylvain Pradalier, Catuscia Palamidessi
    Expressiveness of Probabilistic pi. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:164, n:3, pp:119-136 [Journal]
  76. Frank S. de Boer, Catuscia Palamidessi
    Embedding as a Tool for Language Comparison [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:108, n:1, pp:128-157 [Journal]
  77. Moreno Falaschi, Maurizio Gabbrielli, Kim Marriott, Catuscia Palamidessi
    Constraint Logic Programming with Dynamic Scheduling: A Semantics Based on Closure Operators. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:137, n:1, pp:41-67 [Journal]
  78. Moreno Falaschi, Giorgio Levi, Maurizio Martelli, Catuscia Palamidessi
    A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:103, n:1, pp:86-113 [Journal]
  79. Moreno Falaschi, Giorgio Levi, Catuscia Palamidessi
    A Synchronization Logic: Axiomatics and Formal Semantics of Generalized Horn Clauses [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:60, n:1-3, pp:36-69 [Journal]
  80. Catuscia Palamidessi, Joachim Parrow, Rob J. van Glabbeek
    Preface. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:156, n:1-2, pp:1- [Journal]
  81. Alessandra Di Pierro, Maurizio Martelli, Catuscia Palamidessi
    Negation as Instantiation [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:120, n:2, pp:263-278 [Journal]
  82. Elio Giovannetti, Giorgio Levi, Corrado Moiso, Catuscia Palamidessi
    Kernel-LEAF: A Logic plus Functional Language. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:42, n:2, pp:139-185 [Journal]
  83. Catuscia Palamidessi
    Editorial: Selected Papers from the Joint International Symposium PLILP/ALP'98 [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 1999, v:1999, n:Special Issue 2, pp:- [Journal]
  84. Pier Giorgio Bosco, Elio Giovannetti, Corrado Moiso, Catuscia Palamidessi
    Comments on "Logic-Programming with Equations". [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1991, v:11, n:1&2, pp:85-89 [Journal]
  85. Frank S. de Boer, Alessandra Di Pierro, Catuscia Palamidessi
    An Algebraic Perspective of Constraint Logic Programming. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1997, v:7, n:1, pp:1-38 [Journal]
  86. Catuscia Palamidessi
    Comparing The Expressive Power Of The Synchronous And Asynchronous Pi-Calculi. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2003, v:13, n:5, pp:685-719 [Journal]
  87. Mogens Nielsen, Catuscia Palamidessi, Frank D. Valencia
    Temporal Concurrent Constraint Programming: Denotation, Logic and Applications. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2002, v:9, n:1, pp:145-188 [Journal]
  88. Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
    From Failure to Success: Comparing a Denotational and a Declarative Semantics for Horn Clause Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:101, n:2, pp:239-263 [Journal]
  89. Frank S. de Boer, Alessandra Di Pierro, Catuscia Palamidessi
    Nondeterminism and Infinite Computations in Constraint Programming. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:151, n:1, pp:37-78 [Journal]
  90. Frank S. de Boer, Jan J. M. M. Rutten, Joost N. Kok, Catuscia Palamidessi
    Semantic Models for Concurrent Logic Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:86, n:1, pp:3-33 [Journal]
  91. Konstantinos Chatzikokolakis, Catuscia Palamidessi
    Probable innocence revisited. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:367, n:1-2, pp:123-138 [Journal]
  92. Moreno Falaschi, Maurizio Gabbrielli, Kim Marriott, Catuscia Palamidessi
    Confluence in Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:183, n:2, pp:281-315 [Journal]
  93. Raymond McDowell, Dale Miller, Catuscia Palamidessi
    Encoding transition systems in sequent calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:294, n:3, pp:411-437 [Journal]
  94. Catuscia Palamidessi
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:253, n:2, pp:153- [Journal]
  95. Catuscia Palamidessi, Oltea Mihaela Herescu
    A randomized encoding of the Pi-calculus with mixed choice. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:335, n:2-3, pp:373-404 [Journal]
  96. Yuxin Deng, Catuscia Palamidessi
    Axiomatizations for probabilistic finite-state behaviors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:373, n:1-2, pp:92-114 [Journal]
  97. Frank S. de Boer, Maurizio Gabbrielli, Elena Marchiori, Catuscia Palamidessi
    Proving Concurrent Constraint Programs Correct. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1997, v:19, n:5, pp:685-725 [Journal]
  98. Agostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato
    Complementation in Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1997, v:19, n:1, pp:7-47 [Journal]
  99. Konstantinos Chatzikokolakis, Catuscia Palamidessi
    Making Random Choices Invisible to the Scheduler. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2007, pp:42-58 [Conf]
  100. Carlos Olarte, Catuscia Palamidessi, Frank Valencia
    Universal Timed Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 2007, pp:464-465 [Conf]
  101. Moreno Falaschi, Carlos Olarte, Catuscia Palamidessi, Frank Valencia
    Declarative Diagnosis of Temporal Concurrent Constraint Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 2007, pp:271-285 [Conf]
  102. Konstantinos Chatzikokolakis, Catuscia Palamidessi
    Making Random Choices Invisible to the Scheduler [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  103. Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi
    Fair Pi. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:175, n:3, pp:3-26 [Journal]
  104. Yuxin Deng, Catuscia Palamidessi, Jun Pang
    Weak Probabilistic Anonymity. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:180, n:1, pp:55-76 [Journal]
  105. Giuseppe F. Italiano, Catuscia Palamidessi
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:1- [Journal]

  106. Concurrent and Reactive Constraint Programming. [Citation Graph (, )][DBLP]


  107. A Probabilistic Applied Pi-Calculus. [Citation Graph (, )][DBLP]


  108. On the Asynchronous Nature of the Asynchronous pi-Calculus. [Citation Graph (, )][DBLP]


  109. Information Flow in Interactive Systems. [Citation Graph (, )][DBLP]


  110. Probability of Error in Information-Hiding Protocols. [Citation Graph (, )][DBLP]


  111. On Recursion, Replication and Scope Mechanisms in Process Calculi. [Citation Graph (, )][DBLP]


  112. Compositional Methods for Information-Hiding. [Citation Graph (, )][DBLP]


  113. Probable Innocence in the Presence of Independent Knowledge. [Citation Graph (, )][DBLP]


  114. Probabilistic Information Flow. [Citation Graph (, )][DBLP]


  115. Compositionality of Secure Information Flow. [Citation Graph (, )][DBLP]


  116. A framework for abstract interpretation of timed concurrent constraint programs. [Citation Graph (, )][DBLP]


  117. Symbolic Bisimulations for Probabilistic Systems. [Citation Graph (, )][DBLP]


  118. Model checking the probabilistic pi-calculus. [Citation Graph (, )][DBLP]


  119. Reconciling Belief and Vulnerability in Information Flow. [Citation Graph (, )][DBLP]


  120. Computing the Leakage of Information-Hiding Systems. [Citation Graph (, )][DBLP]


  121. Formal Approaches to Information-Hiding (Tutorial). [Citation Graph (, )][DBLP]


  122. Bounds on the Leakage of the Input's Distribution in Information-Hiding Protocols. [Citation Graph (, )][DBLP]


  123. Anonymity Protocols as Noisy Channels. [Citation Graph (, )][DBLP]


  124. Explicit fairness in testing semantics [Citation Graph (, )][DBLP]


  125. Preface. [Citation Graph (, )][DBLP]


  126. Preface. [Citation Graph (, )][DBLP]


  127. Quantitative Notions of Leakage for One-try Attacks. [Citation Graph (, )][DBLP]


  128. Preface. [Citation Graph (, )][DBLP]


Search in 0.552secs, Finished in 0.559secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002