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