Roberto Amadini

Sunny-as2: Enhancing SUNNY for Algorithm Selection (Extended Abstract)

T Liu, R Amadini, M Gabbrielli, J Mauro

Conference Proceedings  |  2022  |  IJCAI International Joint Conference on Artificial Intelligence

SUNNY is a k-nearest neighbors based Algorithm Selection (AS) approach that schedules and runs a number of solvers for a given unf..

A Survey on String Constraint Solving

R Amadini

Journal article  |  2021  |  ACM Computing Surveys

String constraint solving refers to solving combinatorial problems involving constraints over string variables. String solving app..

sunny-as2: Enhancing sunny for algorithm selection

T Liu, R Amadini, M Gabbrielli, J Mauro

Journal article  |  2021  |  Journal of Artificial Intelligence Research

SUNNY is an Algorithm Selection (AS) technique originally tailored for Constraint Programming (CP). SUNNY is based on the k-neares..

Algorithm Selection for Dynamic Symbolic Execution: A Preliminary Study

R Amadini, G Gange, P Schachte, H Søndergaard, PJ Stuckey

Conference Proceedings  |  2021  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Given a portfolio of algorithms, the goal of Algorithm Selection (AS) is to select the best algorithm(s) for a new, unseen problem..

Dashed strings for string constraint solving

R Amadini, G Gange, PJ Stuckey

Journal article  |  2020  |  Artificial Intelligence

String processing is ubiquitous across computer science, and arguably more so in web programming — where it is also a critical par..

Abstract interpretation, symbolic execution and constraints

R Amadini, G Gange, P Schachte, H Søndergaard, PJ Stuckey

Conference Proceedings  |  2020  |  OpenAccess Series in Informatics

Dashed Strings and the Replace(-all) Constraint

Roberto Amadini, Graeme Gange, Peter J Stuckey

Conference Proceedings  |  2020  |  26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings

Dashed strings are a formalism for modelling the domain of string variables when solving combinatorial problems with string constr..

String constraint solving: past, present and future

Roberto Amadini, Graeme Gange, Peter Schachte, Harald Sondergaard, Peter J Stuckey

Conference Proceedings  |  2020  |  24th European Conference on Artificial Intelligence, Proceedings

String constraint solving is an important emerging field, given the ubiquity of strings over different fields such as formal analy..

Abstract interpretation, symbolic execution and constraints

Roberto Amadini, Graeme Gange, Peter Schachte, Harald Sondergaard, Peter Stuckey

Book Chapter  |  2020

Abstract interpretation is a static analysis framework for sound over-approximation of all possible runtime states of a program. S..

Constraint Programming for Dynamic Symbolic Execution of JavaScript

R Amadini, M Andrlon, G Gange, P Schachte, H Søndergaard, PJ Stuckey

Conference Proceedings  |  2019  |  16th International Conference, CPAIOR 2019, Proceedings

Dynamic Symbolic Execution (DSE) combines concrete and symbolic execution, usually for the purpose of generating good test suites ..