G. Amato,
F. Scozzari. JGMP:
Java bindings and wrappers for the GMP library. SoftwareX
23 (2023) 101428, © Elsevier
(online open
access paper)
G. Amato,
F. Scozzari. The
ScalaFix Equation Solver. Formal Methods: 25th International
Symposium, FM 2023,
Lübeck, Germany, March 6–10, 2023,
Proceedings, Lecture
Notes in Computer Science 14000, pp. 142-159, ©Springer
2015.
(accepted manuscript)
L. Pasqualini, M. Parton, F. Morandin, G. Amato, R. Gini, C. Metta, M. Fantozzi, A. Marchetti.
Score vs. Winrate in Score-Based Games: Which Reward for Reinforcement Learning?.
IEEE International Conference on Machine Learning and Applications, ICMLA 2022, Nassau, Bahamas, December 12-14, 2022,
Proceedings.
L. Pasqualini, G. Amato, M. Fantozzi, R. Gini, A. Marchetti, C. Metta, F. Morandin, M. Parton. Score vs. Winrate in Score-Based Games: which Reward for Reinforcement Learning?. arXiv:2201.13176
(PDF)
G. Amato, M. C. Meo,
F. Scozzari. The
role of linearity in sharing analysis. Mathematical Structures
in Computer Science 32(1), pp. 44-110, © Cambridge
University Press 2022.
(online open
access paper)
G. Amato, M. C. Meo,
F. Scozzari. On
collecting semantics for program analysis. Theoretical
Computer Science 823, pp. 1-25, © Elsevier 2020.
(accepted
manuscript) (online
open access paper)
G. Amato, M. Maggesi, M. Parton, C. Perini
Brogi. Universal Algebra in
UniMath, Workshop on
Homotopy Type Theory/Univalent Foundations, The Internet, July
5-7, 2020.
(PDF) (Video
presentation)
G. Amato, M. Maggesi, M. Parton, C. Perini Brogi. Universal Algebra in UniMath. arXiv:2007.04840.
(PDF)
F. Morandin, G. Amato, M. Fantozzi, R. Gini, C. Metta
and M. Parton. SAI: a
Sensible Artificial Intelligence that plays with handicap and targets
high scores in 9×9 Go. Proceedings of the 2020 European
Conference on Aritifical
Intelligence, ECAI
2020. Frontiers
in Artificial Intelligence and Applications 325, pp. 403-410 ,
© IOS Press 2020.
(online open access
paper)
F. Morandin, G. Amato, M. Fantozzi, R. Gini, C. Metta and M. Parton. SAI: a Sensible Artificial Intelligence that plays with handicap and targets high scores in 9×9 Go (extended version). arXiv:1905.10863.
(PDF)
F. Morandin, G. Amato, R. Gini, C. Metta, M. Parton
and
G.-C. Pascutto. SAI:
A Sensible Artificial Intelligence that plays Go. Proceedings
of the 2019 International Joint Conference on Neural
Networks, IJCNN 2019.
(accepted manuscript)
F. Morandin, G. Amato, R. Gini, C. Metta, M. Parton and G.-C. Pascutto. SAI: A Sensible Artificial Intelligence that plays Go. arXiv:1809.03928.
(PDF)
G. Amato, Maximilian F. Hasler, G. Melfi,
M. Parton. Primitive
abundant and weird numbers with many prime factors. Journal of
Number Theory 201, pp. 436-459, ©Elsevier 2019.
(accepted manuscript)
G. Amato, M. C. Meo,
F. Scozzari. A
Taxonomy of Program Analyses. Proceedings of the 19th Italian
Conference on Theoretical Computer
Science, ICTCS
2018. CEUR Workshop
Proceedings 2243, pp. 213-217.
(revised accepted manuscript)
G. Amato,
M. Rubino. Experimental
Evaluation of Numerical Domains for Inferring
Ranges. Proceedings of the 7th Intl. Workshop on Numerical
and Symbolic Abstract
Domains, NSAD
2017. Electronic Notes in Theoretical Computer Science 334,
pp. 3-16, ©Elsevier 2018.
(published
PDF) (slides)
G. Amato, S. Di Nardo Di Maio, M. C. Meo,
F. Scozzari. Descending
chains and narrowing on template abstract domains. Acta
Informatica 55(6), pp. 521-545, ©Springer 2017.
(accepted
manuscript) (online published
PDF)
G. Amato, M. Rubino,
F. Scozzari. Inferring
linear invariants with parallelotopes. Science of Computer
Programming 148, pp. 161-188, ©Elsevier 2017.
(accepted manuscript)
G. Amato, M. Hasler, G. Melfi,
M. Parton. Primitive
weird numbers having more than three distinct prime
factors. Rivista Matematica dell'Università di Parma
7(1), pp. 153-163, © Università di Parma 2016.
(accepted manuscript)
G. Amato, M. C. Meo,
F. Scozzari. Exploiting
linearity in sharing analysis of object-oriented
programs. Proceedings of the 16th Italian Conference on
Theoretical Computer
Science, ICTCS
2015. Electronic notes of Theoretical Computer Science 322,
pp. 9-11, ©Elsevier 2016.
(published
PDF) (slides)
G. Amato, F. Scozzari, H. Seidl, K. Apinis,
V. Vojdani. Efficiently
intertwining widening and narrowing. Science of Computer
Programming 120, pp. 1--24. ©Elsevier 2015.
(accepted manuscript)
G. Amato, S. Di Nardo Di Maio, M. C. Meo,
F. Scozzari. Narrowing
operators on template abstract domains.. In Nikolaj Bjørner and
Frank de Boer editors, FM
2015: Formal Methods, 20th International Symposium, Oslo, Norway,
June 24-26, 2015,
Proceedings, Lecture
Notes in Computer Science 9109, pp. 57-72, ©Springer
2015.
(accepted
manuscript) (slides)
G. Amato, S. Di Nardo Di Maoi,
F. Scozzari. Sum
of Abstract Domains. In Klaus Havelund, Gerard Holzmann, Rajeev
Joshi editors, NASA Formal Methods, 7th International
Symposium, NFM
2015, Pasadena, CA, USA, April 27-29,
2015. Proceedings, Lecture
Notes in Computer Science 9058, pp. 35-49, ©Springer
2015.
(accepted manuscript)
G. Amato, F. Scozzari,
E. Zaffanella. Efficient
Constraint/Generator Removal from Double Description of
Polyhedra. Proceedings of the 5th Intl. Workshop on Numerical
and Symbolic Abstract
Domains, NSAD
2014. Electronic Notes in Theoretical Computer Science 307,
pp. 3-15, ©Elsevier 2014.
(published PDF)
G. Amato,
F. Scozzari. Optimal
multi-binding unification for sharing and linearity
analysis. Theory and Practice of Logic Programming 14(3),
pp. 379-400. ©Cambridge University Press.
(published PDF)
G. Amato, S. Di Nardo Di Maio,
F. Scozzari. Numerical
static analysis with Soot.. In Patrick Lam and Elena Sherman
editors, Proceedings of the 2nd ACM SIGPLAN International Workshop
on State Of the Art in Java Program analys (SOAP '13), Seattle (WA),
USA, pp. 25-30, ©ACM 2013.
(accepted
manuscript) (online
published PDF) (slides)
G. Amato,
F. Scozzari. Localizing
widening and narrowing. In Francesco Logozzo and Manuel Fahndrich
editors, Static Analysis, 20th Internal
Symposium, SAS
2013, Seattle, WA, USA, June 20-22,
2013. Proceedings, Lecture
Notes in Computer Science 7935, pp. 25-42, ©Springer
2013.
(accepted
manuscript) (slides)
G. Amato,
F. Scozzari. Analysis
and verification of navigation strategies by abstract interpretation
of cellular automata. In Marcelo Kallmann and Kostas Bekris
editors, Motion in Games, 5th International
Conference, MIG 2012, Rennes,
France, November 15-17, 2012. Lecture Notes in Computer Science
7660, pp. 378-381, ©Springer 2012.
(accepted manuscript)
G. Amato,
F. Scozzari. The
abstract domain of parallelotopes. In Jan Midtgaard and Matthew
Might editors, Proceedings of the 4th Intl. Workshop on
Numerical and Symbolic Abstract
Domains, NSAD
2012. Electronic Notes in Theoretical Computer Science
287, pp. 17-28, ©Elsevier 2012.
(published
PDF) (slides)
G. Amato, M. Parton,
F. Scozzari. Discovering
invariants via simple component analysis. Journal of Symbolic
Computation 47(12), pp. 1533–1560, ©Elsevier 2012.
(accepted manuscript)
G. Amato,
F. Scozzari. Random: R-based
Analyzer for Numerical DOMains. In Nikolaj Bjørner and Andrei
Voronkov editors, Logic for Programming, Artificial
Intelligence, and Reasoning 18th International
Conference, LPAR-18, Mérida,
Venezuela, March 11-15,
2012. Proceedings, Lecture
Notes in Computer Science 7180, ©Springer-Verlag 2012.
(accepted
manuscript) (slides)
G. Amato,
F. Scozzari. Observational
Completeness on Abstract Interpretation. Fundamenta
Informaticae 106(2-4), pp.149-173, ©IOS Press 2011.
(accepted manuscript)
G. Amato, M. Parton,
F. Scozzari. A
Tool Which Mines Partial Execution Traces to Improve Static
Analysis. In Howard Barringer et al. editors, Runtime
Verification First International Conference, RV 2010, St. Julians,
Malta, November 1-4,
2010, Lecture
Notes in Computer Science 6418, © Springer 2010.
(abstract) (accepted
manuscript)
G. Amato, M. Parton,
F. Scozzari. Deriving
numerical abstract domains via Principal Component Analysis. In
R. Cousot and M. Martel editors, Static Analysis, 17th
International Symposium, SAS
2010, Perpignan, France, September
2010, Lecture
Notes in Computer Science 6337, © Springer-Verlag 2010.
(abstract) (accepted
manuscript)
G. Amato,
F. Scozzari. On
the interaction between sharing and linearity. Theory and
Practice of Logic Programming 10(1), pp. 49-112, ©Cambridge
University Press 2009.
(abstract)
(published PDF)
G. Amato, J. Lipton,
R. McGrail. On
the algebraic structure of declarative programming
languages. Theoretical Computer Science 410(46), pp. 4626-4671,
©Elsevier B.V. 2009
(abstract) (accepted
manuscript)
G. Amato,
F. Scozzari. Optimality
in goal-dependent analysis of Sharing. Theory and Practice of
Logic Programming 9(5), pp. 617-689, ©Cambridge University
Press 2009.
(abstract) (published
PDF)
G. Amato,
F. Scozzari. Observational
Completeness on Abstract Interpretation. In H. Ono, M. Kanazawa
and R. Queiroz editors, Logic, Language, Information and
Computation, 16th International
Workshop, WoLLIC
2009, Tokyo, Japan, June 21-24,
2009, Lecture
Notes in Computer Science 5514, ©Springer-Verlag 2009.
(abstract) (accepted
manuscript) (BibTeX) (slides)
G. Amato, M. Coppola, S. Gnesi, F. Scozzari,
L. Semini. Modeling
Web Applications by the Multiple Levels of Integrity Policy. In
M. Alpuente, S. Escobar and M. Falaschi editors, Proceedings of
the International Workshop on Automated Specification and
Verification of Web Sites
(WWV
2005), Electronic Notes in Theoretical Computer Science
157(2), ©Elsevier Science, 2006.
(abstract) (accepted
manuscript) (BibTeX)
G. Amato, M. Coppola, S. Gnesi, F. Scozzari, L. Semini. Modeling Web Applications by the Multiple Levels of Integrity Policy. Technical Report TR-05-04. Dipartimento di Informatica, Università di Pisa.
(abstract) (PDF) (BibTeX)G. Amato, M. Coppola, S. Gnesi, F. Scozzari, L. Semini. Modeling Web Applications by the Multiple Levels of Integrity Policy. Pre-proceedings of the 1st Int'l Workshop on Automated Specification and Verification of Web Sites. Technical Report DSIC-II/03/05, Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia
(abstract) (PDF) (BibTeX)
G. Amato and F. Scozzari. On abstract unification for
variable
aliasing. Technical
Report TR-05-08. Dipartimento di Informatica,
Università di Pisa.
(abstract) (PDF) (BibTeX)
G. Amato and F. Scozzari. Optimality in Goal-Dependent
Analysis of Sharing (full
version). Technical
Report TR-05-06. Dipartimento di Informatica, Università di
Pisa.
(abstract) (PDF) (BibTeX)
G. Amato and
F. Scozzari. A
general framework for variable aliasing: Towards optimal operators for
sharing properties. In M. Leuchel editor, Logic Based Program
Synthesis and Transformation 12th International
Workshop, LOPSTR
2002, Madrid, Spain, September 17–20, 2002. Revised Selected
Papers, Lectures Notes in Computer Science 2664,
©Springer-Verlag, 2003.
(abstract) (accepted
manuscript) (BibTeX) (slides)
G. Amato and F. Scozzari. A general framework for variable aliasing: Towards optimal operators for sharing properties. Pre-proceedings of the International Workshop on Logic Based Program Development and Transformation, LOPSTR 2002,17 - 20 September 2002, Madrid, Spain.
(abstract) (accepted manuscript) (BibTeX)
G. Amato and F. Scozzari. Optimality in goal-dependent
Analysis of
Sharing. Technical
Report TR-02-06 Dipartimento di Informatica, Università
di Pisa.
(abstract) (PDF)
(BibTeX)
G. Amato and F. Scozzari. Optimality in goal-dependent Analysis of Sharing. In Juan J. Moreno-Navarro and Julio Mariño-Carballo editors, Proceedings of the Joint Conference on Declarative Programming (AGP'02), Madrid, Spain.
(abstract) (accepted manuscript) (BibTeX)
G. Amato and
J. Lipton. Indexed
Categories and Bottom-Up Semantics of Logic Programs. In
R. Nieuwenhuis and A. Voronkov editors, Logic for Programming,
Artificial Intelligence, and Reasoning 8th International
Conference, LPAR
2001 Havana, Cuba, December 3–7, 2001 Proceedings, Lectures
Notes in Computer Science 2250, ©Springer-Verlag, 2001.
(abstract) (accepted
manuscript) (BibTeX) (slides)
G. Amato. Correct
Answers for First Order Logic. In A. Dovier, M.C. Meo,
A. Omicini editors, Declarative Programming - Selected Papers
from AGP 2000, Electronic Notes in Theoretical Computer Science
48, ©Elsevier Science, 2001.
(abstract) (published
PDF) (analyzer for
groundness) (BibTeX)
G. Amato. Correct Answers for First Order Logic. Presented at Appia-Gulp-Prode 2000: Joint conference on Declarative Programming, La Habana, Cuba, 4-6 Dicembre 2000.
(abstract) (accepted manuscript) (snapshot of the analyzer)
G. Amato and
F. Spoto. Abstract
Compilation for Sharing Analysis. In H. Kuchen and K. Ueda
editors, Functional and Logic Programming 5th International
Symposium, FLOPS
2001 Tokyo, Japan, March 7–9, 2001 Proceedings, Lecture
Notes in Computer Science 2024, ©Springer-Verlag,
2001.
(abstract) (accepted
manuscript) (snapshot of the
analyzer) (BibTeX)
G. Amato Sequent Calculi and Indexed Categories as a
Foundation for Logic Programming. PhD Thesis, Dipartimento di
Informatica, Pisa, Italy, 2001
(abstract) (PDF) (analyzer
for groundess) (BibTeX)
G. Amato and G. Levi. Abstract Interpretation Based
Semantics of Sequent Calculi.In J. Palsberg editor, Static
Analysis 7th International
Symposium, SAS
2000, Santa Barbara, CA, USA, June 29 - July 1,
2000. Proceedings. Lecture
Notes in Computer Science 1824,©Springer-Verlag, 2000.
(abstract) (accepted
manuscript: original
/ with proofs) (Prolog
Analyzer) (BibTeX)
G. Amato. Uniform proofs and fixpoint semantics of sequent
calculi. Unpublished. 1999
(abstract) (PDF) (BibTeX)
G. Amato and G. Levi. Properties of the lattice of
observables in logic programming. In M. Falaschi, M. Navarro,
and Policriti A. editors, Proceedings of the 1997 Joint Conf. on
Declarative Programming, APPIA-GULP-PRODE'97, Grado, Italy, June
16-19, 1997
(abstract) (accepted
manuscript) (BibTeX)
G. Amato. Proprietà del reticolo degli osservabili
in programmazione logica. Master's thesis, Dipartimento di
Informatica, Pisa, Italy, 1996. In Italian.
(PostScript) (BibTeX) (slides)