Gianluca Amato

According to our database1, Gianluca Amato authored at least 29 papers between 1997 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 





Experimental Evaluation of Numerical Domains for Inferring Ranges.
Electr. Notes Theor. Comput. Sci., 2018

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

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

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

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

Exploiting Linearity in Sharing Analysis of Object-oriented Programs.
Electr. Notes Theor. Comput. Sci., 2016

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

Optimal multibinding unification for sharing and linearity analysis.
TPLP, 2014

Efficient Constraint/Generator Removal from Double Description of Polyhedra.
Electr. Notes Theor. Comput. Sci., 2014

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

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

The Abstract Domain of Parallelotopes.
Electr. Notes Theor. Comput. Sci., 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

On the interaction between sharing and linearity.
TPLP, 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

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

Observational Completeness on Abstract Interpretation.
Proceedings of the Logic, 2009

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

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

Optimality in Goal-Dependent Analysis of Sharing.
Proceedings of the AGP 2002: Proceedings of the Joint Conference on Declarative Programming, 2002

Correct Answers for First Order Logic.
Electr. Notes Theor. Comput. Sci., 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

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

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