This paper tackles the challenge of creating a numerical abstract domain that can identify affine-inequality invariants while handling overflow in arithmetic operations over bit-vector data-types. The paper describes the design and implementation of a class of new abstract domains, called the Bit-Vector-Sound, Finite-Disjunctive (BVSFD) domains. We introduce a framework that takes an abstract d...

Zonotopes are a convenient abstract domain for the precise analysis of programs with numerical variables. Compared to the domain of convex polyhedra, it is less expensive and may easily handle non-linear assignments. However, the classical join operator of this abstract domain does not always preserve linear invariants, unlike the convex hull. We present a global join operator that preserves so...

The aim of static analysis is to infer invariants about programs that are tight enough to establish semantic properties, like the absence of run-time errors. In the last decades, several branches of the static analysis of imperative programs have made significant progress, such as in the inference of numeric invariants or the computation of data structures properties (using pointer abstractions...

The breadth and depth of heap properties that can be inferred by the union of today’s shape analyses is quite astounding. Yet, achieving scalability while supporting a wide range of complex data structures in a generic way remains a long-standing challenge. In this paper, we propose a way to side-step this issue by defining a generic abstract domain combinator for combining memory abstractions ...

The breadth and depth of heap properties that can be inferred by the union of today’s shape analyses is quite astounding. Yet, achieving scalability while supporting a wide range of complex data structures in a generic way remains a long-standing challenge. In this paper, we propose a way to side-step this issue by defining a generic abstract domain combinator for combining memory abstractions ...

syntax. A portion of the abstract syntax for Ownership Domains is presented (Figure 2.2), focusing on class declarations, field declarations, expressions e.g., method invocations, field reads and field writes. The meta-variable C ranges over class names; T ranges over types; f ranges over fields; v ranges over values; d ranges over domain names; and p ranges over formal domain parameters, actua...

Keyphrase identification and classification is a Natural Language Processing Information Retrieval task that involves extracting relevant groups of words from given text related to the main topic. In this work, we focus on keyphrases scientific documents. We introduce TA-DA, Topic-Aware Domain Adaptation framework for keyphrase extraction integrates Multi-Task Learning with Adversarial Training...

Two studies were performed to test whether abstract concepts are grounded in experience and activate introspective/linguistic information. In Study 1, four groups of participants, each with different expertise in the domain of safety and security at the workplace (S&S), defined abstract concepts belonging to the S&S domain and differing in degree of abstractness. The definitions included mainly...

In the context of standard abstract interpretation theory, we deene and study a systematic operator of reduced relative power for composing functionally abstract domains. The reduced relative power of two abstract domains D1 (the exponent) and D2 (the base) consists in a suitably deened lattice of monotone functions from D1 to D2, called dependencies, and it is a generalization of the Cousot an...