List of Publications of Catuscia Palamidessi
Journals
Proceedings
of International Conferences
Book Chapters
Other Works
Lecture Notes
Back to Catuscia Palamidessi's home page
Please send suggestions and comments to Catuscia Palamidessi:
firstname@lix.polytechnique.fr
Last Updated: April 15, 2004.
Journals
- C. Palamidessi. Comparing the Expressive Power of the Synchronous and the Asynchronous
pi-calculus.
Mathematical Structures in Computer Science, 13(5): 685-719, 2003.
(pdf,
ps.)
- R. McDowell, D. Miller, C. Palamidessi. Encoding Transition Systems in Sequent Calculus.
Theoretical Computer Science, 294(3): 411-437, 2003.
(Abstract,
ps.)
- M. Nielsen, C. Palamidessi, F.D. Valencia.
Temporal Concurrent Constraint Programming: Denotation, Logic and Applications.
Nordic Journal of Computing, 9(1): 145-188, 2002.
(ps.)
-
D. Miller, C. Palamidessi. Foundational Aspects of Syntax.
ACM Computing Surveys, 31(3es):11, 1999.
(ps.)
-
F.S. de Boer,
M. Gabbrielli, E. Marchiori, C. Palamidessi.
Proving Concurrent Constraint Programs Correct.
ACM-TOPLAS, 19(5):685-725, 1998.
(Abstract,
ps.)
-
M. Falaschi, M. Gabbrielli, K. Marriott, C. Palamidessi.
Confluence in Concurrent Constraint Programming.
Theoretical Computer Science, 183(2):281-315,
1997. (Abstract,
ps.)
-
M. Falaschi, M. Gabbrielli, K. Marriott, C. Palamidessi.
Constraint Logic Programming with Dynamic
Scheduling: A Semantics Based on Closure Operators.
Information and Computation, 137(1):41-67,
1997. (ps.)
-
A. Cortesi, G. File', R. Giacobazzi, F. Ranzato, C. Palamidessi.
Complementation in Abstract Interpretation.
ACM-TOPLAS,
19(1):7-47, 1997. (Abstract,
ps.)
-
F.S. de Boer, A. Di Pierro, C. Palamidessi.
An algebraic perspective of constraint logic programming.
Journal of Logic and Computation,
7(1): 1-38, 1997.
(Abstract,
ps.)
-
R. Giacobazzi, F. Ranzato, C. Palamidessi.
Weak Relative Pseudo-Complements of Closure Operators.
Algebra Universalis, 36(3): 405-412, 1996.
(Abstract,
ps.)
-
F.S. de Boer, A. Di Pierro, C. Palamidessi.
Infinite computations in nondeterministic constraint programming.
Theoretical Computer Science, 151(1):37-78, 1995.
(Abstract,
ps.)
-
A. Di Pierro, M. Martelli, C. Palamidessi.
Negation as Instantiation.
Information and Computation, 120(2):263-278, 1995.
(Abstract,
ps.)
-
K.R. Apt, E. Marchiori, C. Palamidessi.
A Declarative Approach for First-Order Built-in's of Prolog.
Applicable Algebra in Engineering, Communication
and Computing, 5(3/4):159-191, 1994. (Abstract,
ps.)
-
F.S. de Boer, C. Palamidessi.
Embedding as a Tool for Language Comparison.
Information and Computation. 108(1):128-157, 1994.
(Abstract,
ps.)
-
M. Falaschi, G. Levi, M. Martelli, C. Palamidessi.
A model-theoretic reconstruction of the operational semantics of logic
programs.
Information and Computation, 103(1):86-113, 1993.
(Abstract.)
-
S. Haridi, S. Janson, C. Palamidessi.
Structural tranformational semantics for Kernel Andorra Prolog.
Future Generation Computer Systems,
8(4):409-421, 1992.
-
F.S. de Boer, J.N. Kok, C. Palamidessi, J.J.M.M. Rutten.
From failure to success: Comparing a denotational and a declarative
semantics for Horn Clause Logic.
Theoretical Computer Science, 101(2):239-263,
1992.
-
P.G. Bosco, E. Giovannetti, C. Moiso, C. Palamidessi.
Logic programming with equations.
Journal of Logic Programming, 11(1):85-89, 1991.
-
F.S. de Boer, J.N. Kok, C. Palamidessi, J.J.M.M. Rutten.
Semantic models for Concurrent Logic Languages.
Theoretical Computer Science, 86(1):3-33,
1991.
-
E. Giovannetti,
G. Levi, C. Moiso, C. Palamidessi.
Kernel LEAF: a logic plus functional language. Journal of Computer and System Sciences,
42(2):139-185, 1991. (Abstract.)
-
M. Falaschi, G. Levi, M. Martelli, C. Palamidessi.
Declarative modeling of the operational behaviour of logic languages.
Theoretical Computer Science,
69(3):289-318, 1989. (Abstract.)
-
G. Levi, C. Palamidessi.
Contributions to the semantics of logic perpetual processes.
Acta Informatica, 25(6):691-711, 1988.
-
M. Falaschi, G. Levi, C. Palamidessi.
A synchronization logic: Axiomatics and formal semantics of generalized
Horn clauses. Information and Control,
60(1-3):36-69, 1984.
Proceedings of International Conferences
-
C. Palamidessi, O.M. Herescu.
A Randomized Distributed Encoding of the Pi-Calculus with Mixed
Choice.
Proc. of IFIP-TCS 2002, pages 537-549, Kluwer, 2002.
(ps,
ps of report version.)
-
M. Nielsen, C. Palamidessi, F.D. Valencia.
On the expressive power of temporal concurrent constraint
programming languages.
Proc. of the 4th international ACM SIGPLAN
conference on Principles and Practice of Declarative Programming
(PPDP), pages 156-167, ACM, 2002.
(ps.)
-
C. Palamidessi.
Mobile calculi for distributed programming. Proc. of the 4th international ACM SIGPLAN
conference on Principles and Practice of Declarative Programming (PPDP), ACM,
2002. Invited Talk.
-
C. Palamidessi, F.D. Valencia.
A Temporal Concurrent Contraint Programming Calculus.
In T. Walsh, ed., Proc. of CP 2001,
vol. 2239 of
LNCS, pages 302-316, Springer-Verlag, 2001.
(BibTeX entry,
ps.)
-
O.M. Herescu, C. Palamidessi.
On the Generalized Dining Philosophers Problem.
Proc. of the 20th ACM Symposium on Principles of Distributed Computing (PODC),
pages 81-89, ACM, 2001.
(Abstract,
BibTeX entry,
ps.)
-
D. Gilbert, C. Palamidessi.
Concurrent Constraint Programming with Process Mobility.
In J. Lloyd et al., eds., Proc. of CL 2000,
vol. 1861 of LNAI, pages 463-477.
Springer-Verlag, 2000.
(Abstract
BibTeX entry,
ps.)
-
O.M. Herescu, C. Palamidessi.
Probabilistic asynchronous $\pi$-calculus.
In J. Tiuryn, ed., Proc. of FOSSACS 2000
(Part of ETAPS 2000), vol. 1784 of
LNCS, pages 146--160. Springer-Verlag, 2000.
(Abstract,
ps,
BibTeX entry,
ps of report version.)
-
M. Bertolino, S. Etalle, C. Palamidessi.
The Replacement Operation for CCP Programs.
In A. Bossi, ed., Proc. of LOPSTR'99,
vol. 1817 of LNCS, pages 216-233.
Springer-Verlag, 2000.
(Abstract,
ps.)
-
C. Palamidessi.
Expressiveness and Distributed Implementation of
Concurrent Calculi with Link Mobility.
In J.C.M. Baeten and S. Mauw, Eds.,
Proc. of CONCUR'99, vol. 1664 of
LNCS, pages 28-29. Springer-Verlag, 1999.
Invited talk.
-
M. Bertolino, S. Etalle, C. Palamidessi.
Transformations of CCP Programs: preliminary results.
In M.C. Meo and M. Vilares Ferro, eds.,
Proc. of APPIA/GULP/PRODE'99, pages 441-454.
Gruppo Tipografico Editoriale, 1999.
-
E. Best, F.S. de Boer, C. Palamidessi.
Partial Order and SOS Semantics for Linear Constraint
Programs. (With E. Best and F.S. de Boer.) Proc. of Coordination
97, vol. 1282 of LNCS, pages
256-273. Springer-Verlag, 1997. (ps.)
-
C. Palamidessi.
Constraint Programming for Concurrent and
Distributed Computing. Proc. of the JFPLC-UNIF '97, Hermes Editions,
pages 11-20, 1997. Invited talk.
-
C. Palamidessi.
Comparing the expressive power of the Synchronous
and the Asynchronous pi-calculus. Proc. of the 24th ACM Symposium
on Principles of Programming Languages (POPL), pages 256-265, ACM,
1997. (Abstract,
ps.)
-
F.S. de Boer, M. Gabbrielli, C. Palamidessi.
Proving Correctness of Constraint Logic Programs
with Dynamic Scheduling. In
R. Cousot and D.A. Schmidt, eds., Proc. of the Static Analysis Symposium
(SAS 96), vol. 1145 of LNCS,
pages 83-97. Springer-Verlag, 1996.
(ps.)
-
E. Best, C. Palamidessi.Linear Constraint Systems as High-level Nets.
In U. Montanari and V. Sassone, eds., Proc. of CONCUR
96, vol. 1119 of LNCS, pages
498-513. Springer-Verlag, 1996. (ps.)
-
R. McDowell, D. Miller, C. Palamidessi.
Encoding Transition Systems in Sequent Calculus: Preliminary Report.
Proc. of the Linear Logic Workshop, Tokyo, 29 March-2 April 1996.
Vol.
3 of ENTCS.
(dvi)
(ps)
(Abstract).
-
A. Cortesi, G. File', R. Giacobazzi, F. Ranzato, C. Palamidessi.
Complementation in Abstract Interpretation.
Proc. of the Static Analysis Symposium (SAS). Vol. 983 of Lecture Notes
in Computer Science, pages 100-117. Springer-Verlag, 1995. (Abstract
and postscript available of the full
version, same title.)
-
M. Falaschi, M. Gabbrielli, K. Marriott, C. Palamidessi.
Confluence and Concurrent Constraint Programming.
Proc. of the Fourth
International Conference on Algebraic Methodology and Software Technology
(AMAST). Vol. 936 of LNCS, pages
531-545. Springer-Verlag, 1995. (Abstract and postscript available of the
full version: Confluence in Concurrent
Constraint Programming.)
-
K. Marriott, M. Falaschi, M. Gabbrielli, C. Palamidessi.
A Simple Semantics for Logic Programming Languages with Dynamic Scheduling.
Proc. of the 18th
Australian Computer Science Conference (ACSC), Adelaide, Australia,
1995. (Postscript available of the full version: Constraint
Logic Programming with Dynamic Scheduling: A Semantics Based on Closure
Operators.)
-
C. Palamidessi.
Concurrent Constraint Programming. Proc.
of ALP-PLILP Volumes 844 and 850 of LNCS,
Springer-Verlag, 1994. Invited talk.
-
A. Di Pierro, C. Palamidessi. A Logical Denotational Semantics for Constraint Logic
Programming. In D. Sannella, ed., Proc.
of Programming Languages and Systems (ESOP), Vol. 788 of Lecture
Notes in Computer Science, pages 195-210. Springer-Verlag, 1994. (Abstract
and postscript available of the full version: An
algebraic perspective of constraint logic programming.)
-
F.S. de Boer, M. Gabbrielli, E. Marchiori, C. Palamidessi.
Proving Concurrent Constraint Programs Correct.
Proc. of the twentieth
ACM Symposium on Principles of Programming Languages (POPL), pages
98-108, ACM, 1994. (Abstract,
ps.)
-
F.S. de Boer, J.N. Kok, C. Palamidessi, J.J.M.M. Rutten.
Non-Monotonic Concurrent Constraint Programming.
In D. Miller, ed., Proc. of the International
Logic Programming Symposium, pages 315-334, The MIT press, 1993.
-
M. Falaschi, M. Gabbrielli, K. Marriott, C. Palamidessi.
Compositional Analysis for Concurrent Constraint
Programming.
Proc. of the Eight Annual
IEEE Symposium on Logic in Computer Science, (LICS), pages 210-221.
IEEE Computer Society Press, Los Alamitos, California, 1993.
(Abstract,
ps.)
-
F.S. de Boer, C. Palamidessi.
A process algebra for concurrent constraint programming. (With F.S.
de Boer.) In Proc. of the International Symposium and Conference of
Logic Programming, pages 463-477, The MIT Press, 1992.
-
F.S. de Boer, J.N. Kok, C. Palamidessi, J.J.M.M. Rutten.
On Blocks: locality and asynchronous communication.
Proc. of REX workshop
on Semantics - Foundations and Applications. Vol. 666 of Lecture
Notes in Computer Science, pages 73-90. Springer-Verlag, 1992.
-
K.R. Apt, E. Marchiori, C. Palamidessi.
A Theory of First-Order Built-in's of Prolog.
(With K.R. Apt and E. Marchiori.) Proc. of the Third Int. Conf. on Algebraic
and Logic Programming (ALP). Vol. 632 of Lecture Notes in Computer
Science, pages 69-83. Springer-Verlag, 1992. (Abstract and postscript
available of the full version: A Declarative
Approach for First-Order Built-in's of Prolog.)
-
F.S. de Boer, C. Palamidessi.
On the semantics of concurrent constraint
programming.
Invited paper in Proc. of ALPUK 92, Workshops in Computing,
pages 145-173. Springer-Verlag, 1992.
-
F.S. de Boer, J.W. Klop, C. Palamidessi.
Asynchronous communication in process
algebra.
In Proc. of the seventh annual IEEE symposium on Logics
in Computer Science (LICS), pages 137-147. IEEE Computer Society Press,
Los Alamitos, California, 1992. (Abstract,
ps.)
-
F.S. de Boer, J.N. Kok, C. Palamidessi, J.J.M.M. Rutten.
The failure of failures: Towards a paradigm for
asynchronous communication. (With F.S. de Boer, J.N. Kok, and J.J.M.M.
Rutten.) In J.C.M. Baeten and J.F. Groote, eds., Proc. of CONCUR
91, vol. 527 of LNCS, pages 111-126.
Springer-Verlag, 1991. (Abstract and postscript available of the full version:
A paradigm for asynchronous communication
and its application to concurrent constraint programming.)
-
F.S. de Boer, C. Palamidessi.
Embedding as a tool for language comparison:
On the CSP hierarchy. In J.C.M. Baeten and J.F.
Groote, eds., Proc. of CONCUR 91, vol. 527 of Lecture Notes
in Computer Science, pages 127-141. Springer-Verlag, 1991.
-
F.S. de Boer, C. Palamidessi.
A Fully Abstract Model for Concurrent Constraint
Programming. In S. Abramsky and T.S.E. Maibaum,
eds., Proc. of TAPSOFT/CAAP, vol. 493 of Lecture Notes in
Computer Science, pages 296-319. Springer-Verlag, 1991. (Abstract,
ps.)
-
A. Di Pierro, M. Martelli, C. Palamidessi.
Negation As Instantiation: a New Rule for the Treatment
of Negation in Logic Programming.
In K. Furukawa, ed., Proc. of The Eight International Conference
on Logic Programming, pages 32-48, The MIT press, 1991. (Abstract and
postscript available of the full version: Negation
as Instantiation.)
-
S. Haridi, C. Palamidessi.
Structural tranformational semantics for Kernel Andorra Prolog.
In E.H.L. Aarts, J. van Leeuwen, and M. Rem, eds.,
Proc.of PARLE, vol. 505, II of LNCS,
pages 238-253. Springer-Verlag, 1991.
-
F.S. de Boer, C. Palamidessi.
On the asynchronous nature of communication in concurrent logic languages:
A fully abstract model based on sequences. In
J.C.M. Baeten and J.W. Klop, eds., Proc. of Concur 90, vol.
458 of LNCS, pages 99-114, Amsterdam,
1990. Springer-Verlag.
-
F.S. de Boer, C. Palamidessi.
Concurrent logic languages: Asynchronism and
language comparison. In Proc. of the North
American Conference on Logic Programming, pages 175-194.
The MIT Press, Series in Logic Programming, 1990. (This work contains preliminary results which have
been further developed in the papers Embedding
as a Tool for Language Comparison and A
Fully Abstract Model for Concurrent Constraint Programming.)
-
G. Levi, M. Martelli, C. Palamidessi.
Failure and success made symmetric.
In Proc. of the North American Conference on Logic Programming,
pages 3-22.
The MIT Press, Series in Logic Programming,
1990.
-
F.S. de Boer, J.N. Kok, C. Palamidessi, J.J.M.M. Rutten.
From failure to success: Comparing a denotational and a declarative
semantics for Horn Clause Logic. In M.Z. Kwiatkowska, M.W. Shields, and R.M. Thomas, eds.,
Proc. of the International Workshop on Semantics for Concurrency,
Workshops in Computing, pages 38-60, Leicester. Springer-Verlag,
1990.
-
C. Palamidessi.
Algebraic properties of idempotent substitutions. In M.S. Paterson,
ed., Proc. of the 17th International Colloquium on Automata, Languages
and Programming (ICALP), vol. 443 of Lecture Notes in Computer
Science, pages 386-399, Warwick, England, 1990. Springer-Verlag. (Poscript
of the full version available as a report.)
-
F.S. de Boer, J.N. Kok, C. Palamidessi, J.J.M.M. Rutten.
Semantic models for a version of PARLOG.
In Giorgio Levi and Maurizio Martelli, eds.,
Proc. of the Sixth International Conference on Logic Programming,
Series in Logic Programming, pages 621-636, Lisboa, 1989. The MIT Press.
-
F.S. de Boer, J.N. Kok, C. Palamidessi, J.J.M.M. Rutten.
Control flow versus logic: a denotational and a declarative model for
Guarded Horn Clauses.
In A. Kreczmar and G. Mirkowska, eds., Proc. of the Symposium on
Mathematical Foundations of Computer Science (MFCS), vol. 379 of
LNCS, pages 165-176. Springer Verlag,
1989.
-
M. Falaschi, G. Levi, M. Martelli, C. Palamidessi.
Declarative
modeling of the operational behaviour of logic languages.)
-
P. G. Bosco, E. Giovannetti, G. Levi, C. Moiso, C. Palamidessi.
A complete semantic characterization of K-LEAF,
a logic language with partial functions.
In Proc. of the Fourth IEEE Symposium on Logic Programming,
pages 318-327, San Francisco, 1987. IEEE Computer Society
Press, N.W., Washington.
(Abstract available of the full version: Kernel
LEAF: a logic plus functional language.)
-
M. Bellia, P. G. Bosco, E. Giovannetti, G. Levi, and C. Moiso, C. Palamidessi.
A two level approach to logic plus functional programming integration.
In Proc. of the Conference on Parallel Architectures and Languages Europe
(PARLE), LNCS, pages 376-393, Eindhoven,
The Netherlands, 1987. Springer Verlag.
-
G. Levi, C. Palamidessi.
An approach to the declarative semantics of synchronization in logic
languages. In J.-L. Lassez, ed., Proc. of the
Fourth International Conference on Logic Programming, pages 877-893,
Melbourne, 1987. The MIT Press.
-
G. Levi, C. Palamidessi.
The declarative semantics of logical read-only variables. (With
G. Levi.) In Proc. IEEE Symposium on Logic Programming, pages 128-137,
Boston, 1985. IEEE Computer Society Press.
-
M. Falaschi, G. Levi, C. Palamidessi.
The formal semantics of processes and streams in logic programming.
(With M. Falaschi and G. Levi.) Colloquia Mathematica Societatis Janos
Bolyai, 42:363-377, 1985.
Book Chapters
-
C. Palamidessi.
Concurrent Logic Programming. Chapter 6 in M.I. Sessa, ed., Ten
years of Logic Programming in Italy, pages 167-210. Palladio, 1995.
-
F.S. de Boer, C. Palamidessi.
From Concurrent Logic Programming to Concurrent Constraint Programming.
Chapter 2 in G. Levi, ed., Advances in logic
programming theory, pages 55-113. Oxford University Press, 1994.
(Abstract,
ps.)
-
F.S. de Boer, J.N. Kok, C. Palamidessi, J.J.M.M. Rutten.
A paradigm for asynchronous communication and its application to concurrent
constraint programming.
Chapter 4 in K. Apt, J.W. de Bakker, and J.J.M.M. Rutten, eds.,
Logic Programming Languages: Constraints, Functions, and Objects,
pages 82-114. Series in Logic Programming, The MIT Press, 1993. (Abstract,
ps.)
-
F.S. de Boer, J.N. Kok, C. Palamidessi, J.J.M.M. Rutten.
From failure to success: comparing a denotational and a declarative
semantics for Horn clause logic. In J.W. de Bakker and J.J.M.M. Rutten, eds., Ten
years of concurrency semantics: selected papers of the Amsterdam Concurrency
Group. World Scientific Publisher, 1993.
-
P.G. Bosco, C. Cecchi, E. Giovannetti, C. Moiso, C. Palamidessi.
Using Resolution for a Sound and Efficient Integration of Logic and
Functional Programming Chapter 4 in J.W. de Bakker, ed., Languages for Parallel
Architectures. Design, Semantics, Implementation Models, pages 167-221.
Series in Parallel Computing, Wiley, Chichester, UK, 1989.
Submitted Works
-
Mihaela Herescu, C. Palamidessi.
Probabilistic asynchronous $\pi$-calculus.
Submitted to Theoretical Computer Science.
(ps.)
Other Works
-
E. Best, F.S. de Boer, C. Palamidessi.
Concurrent constraint programming with information
removal. Proc. of the First Workshop
on Concurrent Constraint Programming, pages 1-13, Venice, 1995.
-
C. Palamidessi, E. Pimentel.
Embedding pi-calculus in ccp. Informal Proc.
of the First EXPRESS Workshop, Amsterdam, 1994.
-
C. Palamidessi.
A theory for modeling the synchronization mechanisms of concurrent logic
languages. In A. Bossi, ed., Proc. of the Conference Gruppo Utenti
Logic Programming, pages 331-346, Padova, Italy, 1990. Presented at
the Workshop and Tutorial on Formal Models of Concurrent Computations,
Telavi, Georgia, 2-6 October 1989.
-
C. Palamidessi.
On the declarative semantics of Horn Clause Logic-based languages.
CWI-Quarterly, 2(4), 1990.
-
G. Levi, M. Martelli, C. Palamidessi.
A reconstruction of the declarative semantics of logic programs.
(With G. Levi and M. Martelli.) Informal Preoceedings of the Workshop
on Computer Science Logic, Heidelberg, October 1989.
-
C. Palamidessi.
Strutture ad Ordinamenti Parziali nella Semantica Dichiarativa dei Linguaggi
Logici. PhD thesis, Technical Report of the Dipartimento di Informatica,
Universita` di Pisa, 1988.
-
C. Palamidessi.
A fixpoint semantics for Guarded Horn Clauses. Technical Report
CS-R8833, Centre for Mathematics and Computer Science (CWI), Amsterdam,
1988.
-
On the fixed point semantics of Horn clauses with infinite terms.
(With M. Falaschi and G. Levi.) Informal Proc. of the Workshop
on Logic Programming, pages 474-484, Albufeira, Portugal, 1983.
Lecture Notes
-
C. Palamidessi. Syntax and Semantics of Programming Languages. Lecture Notes for
the Course on Theory and Practice of Programming at the Department of Computer
Science, University of Genova.
-
C. Palamidessi.
Abstract data Types: From Specification to Implementation. Lecture
Notes for the Course on Theory and Applications of Computing Machines at
the Department of Computer Science, University of Pisa. SEU (University
Editorial Service), Pisa, 1990.
-
C. Palamidessi.
Lectures on Mathematical Logics. Lecture notes for the course on
Mathematical Logic, chaired by Professor G. Longo, at the Department of
Computer Science, University of Pisa. Editorial Service of the Opera
Universitaria, Pisa, 1985.