Papers of Roberto Giacobazzi

(Last update: Aug. 18, 2009)

This list contains some selected papers of Roberto Giacobazzi. The abstracts of the papers can be retrieved by clicking on their title. Their PDF or (gzipped) DVI or PostScript (A4-600dpi) versions are available, as well as the corresponding BibTeX entries. The extended versions of some of the papers written in the years from 1995 to 1998 are also accessible as Technical Reports of the University of Pisa. Click here for my research interests and here for the necessary copyright notice.

Papers are classified by year in reverse chronological order: 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992 and older, PhD Thesis.

My co-authors.

2010

I. Mastroeni. and R. Giacobazzi. An Abstract Interpretation-based Model for Safety Semantics. Journal of Computer Mathematics. To appear.
Available: PDF, BibTeX Entry.
R. Giacobazzi and I. Mastroeni. A Proof System for Abstract Non-Interference. Journal of Logic and Computation. To appear.
Available: PDF, BibTeX Entry.
R. Giacobazzi and I. Mastroeni. Adjoining classified and unclassified information by abstract interpretation. Journal of Computer Security. To appear.
Available: PDF, BibTeX Entry.

2009

P. Cousot, R. Cousot and R. Giacobazzi. Abstract Interpretation of Resolution-Based Semantics. Theoretical Computer Science. 410(46) 4724-4746. 2009.
Available: Soon!!
M. Dalla Preda and R. Giacobazzi. Semantic-based Code Obfuscation by Abstract Interpretation. Journal of Computer Security, 17(6):855-908, 2009.
Available: Soon!!

2008

R. Giacobazzi. Hiding Information in Completeness Holes - New perspectives in code obfuscation and watermarking (Invited Lecture). The 6th IEEE International Conferences on Software Engineering and Formal Methods, SEFM'08, pages 7-20, IEEE Press. Cape Town (South Africa), 10-14 November 2008.
Available: IEEE digital library, PDF (with fixed typos), BibTeX Entry, Slides.
M. Dalla Preda, R. Giacobazzi, and E. Visentini. Hiding software watermarks in loop structures. The 15th International Static Analysis Symposium SAS'08, volume 5079 of Lecture Notes in Computer Science, pages 174-188, Springer-Verlag. Valencia, Spain, 16-18 July, 2008.
Available: PDF, BibTeX Entry.
R. Giacobazzi and I Mastroeni. Transforming abstract interpretations by abstract interpretation (Invited Lecture). The 15th International Static Analysis Symposium SAS'08, volume 5079 of Lecture Notes in Computer Science, pages 1-17, Springer-Verlag. Valencia, Spain, 16-18 July, 2008.
Available: PDF, BibTeX Entry, Slides.

2007

