Publications

Journals

• Tempus Fugit: How to plug it (With C. Hankin and H. Wiklicky) The Journal of Logic and Algebraic Programming, 72:173--190, 2007. Available online at www.sciencedirect.com
  (Abstract, pdf)


• Reversible Combinatory Logic (With C. Hankin and H. Wiklicky) Mathematical Structures in Computer Science , 16(4):1--17, 2006. (Abstract, pdf)


• Quantitative Static Analysis of Distributed Systems (With C. Hankin and H. Wiklicky) Journal of Functional Programming, 15(5): 1-47, 2005. (Abstract, pdf)


• Probabilistic Lambda-calculus and Quantitative Program Analysis (With C. Hankin and H. Wiklicky) Journal of Logic and Computation, 15(2):159-179, 2005. Available via Oxford Journals online. (Abstract, pdf)


• Measuring the Confinement of Probabilistic Systems (With C. Hankin and H. Wiklicky) Theoretical Computer Science, Volume 340, Issue 1 (2005), Pages 3-56, Theoretical Foundations of Security Analysis and Design II, Edited by R. Gorrieri and F. Martinelli. Published online via ScienceDirect.


• Approximate Non-Interference (With C. Hankin and H. Wiklicky) Journal of Computer Security, 12(1):37-81, 2004.
  (Abstract, postscript)


• An Algebraic Perspective of Constraint Logic Programming (With F.S. de Boer and C. Palamidessi) Journal of Logic and Computation, 7(1), 1997. (Abstract, postscript)


• Nondeterminism and Infinite Computations in Constraint Programming (With F.S. de Boer and C. Palamidessi) Theoretical Computer Science, 151:37-78, 1995. (Abstract, postscript)


• Negation as Instantiation (With C. Palamidessi and M. Martelli) Information and Computation, 120(2):263-278, 1995. (Abstract, postscript)

Edited Journals

• A. Di Pierro and H. Wiklicky (eds.)
  Proceedings of the Forth Workshop on Quantitative Aspects of Programming Languages (QAPL 2006), Electronic Notes in Theoretical Computer Science, Volume 164, Issue 3 2006.
• A. Cerone and A. Di Pierro (eds.)
  Special Issue of Theoretical Computer Science on Quantitative Aspects of Programming Languages, 346(1) 2005.
• A. Cerone and A. Di Pierro (eds.)
  Proceedings of the Second Workshop on Quantitative Aspects of Programming Languages (QAPL 2004), Electronic Notes in Theoretical Computer Science, Volume 112 2005.
• A. Di Pierro and H. Wiklicky (eds.)
  Proceedings of the First Workshop on Quantitative Aspects of Programming Languages (QAPL 2001), Electronic Notes in Theoretical Computer Science, Volume 59,Issue 3 2002.

Conferences

