Damiano Zanardini

Orcid: 0000-0002-4202-3484

Affiliations:
  • Technical University of Madrid, Spain


According to our database1, Damiano Zanardini authored at least 29 papers between 2005 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Introducing New Node Prediction in Graph Mining: Predicting All Links from Isolated Nodes with Graph Neural Networks.
CoRR, 2024

2018
Field-sensitive sharing.
J. Log. Algebraic Methods Program., 2018

2017
Abstract Program Slicing: An Abstract Interpretation-Based Approach to Program Slicing.
ACM Trans. Comput. Log., 2017

Influencing over people with a social emotional model.
Neurocomputing, 2017

SICOMORo-CM: Development of Trustworthy Systems via Models and Advanced Tools.
Proceedings of the Software Technologies: Applications and Foundations, 2017

2016
Resource-usage-aware configuration in software product lines.
J. Log. Algebraic Methods Program., 2016

2014
Inference of Field-Sensitive Reachability and Cyclicity.
ACM Trans. Comput. Log., 2014

2013
Corrigendum to "Reachability-based acyclicity analysis by abstract interpretation" [Theoretical Computer Science 474 (2013) 60-79].
Theor. Comput. Sci., 2013

Reachability-based acyclicity analysis by Abstract Interpretation.
Theor. Comput. Sci., 2013

Inference of Field-Dependent Cyclicity.
CoRR, 2013

2012
Cost analysis of object-oriented bytecode programs.
Theor. Comput. Sci., 2012

Class-level Non-Interference.
New Gener. Comput., 2012

Towards product configuration taking into account quality concerns.
Proceedings of the 16th International Software Product Line Conference, 2012

Automatic Inference of Bounds on Resource Consumption.
Proceedings of the Formal Methods for Components and Objects, 2012

2011
Task-level analysis for a language with async/finish parallelism.
Proceedings of the ACM SIGPLAN/SIGBED 2011 conference on Languages, 2011

2009
Termination and Cost Analysis with COSTA and its User Interfaces.
Proceedings of the Ninth Spanish Conference on Programming and Languages, 2009

18th Workshop on Logic-based methods in Programming Environments (WLPE 2008)
CoRR, 2009

Resource Usage Analysis and Its Application to Resource Certification.
Proceedings of the Foundations of Security Analysis and Design V, 2009

2008
The Semantics of Abstract Program Slicing.
Proceedings of the Eighth IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2008), 2008

Removing useless variables in cost analysis of Java bytecode.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

Data dependencies and program slicing: from syntax to abstract semantics.
Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, 2008

Termination Analysis of Java Bytecode.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2008

2007
Experiments in Cost Analysis of Java Bytecode.
Proceedings of the Second Workshop on Bytecode Semantics, 2007

Analyzing Non-Interference with respect to Classes.
Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode.
Proceedings of the Formal Methods for Components and Objects, 6th International Symposium, 2007

Cost Analysis of Java Bytecode.
Proceedings of the Programming Languages and Systems, 2007

2006
Certified abstract non-interference.
PhD thesis, 2006

Abstract non-interference in a fragment of Java bytecode.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

2005
Higher-Order Abstract Non-interference.
Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005


  Loading...