Isabella Mastroeni

Dr. Isabella Mastroeni


Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2004
Verified
Conference Paper
Open access
PDF file
RGRoberto Giacobazzi
Roberto Giacobazzi
IMIsabella Mastroeni
Isabella Mastroeni

5 February 2018 in ACM Transactions on Privacy and Security
Verified
Journal Article
Open access
PDF file
RGRoberto Giacobazzi
Roberto Giacobazzi
IMIsabella Mastroeni
Isabella Mastroeni
Non-interference happens when some elements of a dynamic system do not interfere, i.e., do not affect, other elements in the same system. Originally introduced in language-based security, non-interference means that the manipulation of private information has no effect on public observations of data. In this article, we introduceabstract non-interferenceas a weakening of non-interference by abstract interpretation. Abstract non-interference is parametric on which private information we want to protect and which are the observational capabilities of the external observer, i.e., what the attacker can observe of a computation and of the data manipulated during the computation. This allows us to model a variety of situations in information-flow security, where the security of a system can be mastered by controlling the degree of precision of the strongest harmless attacker and the properties that are potentially leaked in case of successful attack.

7 January 2008
Verified
Conference Paper
Open access
PDF file
IMIsabella Mastroeni
Isabella Mastroeni
DZDamiano Zanardini
Damiano Zanardini
We discuss the relation between program slicing and data dependencies. We claim that slicing can be defined, and therefore calculated, parametrically on the chosen notion of dependency, which implies a different result when building the program dependency graph. In this framework, it is possible to choose dependency in the syntactic or semantic sense, thus leading to compute possibly different, smaller slices. Moreover, the notion of abstract dependency, based on properties instead of exact data values, is investigated in its theoretical meaning. Constructive ideas are given to compute abstract dependencies on expressions, and to transform properties in order to rule out some dependencies. The application of these ideas to information flow is also discussed. Categories and Subject Descriptors D.2.4 [Software/Program Verification]: Formal Methods; D.3.1 [Formal Definitions and Theory]: Semantics; F.3.2 [Semantics of Programming Languages]:Program analysis; I.1.0 [General]General Terms Languages, Security, Theory, Verificatio

23 January 2012
Verified
Conference Paper
Open access
PDF file
RGRoberto Giacobazzi
Roberto Giacobazzi
NJNeil D. Jones
Neil D. Jones
IMIsabella Mastroeni
Isabella Mastroeni

1 December 2003 in Higher-Order and Symbolic Computation
Verified
Journal Article
Closed access
PDF file
RGRoberto Giacobazzi
Roberto Giacobazzi
IMIsabella Mastroeni
Isabella Mastroeni

21 January 2021 in ACM Transactions on Privacy and Security
Verified
Journal Article
Open access
VAVincenzo Arceri
Vincenzo Arceri
IMIsabella Mastroeni
Isabella Mastroeni
Dynamic languages, such as JavaScript, employ string-to-code primitives to turn dynamically generated text into executable code at run-time. These features make standard static analysis extremely hard if not impossible, because its essential data structures, i.e., the control-flow graph and the system of recursive equations associated with the program to analyze, are themselves dynamically mutating objects. Nevertheless, assembling code at run-time by manipulating strings, such as by eval in JavaScript, has been always strongly discouraged, since it is often recognized that “ eval is evil ,” leading static analyzers to not consider such statements or ignoring their effects. Unfortunately, the lack of formal approaches to analyze string-to-code statements pose a perfect habitat for malicious code, that is surely evil and do not respect good practice rules, allowing them to hide malicious intents as strings to be converted to code and making static analyses blind to the real malicious aim of the code. Hence, the need to handle string-to-code statements approximating what they can execute, and therefore allowing the analysis to continue (even in the presence of dynamically generated program statements) with an acceptable degree of precision, should be clear. To reach this goal, we propose a static analysis allowing us to collect string values and to soundly over-approximate and analyze the code potentially executed by a string-to-code statement.