• Semantic Abstraction and Quantum Computation (With H. Wiklicky) In Proceedings of QPL 2006, 4th International Workshop on Quantum Programming Languages, Oxford, July 2006. Electronic Notes in Theoretical Computer Science Notes. To appear. (Abstract, PDF)
• Abstract Interpretation for Worst and Average Case Analysis (With C. Hankin and H. Wiklicky) In Program Analysis and Compilation, Theory and Practice: Essays Dedicated to Reinhard Wilhelm, Lecture Notes in Computer Science. To appear. (Abstract, PDF)
• Probabilistic Chemical Abstract Machine and the Expressiveness of Linda Languages (With C. Hankin and H. Wiklicky) In Proceedings of FMCO 2005, 4th International Symposium on Formal Methods for Components and Object, November 2005, Amsterdam, The Netherlands. Lecture Notes in Computer Science, Vol. 4111, pp. 388-407, Springer-Verlag, 2006. (Abstract, PDF)
• Noninterference and the Most Powerful Probabilistic Adversary (With A. Aldini) In Proceedings of WITS 2006, 6th Int. Workshop on Issues in the Theory of Security, Vienna, March 2006. (Abstract, PDF)
• On Reversible Combinatory Logic (With C. Hankin and H. Wiklicky) In Proceedings of DCM 2005, International Workshop on Developments in Computational Models, Lisbon, July 2005. Electronic Notes in Theoretical Computer Science, Vol. 135 Issue 3, Elsevier 2006. (Abstract, PDF)
• Probabilistic Linda-based Coordination Languages (With C. Hankin and H. Wiklicky) In Proceedings of FMCO 2004, Third International Symposium on Formal Methods for Components and Objects, November 2004, Leiden, The Netherlands, Lecture Notes in Computer Science, Vol. 3657, Springer-Verlag, 2005. (Abstract, PDF)
• Operator Algebras and the Operational Semantics of Probabilistic Languages (With H. Wiklicky) In Proceedings of MFCSIT 2004, Third Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, Trinity College, Dublin, July 2004, A. K. Seda, T. Hurley, M. Schellekens, M. Mac an Airchinnigh and G. Strong (Eds.). Electronic Notes in Theoretical Computer Science. Volume 161, 2006.
• Continuous-Time Probabilistic KLAIM (With C. Hankin and H. Wiklicky) In Proceedings of SecCo 2004, 2th Workshop on Security Issues in Coordination Models, Languages and Systems London, UK, August 2004, R. Focardi and G. Zavattaro (Eds.). Electronic Notes in Theoretical Computer Science, Volume 128, Issue 5, 2005.
• On Quantitative Analysis of Probabilistic Protocols (With A. Aldini) In Proceedings of QAPL 2004, 2th Workshop on Quantitative Aspects of Programming Languages, Barcelona, Spain, March 2004, A. Di Pierro and A. Cerone (Eds.) In Electronic Notes in Theoretical Computer Science, Volume 112, 2005.
• Probabilistic KLAIM (With C. Hankin and H. Wiklicky) In Proceedings of COORDINATION 2004, 6th International Conference on Coordination Languages and Models, Pisa, Italy, February 2004, Rocco De Nicola and Greg Meredith (Eds.) Lecture Notes in Computer Science 2949 Springer 2004. (Abstract, postscript)
• A Quantitative Approach to Noninterference for Probabilistic Systems (With A. Aldini) Proceedings of the MEFISTO Project 2003, Formal Methods for Security and Time Pisa, Italy, November 2003, M. Bravetti and R. Gorrieri (Eds.), Electronic Notes in Theoretical Computer Science, Vol. 99, 2004. ( Abstract, postscript)
• Quantitative Relations and Approximate Process Equivalences (With C. Hankin and H. Wiklicky) In Proceedings of CONCUR'03, Marseille, France, September 2003. Roberto Amadio, Denis Lugiez (Eds.) Lecture Notes in Computer Science 2761 Springer 2003. ( Abstract, postscript)
• Measuring the Confinement of Concurrent Probabilistic Systems (With C. Hankin and H. Wiklicky) In Proceedings of WITS'03 -- 2003 IFIP WG 1.7, ACM SIGPLAN and GI FoMSESS Workshop on Issues in the Theory of Security, Warsaw, Poland, April 2003. ( Abstract, postscript)
• Probabilistic Constraint Handling Rules (With T. Fruehwirth and H. Wiklicky) In Electronic Notes in Theoretical Computer Science, Vol. 76, 2002 (M. Comini and M. Falaschi, ed.) -- Selected Papers from the 11th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2002), Grado, Italy.
• Linear Embedding for a Quantitative Comparison of Language Expressiveness (With A. Brogi and H. Wiklicky) In Electronic Notes in Theoretical Computer Science, Vol. 59 Issue 3, 2002 (A. Di Pierro and H. Wiklicky, eds.) -- Selected Papers from the ACM Workshop on Quantitative Aspects of Programming Laguages (QAPL 2001), Firenze, Italy. ( Abstract, postscript)
• Probabilistic Abstract Interpretation and Statistical Testing (With H. Wiklicky) Short abstract in Proceedings of PAPM-Probmiv'02 -- 2nd Joint International Workshop on Process Algebra and Performance Modelling and Probabilistic Methods in Verification, Copenhagen, Denmark, 2002. H. Hermanns, R. Segala (Eds.) Lecture Notes in Computer Science 2399 Springer 2002. (Full paper: Abstract, postscript)
• Approximate Confinement under Uniform Attacks (With C. Hankin and H. Wiklicky) In Proceedings of SAS'02 -- Static Analysis, 9th International Symposium, Madrid, Spain, September 17-20, 2002. Manuel V. Hermenegildo, German Puebla (Eds.) Lecture Notes in Computer Science 2477 Springer 2002. ( Abstract, postscript)
• Approximate Non-Interference (With C. Hankin and H. Wiklicky) In Proceedings of CSFW'02 -- 15th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia, Canada, 2002. ( Abstract, postscript)
• On Approximate Non-Interference (With C. Hankin and H. Wiklicky) In Proceedings of WITS'02 -- 2nd ACM SIGPLAN and IFIP WG 1.7 Workshop on Issues in the Theory of Security, Portland, Oregon, USA, January 2002.
• Quantum Constraint Programming (With H. Wiklicky.) In Proceedings of APPIA-GULP-PRODE'01 -- Joint Conference on Declarative Programming, Evora, Portugal, 2001. ( Abstract, postscript)
• Linear Structures for Concurrency in Probabilistic Programming Languages (With H. Wiklicky.) In Electronic Notes in Theoretical Computer Science, Vol. 40, 2001 (Anthony K. Seda, editor) -- Proceedings of MFCSIT'2000. ( Abstract, postscript)
• Probabilistic Confinement in a Declarative Framework (With H. Wiklicky and Chris Hankin.) In Electronic Notes in Theoretical Computer Science, Vol. 48, 2001 (A. Dovier, M.C. Meo, A. Omicini,eds.) -- Selected Papers from AGP 2000.
• Measuring the Precision of Abstract Interpretations (With H. Wiklicky.) Proc. of LOPSTR 2000, Tenth International Workshop on Logic-based Program Synthesis and Transformation, Lecture Notes in Computer Science, Vol. 2042, pages 147-164, 2001. (Abstract, postscript)
• Concurrent Constraint Programming: Towards Probabilistic Abstract Interpretation (With H. Wiklicky.) Proc. of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'00), 20-23 September, Montreal, Canada, 2000. (Abstract, postscript.)
• Randomised Algorithms and Probabilistic Constraint Programming (With H. Wiklicky.) Proc. of the ERCIM/Compulog Workshop on Constraints, 19-21 June, Padova, Italy, 2000. (Abstract, postscript)
• Quantitative Observables and Averages in Probabilistic Constraint Programming (With H. Wiklicky.) New Trends in Constraints - Selected Papers of the ERCIM/Compulog Workshop on Constraints, October 1999, Paphos, Cyprus, number 1865 in Lecture Notes in Artificial Intelligence, Berlin - Heidelberg - New York, 2000. Springer Verlag. (Abstract, postscript)
• Ergodic Average in Constraint Programming (With H. Wiklicky.) Proc. 2nd International Workshop on Probabilistic Methods in Verification, PROBMIV'99, 1999, Eindhoven, Holland. (Abstract, postscript)
• A Markov Model for Probabilistic Concurrent Constraint Programming (With H. Wiklicky.) Proc. of APPIA-GULP-PRODE'98, Joint Conference on Declarative Programming , 1998, Corunna, Spain. (Abstract, postscript)
• Probabilistic Concurrent Constraint Programming: Towards a Fully Abstract Model (With H. Wiklicky.) Proc. of the 23rd International Symposium on Mathematical Foundations of Computer Science, MFCS'98, Lecture Notes in Computer Science, Springer-Verlag , 1998, Brno, Czech Republic. (Abstract, postscript)
• Implementing Randomised Algorithms in Constraint Logic Programming (With N. Angelopoulos and H. Wiklicky.) Proc. of the Joint International Conference and Symposium on Logic Programming, JICSLP'98. MIT Press. , 1998, Manchester, UK. (Abstract, postscript.)
• An Operational Semantics for Probabilistic Concurrent Constraint Programming (With H. Wiklicky.) Proceedings of IEEE Computer Society International Conference on Computer Languages , 1998, Loyola University Chicago, Chicago, USA. (Abstract, postscript.)
• A Banach Space Based Semantics for Probabilistic Concurrent Constraint Programming (With H. Wiklicky.) Proceedings of CATS'98, Computing: the 4th Australian Theory Symposium , 2 - 3 February, 1998, University of Western Australia, Perth, Australia. (Abstract, postscript)
• On Probabilistic CCP (With H. Wiklicky.) Proceedings of APPIA-GULP-PRODE'97, Joint Conference on Declarative Programming , Grado, Italy, June, 1997. (Abstract, postscript)
• On Negation As Instantiation (With W. Drabent.) Proceedings of The Fifth International Conference on Algebraic and Logic Programming ALP'96, Lecture Notes in Computer Science, Springer-Verlag, Aachen, Germany, September, 1996. (Abstract, postscript)
• On Quantified Negative Queries (With W. Drabent.) Proceedings of the Joint Conference on Declarative Programming, APPIA-GULP-PRODE'96, Donostia-San Sebastian, Spain, July, 1996. (Abstract, postscript)
• A Logical Denotational Semantics for Constraint Logic Programming. In D. Sannella, editor, Proc. of Programming Languages and Systems (ESOP), Volume 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)
• Negation As Instantiation: a New Rule for the Treatment of Negation in Logic Programming. (With C. Palamidessi and M. Martelli.) In K. Furukawa, editor, Proceedings 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.)
• Amalgamating NAF and NAI. In D. Saccà, editor, Proceedings of The Eighth Italian Conference on Logic Programming, pages 309-321, 1993. (Abstract, postscript)
• SLDNI-resolution. A Non-floundering Interpreter for General programs. (With C. Palamidessi and M. Martelli.) In P. Asirelli, editor, Proceedings of The Sixth Italian Conference on Logic Programming, pages 293-308, 1991.

Book Chapter

• Two Formal Approaches for Approximating Noninterference Properties (With A. Aldini, M. Bravetti, R. Gorrieri, C. Hankin and H. Wiklicky) In Foundations of Security Analysis and Design II -- Tutorial Lectures, Lecture Notes in Computer Science 2946 Springer 2004.

PhD Thesis

• Negation and Infinite Computations in Logic Programming. Technical Report 3/94, Dipartimento di Informatica, Universita` di Pisa, 1994. (Abstract, postscript)