• Bossi A and Meo M. Theoretical foundations and semantics of logic programming. A 25-year perspective on logic programming. (15-36).

    /doi/10.5555/1880413.1880416

  • Giacobazzi R and Mastroeni I. (2005). Transforming semantics by abstract interpretation. Theoretical Computer Science. 337:1-3. (1-50). Online publication date: 9-Jun-2005.

    https://doi.org/10.1016/j.tcs.2004.12.021

  • Dalla Preda M and Giacobazzi R. Control Code Obfuscation by Abstract Interpretation. Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods. (301-310).

    https://doi.org/10.1109/SEFM.2005.13

  • Gori R. (2003). An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. Theoretical Computer Science. 290:1. (863-936). Online publication date: 1-Jan-2003.

    https://doi.org/10.1016/S0304-3975(02)00376-6

  • Giacobazzi R and Mastroeni I. Compositionality in the puzzle of semantics. Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation. (87-97).

    https://doi.org/10.1145/503032.503040

  • Giacobazzi R and Mastroeni I. (2002). Compositionality in the puzzle of semantics. ACM SIGPLAN Notices. 37:3. (87-97). Online publication date: 1-Mar-2002.

    https://doi.org/10.1145/509799.503040

  • Comini M, Levi G and Meo M. (2019). A Theory of Observables for Logic Programs. Information and Computation. 169:1. (23-80). Online publication date: 25-Aug-2001.

    https://doi.org/10.1006/inco.2000.3024

  • Giacobazzi R and Mastroeni I. A characterization of symmetric semantics by domain complementation. Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming. (115-126).

    https://doi.org/10.1145/351268.351281

  • Giacobazzi R and Ranzato F. (1998). Uniform Closures. Information and Computation. 145:2. (153-190). Online publication date: 15-Sep-1998.

    https://doi.org/10.1006/inco.1998.2724