default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGianluca Amato
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c30]Gianluca Amato, Alessia Amelio, Luciano Caroprese, Piero Chiacchiaretta, Fabio Fioravanti, Luigi Ippoliti, Maria Chiara Meo, Gianpiero Monaco, Christian Morbidoni, Luca Moscardelli, Maurizio Parton, Francesca Scozzari:
AI for Sustainability: Research at Ud'A Node. Ital-IA 2024: 516-521- [c29]Carlo Metta, Marco Fantozzi, Andrea Papini, Gianluca Amato, Matteo Bergamaschi, Silvia Giulia Galfrè, Alessandro Marchetti, Michelangelo Vegliò, Maurizio Parton, Francesco Morandin:
Increasing biases can be more efficient than increasing weights. WACV 2024: 2798-2807 - [i13]Gianluca Amato, Mary DeMarco, James Lipton:
Uniform Algebras: Models and constructive Completeness for Full, Simply Typed λProlog. CoRR abs/2405.15822 (2024) - [i12]Gianluca Amato, Francesca Scozzari:
Optimal matching for sharing and linearity analysis. CoRR abs/2406.16063 (2024) - 2023
- [j12]Gianluca Amato
, Francesca Scozzari:
JGMP: Java bindings and wrappers for the GMP library. SoftwareX 23: 101428 (2023) - [c28]Gianluca Amato, Francesca Scozzari:
The ScalaFix Equation Solver. FM 2023: 142-159 - [i11]Carlo Metta, Marco Fantozzi, Andrea Papini, Gianluca Amato, Matteo Bergamaschi, Silvia Giulia Galfrè, Alessandro Marchetti, Michelangelo Vegliò, Maurizio Parton, Francesco Morandin:
Improving Performance in Neural Networks by Dendrites-Activated Connections. CoRR abs/2301.00924 (2023) - 2022
- [j11]Gianluca Amato, Maria Chiara Meo, Francesca Scozzari:
The role of linearity in sharing analysis. Math. Struct. Comput. Sci. 32(1): 44-110 (2022) - [c27]Gianluca Amato, Maria Chiara Meo, Francesca Scozzari:
On the Need for a Common API for Abstract Domains of Object-Oriented Programs. FTfJP@ECOOP 2022: 15-17 - [c26]Luca Pasqualini, Maurizio Parton, Francesco Morandin, Gianluca Amato, Rosa Gini, Carlo Metta, Marco Fantozzi, Alessandro Marchetti:
Score vs. Winrate in Score-Based Games: which Reward for Reinforcement Learning? ICMLA 2022: 573-578 - [i10]Luca Pasqualini, Maurizio Parton, Francesco Morandin, Gianluca Amato, Rosa Gini, Carlo Metta:
Leela Zero Score: a Study of a Score-based AlphaGo Zero. CoRR abs/2201.13176 (2022) - [i9]Maurizio Parton, Marco Angelone, Carlo Metta, Stefania D'Ovidio, Roberta Massarelli, Luca Moscardelli, Gianluca Amato:
Artificial intelligence and renegotiation of commercial lease contracts affected by pandemic-related contingencies from Covid-19. The project A.I.A.Co. CoRR abs/2210.09515 (2022) - 2021
- [i8]Gianluca Amato, Marco Maggesi, Cosimo Perini Brogi:
Universal Algebra in UniMath. CoRR abs/2102.05952 (2021) - 2020
- [j10]Gianluca Amato, Maria Chiara Meo, Francesca Scozzari:
On collecting semantics for program analysis. Theor. Comput. Sci. 823: 1-25 (2020) - [c25]Francesco Morandin, Gianluca Amato, Marco Fantozzi, Rosa Gini, Carlo Metta, Maurizio Parton:
SAI: A Sensible Artificial Intelligence That Plays with Handicap and Targets High Scores in 9×9 Go. ECAI 2020: 403-410 - [i7]Gianluca Amato, Marco Maggesi, Maurizio Parton, Cosimo Perini Brogi:
Universal Algebra in UniMath. CoRR abs/2007.04840 (2020)
2010 – 2019
- 2019
- [c24]Francesco Morandin, Gianluca Amato, Rosa Gini, Carlo Metta, Maurizio Parton, Gian-Carlo Pascutto:
SAI a Sensible Artificial Intelligence that plays Go. IJCNN 2019: 1-8 - [i6]Francesco Morandin, Gianluca Amato, Marco Fantozzi, Rosa Gini, Carlo Metta, Maurizio Parton:
SAI: a Sensible Artificial Intelligence that plays with handicap and targets high scores in 9x9 Go (extended version). CoRR abs/1905.10863 (2019) - 2018
- [j9]Gianluca Amato, Simone Di Nardo Di Maio, Maria Chiara Meo, Francesca Scozzari:
Descending chains and narrowing on template abstract domains. Acta Informatica 55(6): 521-545 (2018) - [c23]Gianluca Amato, Maria Chiara Meo, Francesca Scozzari:
A Taxonomy of Program Analyses. ICTCS 2018: 213-217 - [i5]Francesco Morandin, Gianluca Amato, Rosa Gini, Carlo Metta, Maurizio Parton, Gian-Carlo Pascutto:
SAI, a Sensible Artificial Intelligence that plays Go. CoRR abs/1809.03928 (2018) - 2017
- [j8]Gianluca Amato, Marco Rubino, Francesca Scozzari:
Inferring linear invariants with parallelotopes. Sci. Comput. Program. 148: 161-188 (2017) - [c22]Gianluca Amato, Marco Rubino:
Experimental Evaluation of Numerical Domains for Inferring Ranges. NSAD@SAS 2017: 3-16 - 2016
- [j7]Gianluca Amato, Francesca Scozzari, Helmut Seidl, Kalmer Apinis, Vesal Vojdani:
Efficiently intertwining widening and narrowing. Sci. Comput. Program. 120: 1-24 (2016) - 2015
- [c21]Gianluca Amato, Simone Di Nardo Di Maio, Maria Chiara Meo, Francesca Scozzari:
Narrowing Operators on Template Abstract Domains. FM 2015: 57-72 - [c20]Gianluca Amato, Simone Di Nardo Di Maio, Francesca Scozzari:
Sum of Abstract Domains. NFM 2015: 35-49 - [c19]Gianluca Amato, Maria Chiara Meo, Francesca Scozzari:
Exploiting Linearity in Sharing Analysis of Object-oriented Programs. ICTCS 2015: 3-18 - [i4]Gianluca Amato, Francesca Scozzari, Helmut Seidl, Kalmer Apinis, Vesal Vojdani:
Efficiently intertwining widening and narrowing. CoRR abs/1503.00883 (2015) - 2014
- [j6]Gianluca Amato, Francesca Scozzari:
Optimal multibinding unification for sharing and linearity analysis. Theory Pract. Log. Program. 14(3): 379-400 (2014) - [c18]Gianluca Amato, Francesca Scozzari, Enea Zaffanella:
Efficient Constraint/Generator Removal from Double Description of Polyhedra. NSAD 2014: 3-15 - 2013
- [c17]Gianluca Amato, Simone Di Nardo Di Maio, Francesca Scozzari:
Numerical static analysis with Soot. SOAP@PLDI 2013: 25-30 - [c16]Gianluca Amato, Francesca Scozzari:
Localizing Widening and Narrowing. SAS 2013: 25-42 - [i3]Gianluca Amato, Francesca Scozzari:
Optimal multi-binding unification for sharing and linearity analysis. CoRR abs/1306.2291 (2013) - 2012
- [j5]Gianluca Amato, Maurizio Parton, Francesca Scozzari:
Discovering invariants via simple component analysis. J. Symb. Comput. 47(12): 1533-1560 (2012) - [c15]Gianluca Amato, Francesca Scozzari:
Random: R-Based Analyzer for Numerical Domains. LPAR 2012: 375-382 - [c14]Gianluca Amato, Francesca Scozzari:
Analysis and Verification of Navigation Strategies by Abstract Interpretation of Cellular Automata. MIG 2012: 378-381 - [c13]Gianluca Amato, Francesca Scozzari:
The Abstract Domain of Parallelotopes. NSAD@SAS 2012: 17-28 - 2011
- [j4]Gianluca Amato, Francesca Scozzari:
Observational Completeness on Abstract Interpretation. Fundam. Informaticae 106(2-4): 149-173 (2011) - 2010
- [j3]Gianluca Amato, Francesca Scozzari:
On the interaction between sharing and linearity. Theory Pract. Log. Program. 10(1): 49-112 (2010) - [c12]Gianluca Amato, Maurizio Parton, Francesca Scozzari:
A Tool Which Mines Partial Execution Traces to Improve Static Analysis. RV 2010: 475-479 - [c11]Gianluca Amato, Maurizio Parton, Francesca Scozzari:
Deriving Numerical Abstract Domains via Principal Component Analysis. SAS 2010: 134-150
2000 – 2009
- 2009
- [j2]Gianluca Amato, James Lipton, Robert McGrail:
On the algebraic structure of declarative programming languages. Theor. Comput. Sci. 410(46): 4626-4671 (2009) - [j1]Gianluca Amato, Francesca Scozzari:
Optimality in goal-dependent analysis of Sharing. Theory Pract. Log. Program. 9(5): 617-689 (2009) - [c10]Gianluca Amato, Francesca Scozzari:
Observational Completeness on Abstract Interpretation. WoLLIC 2009: 99-112 - 2007
- [i2]Gianluca Amato, Francesca Scozzari:
On the interaction between sharing and linearity. CoRR abs/0710.0528 (2007) - 2005
- [c9]Gianluca Amato, Massimo Coppola, Stefania Gnesi, Francesca Scozzari, Laura Semini:
Modeling Web Applications by the Multiple Levels of Integrity Policy. WWV 2005: 161-175 - [c8]Gianluca Amato, Massimo Coppola, Stefania Gnesi, Francesca Scozzari, Laura Semini:
Modeling Web Applications by the Multiple Levels of Integrity Policy. WWV 2005: 167-185 - [i1]Gianluca Amato, Francesca Scozzari:
Optimality in Goal-Dependent Analysis of Sharing. CoRR abs/cs/0503055 (2005) - 2002
- [c7]Gianluca Amato, Francesca Scozzari:
Optimality in Goal-Dependent Analysis of Sharing. APPIA-GULP-PRODE 2002: 189-205 - [c6]Gianluca Amato, Francesca Scozzari:
A General Framework for Variable Aliasing: Towards Optimal Operators for Sharing Properties. LOPSTR 2002: 52-70 - 2001
- [b1]Gianluca Amato:
Sequent calculi and indexed categories as a foundation for logic programming. University of Pisa, Italy, 2001 - [c5]Gianluca Amato, Fausto Spoto:
Abstract Compilation for Sharing Analysis. FLOPS 2001: 311-325 - [c4]Gianluca Amato, James Lipton:
Indexed Categories and Bottom-Up Semantics of Logic Programs. LPAR 2001: 438-454 - [c3]Gianluca Amato:
Correct Answers for First Order Logic. APPIA-GULP-PRODE 2001: 45-64 - 2000
- [c2]Gianluca Amato, Giorgio Levi:
Abstract Interpretation Based Semantics of Sequent Calculi. SAS 2000: 38-57
1990 – 1999
- 1997
- [c1]Gianluca Amato, Giorgio Levi:
Properties of the Lattice of Observables in Logic Programming. APPIA-GULP-PRODE 1997: 175-188
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
