Gianluca Amato

Orcid: 0000-0002-6214-5198

According to our database1, Gianluca Amato authored at least 46 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Increasing biases can be more efficient than increasing weights.
Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, 2024

2023
JGMP: Java bindings and wrappers for the GMP library.
SoftwareX, July, 2023

Improving Performance in Neural Networks by Dendrites-Activated Connections.
CoRR, 2023

The ScalaFix Equation Solver.
Proceedings of the Formal Methods - 25th International Symposium, 2023

2022
The role of linearity in sharing analysis.
Math. Struct. Comput. Sci., 2022

Artificial intelligence and renegotiation of commercial lease contracts affected by pandemic-related contingencies from Covid-19. The project A.I.A.Co.
CoRR, 2022

Leela Zero Score: a Study of a Score-based AlphaGo Zero.
CoRR, 2022

Score vs. Winrate in Score-Based Games: which Reward for Reinforcement Learning?
Proceedings of the 21st IEEE International Conference on Machine Learning and Applications, 2022

On the Need for a Common API for Abstract Domains of Object-Oriented Programs.
Proceedings of the 24th ACM International Workshop on Formal Techniques for Java-like Programs, 2022

2021
Universal Algebra in UniMath.
CoRR, 2021

2020
On collecting semantics for program analysis.
Theor. Comput. Sci., 2020

Universal Algebra in UniMath.
CoRR, 2020

SAI: A Sensible Artificial Intelligence That Plays with Handicap and Targets High Scores in 9×9 Go.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019
SAI: a Sensible Artificial Intelligence that plays with handicap and targets high scores in 9x9 Go (extended version).
CoRR, 2019

SAI a Sensible Artificial Intelligence that plays Go.
Proceedings of the International Joint Conference on Neural Networks, 2019

2018
Descending chains and narrowing on template abstract domains.
Acta Informatica, 2018

A Taxonomy of Program Analyses.
Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

2017
Inferring linear invariants with parallelotopes.
Sci. Comput. Program., 2017

Experimental Evaluation of Numerical Domains for Inferring Ranges.
Proceedings of the Seventh Workshop on Numericaland Symbolic Abstract Domains, 2017

2016
Efficiently intertwining widening and narrowing.
Sci. Comput. Program., 2016

2015
Exploiting Linearity in Sharing Analysis of Object-oriented Programs.
Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

Sum of Abstract Domains.
Proceedings of the NASA Formal Methods - 7th International Symposium, 2015

Narrowing Operators on Template Abstract Domains.
Proceedings of the FM 2015: Formal Methods, 2015

2014
Optimal multibinding unification for sharing and linearity analysis.
Theory Pract. Log. Program., 2014

Efficient Constraint/Generator Removal from Double Description of Polyhedra.
Proceedings of the Fifth International Workshop on Numerical and Symbolic Abstract Domains, 2014

2013
Optimal multi-binding unification for sharing and linearity analysis.
CoRR, 2013

Localizing Widening and Narrowing.
Proceedings of the Static Analysis - 20th International Symposium, 2013

Numerical static analysis with Soot.
Proceedings of the 2nd ACM SIGPLAN International Workshop on State Of the Art in Java Program analysis, 2013

2012
Discovering invariants via simple component analysis.
J. Symb. Comput., 2012

The Abstract Domain of Parallelotopes.
Proceedings of the Fourth International Workshop on Numerical and Symbolic Abstract Domains, 2012

Analysis and Verification of Navigation Strategies by Abstract Interpretation of Cellular Automata.
Proceedings of the Motion in Games - 5th International Conference, 2012

Random: R-Based Analyzer for Numerical Domains.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2012

2011
Observational Completeness on Abstract Interpretation.
Fundam. Informaticae, 2011

2010
On the interaction between sharing and linearity.
Theory Pract. Log. Program., 2010

Deriving Numerical Abstract Domains via Principal Component Analysis.
Proceedings of the Static Analysis - 17th International Symposium, 2010

A Tool Which Mines Partial Execution Traces to Improve Static Analysis.
Proceedings of the Runtime Verification - First International Conference, 2010

2009
Optimality in goal-dependent analysis of Sharing.
Theory Pract. Log. Program., 2009

On the algebraic structure of declarative programming languages.
Theor. Comput. Sci., 2009

2005
Modeling Web Applications by the Multiple Levels of Integrity Policy.
Proceedings of the International Workshop on Automated Specification and Verification of Web Sites, 2005

2002
A General Framework for Variable Aliasing: Towards Optimal Operators for Sharing Properties.
Proceedings of the Logic Based Program Synthesis and Tranformation, 2002

2001
Sequent calculi and indexed categories as a foundation for logic programming.
PhD thesis, 2001

Correct Answers for First Order Logic.
Proceedings of the Declarative Programming, 2001

Indexed Categories and Bottom-Up Semantics of Logic Programs.
Proceedings of the Logic for Programming, 2001

Abstract Compilation for Sharing Analysis.
Proceedings of the Functional and Logic Programming, 5th International Symposium, 2001

2000
Abstract Interpretation Based Semantics of Sequent Calculi.
Proceedings of the Static Analysis, 7th International Symposium, 2000

1997
Properties of the Lattice of Observables in Logic Programming.
Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997


  Loading...