F. Banterle and R. Giacobazzi. A Fast Implementation of the Octagon Abstract Domain on Graphics Hardware. The 14th International Static Analysis Symposium SAS'07, volume 4634 of Lecture Notes in Computer Science, pages 315-335, Springer-Verlag. Kongens Lyngby, Denmark, 22-24 August, 2007.
Available: PDF, BibTeX Entry.
A. Banerjee, R. Giacobazzi and I. Mastroeni. What you lose is what you leak: Information Leakage in Declassification Policies. Twenty-third Conference on the Mathematical Foundations of Programming Semantics (MFPS'07). Electronic Notes in Theoretical Computer Science. Tulane University New Orleans, LA, USA April 11 - April 14, 2007
Available: PDF and Bibtex.
R. Giacobazzi (Editor). Special Issue on the 11th Static Analysis Symposium - SAS 2004. Science of Computer Programming Volume 64, Issue 1, Pages 1-184 (1 January 2007)
Available: from ScienceDirect Elsevier.

2006

M. Dalla Preda, M. Madou, K. De Bosschere and R. Giacobazzi. Opaque Predicate Detection by Abstract Interpretation. In Proceedings of the 11th International Conference on Algebriac Methodology and Software Technology (AMAST'06). Volume 4019 of Lecture Notes in Computer Science, pages 81-95, Springer-Verlag. July 2-8, 2006, Kuressaare, Estonia.
Available: PDF and Slides.
R. Giacobazzi and F. Ranzato. Incompleteness of States w.r.t. Traces in Model Checking. Information and Computation, 204(3):376-407, 2006.
Available: PDF from ScienceDirect Elsevier.

2005

R. Giacobazzi and I. Mastroeni. Timed Abstract Non-Interference. In the International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'05). Volume 3829 of Lecture Notes in Computer Science, pages 289-303, Springer-Verlag. September 26-28, 2005, Uppsala, Sweden.
Available: PDF, Bibtex, Slides.
R. Giacobazzi and I. Mastroeni. Generalized Abstract Non-Interference - Abstract Secure Information-flow Analysis for Automata . In Third International Workshop on "Mathematical Methods, Models and Architectures for Computer Networks Security (MMM-ACNS'05). Volume 3685 of Lecture Notes in Computer Science, pages 221-234, Springer-Verlag. September 24-28, 2005, St. Petersburg, Russia.
Available: PDF, Bibtex, Slides.
M. Dalla Preda and R. Giacobazzi. Control Code Obfuscation by Abstract Interpretation. In Proceedings of the 3rd IEEE International Conference on Software Engineering and Formal Methods (SEFM'05). pages 301-310, IEEE Computer Society Press. September 7-9, 2005, Koblenz, Germany.
Available: PDF.
M. Dalla Preda and R. Giacobazzi. Semantic-based Code Obfuscation by Abstract Interpretation. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05 - Track B). Volume 3580 of Lecture Notes in Computer Science, pages 1325-1336, Springer-Verlag. July 11-15, 2005, Lisboa, Portugal.
Available: PDF.
R. Giacobazzi, F. Ranzato, and F. Scozzari. Making Abstract Domains Condensing. ACM Transactions on Computational Logic (TOCL). 6(1):33--60, 2005.
Available: PS, PDF, BibTeX Entry.
R. Giacobazzi and I. Mastroeni. Transforming Semantics by Abstract Interpretation. Theoretical Computer Science. 337(1-3):1-50, 2005.
Available: PDF, BibTeX Entry.
R. Giacobazzi and I. Mastroeni. Adjoining Declassification and Attack Models by Abstract Interpretation. In M. Sagiv Editor, European Symposium on Programming (ESOP'05). Volume 3444 of Lecture Notes in Computer Science, pages 295-310, Springer-Verlag. Edinburgh, Scotland, April 2-10, 2005
Available: PDF, BibTeX Entry, Slides.

2004

R. Giacobazzi and I. Mastroeni. Proving abstract non-interference. In the Annual Conference of the European Association for Computer Science Logic (CSL'04). Volume 3210 of Lecture Notes in Computer Science, pages 280-294, Springer-Verlag. Karpacz, September 20-24, 2004.
Available: PDF, BibTeX Entry, Slides.
S. Genaim, R. Giacobazzi, and I. Mastroeni. Modeling Information Flow Dependencies with Boolean Functions. In the 2004 IFIP WG 1.7, ACM SIGPLAN and GI FoMSESS Workshop on Issues in the Theory of Security (WITS'04). April 3 - 4, 2004, Barcelona, Spain.
Available: PDF, BibTeX Entry
R. Giacobazzi and I. Mastroeni. Abstract Non-Interference: Parameterizing Non-Interference by Abstract Interpretation. In The 31st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'04). pages 186-197. ACM press. Venice, Italy, January 14-16, 2004.
Available: DVI, PDF, BibTeX Entry, Slides.

2003

R. Giacobazzi and I. Mastroeni. Non-standard semantics for program slicing. Higher-Order and Symbolic Computation (formely LISP and Symbolic Computation). 16(4):297-339
Available: DVI, PS, BibTeX Entry.
R. Giacobazzi and I. Mastroeni. Domain Compression for Complete Abstractions. In Fourth International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'03). volume 2575 of Lecture Notes in Computer Science, pages 146-160, Springer-Verlag. New York University, New York, USA January 9-11, 2003.
Available: DVI, PostScript, BibTeX Entry, Slides.

2002

R. Giacobazzi and F. Ranzato. States vs. Traces in Model Checking by Abstract Interpretation. In M. Hermeneghildo and G. Puebla Eds. The 9th International Static Analysis Symposium SAS'02, volume 2477 of Lecture Notes in Computer Science, pages 461-476, Springer-Verlag. Madrid, 17-20 September, 2002.
Available: DVI, PostScript, PDF, BibTeX Entry.
R. Giacobazzi. Systematic design of complete abstractions: from semantics to program analysis via model-checking. (Invited lecture) In Eighteenth Workshop on the Mathematical Foundations of Programming Semantics MFPS XVIII, Tulane University, New Orleans, LA USA. March 23 - March 26, 2002.
R. Giacobazzi and I. Mastroeni. Compositionality in the puzzle of semantics. In Proc. of the ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program ManipulationPEPM'02, pages 87-97. ACM press. Portland, Oregon, USA, January 14-15, 2002.
Available: DVI, PDF, BibTeX Entry.

2001

R. Giacobazzi and E. Quintarelli. Incompleteness, counterexamples and refinements in abstract model-checking . In P. Cousot Ed. The 8th International Static Analysis Symposium SAS'01, volume 2126 of Lecture Notes in Computer Science, pages 356-373, Springer-Verlag. La Sorbonne, Paris, 16-18 July, 2001.
Available: DVI, PostScript, BibTeX Entry.
A. Dovier, R. Giacobazzi, and E. Quintarelli. Refining and Compressing Abstract Model Checking. Electronic Notes in Theoretical Computer Science ENTCS 48, Elsevier 2001.
Available: ENTCS-source

2000

R. Giacobazzi and I. Mastroeni. A characterization of symmetric semantics by domain complementation. In Proc. of the 2nd ACM International Conference on Principles and Practice of Declarative Programming PPDP'00, pages 115-126. ACM Press. Montreal, Canada, September 20-22, 2000.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi, F. Ranzato, and F. Scozzari. Making abstract interpretations complete. Journal of the ACM. 47(2):361-416, 2000.
Available from the JACM page, current issue: paper2101.ps, PostScript, BibTeX Entry.

1999

R. Giacobazzi and F. Ranzato. The reduced relative power operation on abstract domains. Theoretical Computer Science 216:159-211, 1999.
Available: DVI, PostScript, BibTeX Entry.

1998

R. Giacobazzi and F. Scozzari. A logical model for relational abstract domains. ACM Transactions on Programming Languages and Systems 20(5):1067-1109, 1998.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi, F. Ranzato, and F. Scozzari. Building complete abstract interpretations in a linear logic-based setting. In G. Levi Editor Fifth International Static Analysis Symposium (SAS'98), volume 1503 Lecture Notes in Computer Science, pages 215-229, Springer-Verlag, 1998. Pisa, Italy, Sept. 14-18.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi, F. Ranzato, and F. Scozzari. Complete abstract interpretations made constructive. In L. Brim, J. Gruska, and J. Zlatuska Editors, The 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS'98), volume 1450 Lecture Notes in Computer Science, pages 366-377, Springer-Verlag, Berlin, 1998. Brno, Czech Republic, August 24-28, 1998.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi and F. Ranzato. Some properties of complete congruence lattices. Algebra Universalis 40:189-200, 1998. Math. Classification 06B10 (06A15, 06A23, 06D15).
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi and F. Ranzato. Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements. Information and Computation 145(2):153-190, 1998.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi and F. Ranzato. Optimal domains for disjunctive abstract interpretation. Science of Computer Programming 32(1-3):177-210, 1998.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi. Abductive analysis of modular logic programs. Journal of Logic and Computation 8(4):457-484, 1998.
Available: DVI, PostScript, BibTeX Entry.

1997

R. Giacobazzi and F. Ranzato. On the least complete extension of complete subsemilattices. Algebra Universalis 38(3):235-237, 1997. Math. Classification 06A12, 06A15, 06A23.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi and F. Ranzato. Completeness in abstract interpretation: A domain perspective. In M. Johnson editor, Proc. of the 6th International Conference on Algebraic Methodology and Software Technology ( AMAST'97). volume 1349 of Lecture Notes in Computer Science, pages 231-245. Springer-Verlag, Berlin, 1997. Sydney, Australia, Dec. 13-17, 1997.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi and F. Scozzari. Intuitionistic implication in abstract interpretation. In H. Glaser, P. Hartel, and H. Kuchen Eds. Proc. of the 9th International Symposium on Programming Languages, Implementations, Logics, and Programs ( PLILP'97), volume 1292 of Lecture Notes in Computer Science, pages 175-189. Springer-Verlag, Berlin, 1997.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi and F. Ranzato. Refining and compressing abstract domains. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela editors, Proc. of the 24th International Colloquium on Automata, Languages, and Programming ( ICALP'97), Bologna I, volume 1256 of Lecture Notes in Computer Science, pages 771-781. Springer-Verlag, Berlin, 1997.
Available: DVI, PostScript, BibTeX Entry.
A. Cortesi, G. File', R. Giacobazzi, C. Palamidessi and F. Ranzato. Complementation in Abstract Interpretation. ACM Transactions on Programming Languages and Systems 19(1):7-47, 1997.
Available: DVI, PostScript, PDF(300), PDF(600), PDF interactive, BibTeX Entry.
E. Zaffanella, R. Giacobazzi and G. Levi. Abstracting Synchronization in Concurrent Constraint Programming. Journal of Functional and Logic Programming, 1997(6), 1997.
Available from MIT Press: DVI, PostScript, pdf, and LaTex, BibTeX Entry.

1996

R. Giacobazzi and F. Ranzato. Complementing Logic Program Semantics. In M. Hanus and M. Rodriguez Artalejo Editors, Proc. of the Fifth International Conference on Algebraic and Logic Programming, ALP'96, volume 1139 of Lecture Notes in Computer Science, pages 238-253, Springer-Verlag, 1996.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi, C. Palamidessi and F. Ranzato. Weak Relative Pseudo-Complements of Closure Operators. Algebra Universalis 36 (1996), no. 3, 405-412. Math. Classification 06A15 (06A12).
Available: DVI, PostScript, BibTeX Entry, Technical Report LIX/95/04 (file PostScript).
G. File' and R. Giacobazzi and F. Ranzato. A Unifying View on Abstract Domain Design. ACM Computing Surveys 28(2): 333-336, 1996.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi and F. Ranzato. Compositional Optimization of Disjunctive Abstract Interpretations. In H.R. Nielson editor, Proc. of the 1996 European Symposium on Programming, ESOP'96, volume 1058 of Lecture Notes in Computer Science, pages 141-155, Springer-Verlag 1996.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi. ``Optimal'' Collecting Semantics for Analysis in a Hierarchy of Logic Program Semantics. In C. Puech and R. Reischuk editors, Proc. of the 13th International Symposium on Theoretical Aspects of Computer Science STACS'96, volume 1046 of Lecture Notes in Computer Science, pages 503-514, Springer-Verlag 1996.
Available: DVI, PostScript, BibTeX Entry.

1995

R. Giacobazzi and F. Ranzato. Functional dependencies and Moore-set completions of abstract interpretations and semantics. In J. Lloyd editor, Proc. 1995 Int'l Symposium on Logic Programming, ILPS'95, pages 321-335. The MIT Press 1995.
Available: DVI, PostScript, BibTeX Entry.
A. Cortesi and G. File' and R. Giacobazzi and C. Palamidessi and F. Ranzato. Complementation in Abstract Interpretation. In A. Mycroft editor, Proc. of Int. Static Analysis Symposium SAS'95, volume 983 of Lecture Notes in Computer Science, pages 100--117. Springer-Verlag, Glasgow 25-27 Sept. 1995.
Available: DVI, PostScript, BibTeX Entry.
R. Barbuti and M. Codish and R. Giacobazzi and M. Maher. Oracle Semantics for PROLOG. Information and Computation. 122(2):178-200, 1995. Extended version.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi and S.K. Debray and G. Levi. Generalized Semantics and Abstract Interpretation for Constraint Logic Programs. Journal of Logic Programming. 25(3):191-248, 1995. Extended version.
Available: DVI, PostScript, BibTeX Entry.

1994

B.M. Chang, K.M. Choe and R. Giacobazzi. Abstract Filters: Improving Bottom-up Executions of Logic Programs by Two-phase Abstract Interpretation. In Proceedings of the Ninth ACM Symposium on Applied Computing, pages 388--393, ACM Press. 1994.
Available: DVI, PostScript, BibTeX Entry.
M. Gabbrielli and R. Giacobazzi. Goal independency and call patterns in the analysis of logic programs. In Proceedings of the Ninth ACM Symposium on Applied Computing, pages 394--399, ACM Press. 1994.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi. Abductive analysis of modular logic programs. In M. Bruynooghe Editor, Proc. 1994 Int'l Symposium on Logic Programming, pages 377--391, The MIT Press. 1994.
Available: DVI, PostScript, BibTeX Entry.
E. Zaffanella and R. Giacobazzi and G. Levi. Abstracting Synchronization in Concurrent Constraint Programming. In M. Hermenegildo and J. Penjam Editors, Proc. of the Sixth International Symposium on Programming Language Implementation and Logic Programming, PLILP'94, volume 844 of Lecture Notes in Computer Science, pages 57--72, Springer-Verlag, 1994.
Available: DVI, PostScript, BibTeX Entry.

1993

R. Bagnara and R. Giacobazzi and G. Levi. An Application of Constraint Propagation to Data-Flow Analysis. In Proceedings of IEEE Ninth Conference on Artificial Intelligence for Applications, pages 270--276, IEEE Computer Society Press, 1993.
Available: DVI, PostScript, BibTeX Entry.
R. Barbuti and R. Giacobazzi and G. Levi. A General Framework for Semantics-based Bottom-up Abstract Interpretation of Logic Programs. ACM Transactions on Programming Languages and Systems, 15(1):133-181, 1993.
Available: DVI, PostScript, BibTeX Entry.
R. Barbuti and M. Codish and R. Giacobazzi and G. Levi. Modelling Prolog Control. Journal of Logic and Computation, 3(6):579-603, 1993.
Available: DVI, PostScript, BibTeX Entry.
M. Codish and S. K. Debray and R. Giacobazzi. Compositional Analysis of Modular Logic Programs. In Proc. Twentieth Annual ACM SIGACT/SIGPLAN Symp. on Principles of Programming Languages, pages 451-464, ACM Press, 1993.
Available: DVI, PostScript, BibTeX Entry.
M. Gabbrielli and R. Giacobazzi and D. Montesi. Modular Logic Programs over Finite Domains. In D. Sacca' Editor, Proc. Eight Italian Conference on Logic Programming, pages 663-678, 1993.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi and S. K. Debray and G. Levi. Joining Abstract and Concrete Computations in Constraint Logic Programming. In M. Nivat, C. Rattray, T. Rus and G. Scollo Editors, Proc. of Third Int. Conf. on Algebraic Methodology and Software Technology, AMAST'93, Workshops in Computing, pages 111-130, Springer-Verlag, 1993.
Available: DVI, PostScript, BibTeX Entry.

1992 and older

R. Barbuti and R. Giacobazzi. A Bottom-up Polymorphic Type Inference in Logic Programming. Science of Computer Programming, 19(3):281-313, 1992.
Available: DVI, PostScript, BibTeX Entry.
R. Barbuti and M. Codish and R. Giacobazzi and G. Levi. Modelling Prolog Control. In Proc. Twentieth Annual ACM SIGACT/SIGPLAN Symp. on Principles of Programming Languages, pages 95-104, ACM Press, 1992.
Available: DVI, PostScript, BibTeX Entry.
R. Barbuti and M. Codish and R. Giacobazzi and M. Maher. Oracle Semantics for PROLOG. In H. Kirchner and G. Levi Editors, Algebraic and Logic Programming, Proceedings of the Third International Conference, volume 632 of Lecture Notes in Computer Science, pages 100-114, Springer-Verlag, 1992.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi and L. Ricci. Detecting Determinate Computations by a Bottom-up Abstract Interpretation. In Proc. of the European Symp. on Programming, ESOP'92, volume 582 of Lecture Notes in Computer Science, pages 167-181, Springer-Verlag, 1992.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi and S. K. Debray and G. Levi. A Generalized Semantics for Constraint Logic Programs. In Proceedings of the International Conference on Fifth Generation Computer Systems 1992, pages 581-591, 1992.
Available: DVI, PostScript, BibTeX Entry.
R. Giacobazzi. The Unfolding Semantics for Constraint Logic Programs. In P. Asirelli Editor, Proc. Sixth Italian Conference on Logic Programming, pages 425-436, 1991.
Available: DVI, PostScript, BibTeX Entry.

Ph.D. Thesis

R. Giacobazzi. Semantic Aspects of Logic Program Analysis. Dipartimento di Informatica, Univ. di Pisa, TD-18/93, 1993.
Available: DVI, BibTeX Entry.

Copyright Notice

The documents distributed have been provided by the contributing authors as a means to ensure timely dissemination of technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.