Caterina Urban

Orcid: 0000-0002-8127-9642

Affiliations:
  • Inria, Paris, France


According to our database1, Caterina Urban authored at least 31 papers between 2013 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
Monotonicity and the Precision of Program Analysis.
Proc. ACM Program. Lang., January, 2024

Abstract Interpretation-Based Feature Importance for Support Vector Machines.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2024

2023
A Formal Framework to Measure the Incompleteness of Abstract Interpretations.
Proceedings of the Static Analysis - 30th International Symposium, 2023

Static Analysis of Data Transformations in Jupyter Notebooks.
Proceedings of the 12th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis, 2023

2022
Abstract Interpretation-Based Data Leakage Static Analysis.
CoRR, 2022

Abstract Interpretation-Based Feature Importance for SVMs.
CoRR, 2022

Verifying Attention Robustness of Deep Neural Networks against Semantic Perturbations.
Proceedings of the 29th Asia-Pacific Software Engineering Conference, 2022

2021
A Review of Formal Methods applied to Machine Learning.
CoRR, 2021

Fair Training of Decision Tree Classifiers.
CoRR, 2021

Reduced Products of Abstract Domains for Fairness Certification of Neural Networks.
Proceedings of the Static Analysis - 28th International Symposium, 2021

Fairness-Aware Training of Decision Trees by Abstract Interpretation.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020
Perfectly parallel fairness certification of neural networks.
Proc. ACM Program. Lang., 2020

What Programs Want: Automatic Inference of Input Data Specifications.
CoRR, 2020

2019
Static Analysis of Data Science Software.
Proceedings of the Static Analysis - 26th International Symposium, 2019

2018
Abstract Interpretation of CTL Properties.
Proceedings of the Static Analysis - 25th International Symposium, 2018

An Abstract Interpretation Framework for Input Data Usage.
Proceedings of the Programming Languages and Systems, 2018

MaxSMT-Based Type Inference for Python 3.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

Permission Inference for Array Programs.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
Abstract Interpretation as Automated Deduction.
J. Autom. Reason., 2017

Inference of ranking functions for proving temporal properties by abstract interpretation.
Comput. Lang. Syst. Struct., 2017

Precise Widening Operators for Proving Termination by Abstract Interpretation.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

2016
Concurrency with Weak Memory Models (Dagstuhl Seminar 16471).
Dagstuhl Reports, 2016

Synthesizing Ranking Functions from Bits and Pieces.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Büchi, Lindenbaum, Tarski: A Program Analysis Appetizer.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Static Analysis by Abstract Interpretation of Functional Temporal Properties of Programs. (Analyse Statique par Interprétation Abstraite de Propriétés Temporelles Fonctionnelles des Programmes).
PhD thesis, 2015

Proving Guarantee and Recurrence Temporal Properties by Abstract Interpretation.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2015

FuncTion: An Abstract Domain Functor for Termination - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Conflict-Driven Conditional Termination.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
A Decision Tree Abstract Domain for Proving Conditional Termination.
Proceedings of the Static Analysis - 21st International Symposium, 2014

An Abstract Domain to Infer Ordinal-Valued Ranking Functions.
Proceedings of the Programming Languages and Systems, 2014

2013
The Abstract Domain of Segmented Ranking Functions.
Proceedings of the Static Analysis - 20th International Symposium, 2013


  Loading...