Francesca Scozzari

Orcid: 0000-0002-2105-4855

According to our database1, Francesca Scozzari authored at least 42 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Optimal matching for sharing and linearity analysis.
CoRR, 2024


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

A survey on the role of artificial intelligence in managing Long COVID.
Frontiers Artif. Intell., February, 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

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

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

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

Preface.
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

2005
Making abstract domains condensing.
ACM Trans. Comput. Log., 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
Logical optimality of groundness analysis.
Theor. Comput. Sci., 2002

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

2000
Making abstract interpretations complete.
J. ACM, 2000

Abstract Domains for Sharing Analysis by Optimal Semantics.
Proceedings of the Static Analysis, 7th International Symposium, 2000

1998
A Logical Model for Relational Abstract Domains.
ACM Trans. Program. Lang. Syst., 1998

Complete Abstract Interpretations Made Constructive.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Building Complete Abstract Interpretations in a Linear Logic-based Setting.
Proceedings of the 1998 Joint Conference on Declarative Programming, 1998

1997
Intuitionistic Implication in Abstract Interpretation.
Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997

1996
The And-compositionality of CLP Computed Answer Constraints.
Proceedings of the 1996 Joint Conf. on Declarative Programming, 1996

1995
Contributions to a Theory of Existential Termination for Definite Logic Programs.
Proceedings of the 1995 Joint Conference on Declarative Programming, 1995


  Loading...