Arrow Research search

Author name cluster

Michael Lienhardt

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

FM Conference 2026 Conference Paper

Automatic Memory Management for Dataflows

  • Michael Lienhardt

Abstract Memory management in High Performance Computing (HPC) is a very important topic, as slow reads and writes can add an important overhead to the execution of an HPC application. In particular, to take advantage of the vectorization capabilities and cache capacities of the hardware, many of such applications are designed to align their data in a certain way or to perform some operations inplace. However, ensuring that the data are correctly aligned and that the inplace operations do not create data-races is a manual and difficult task. Moreover, many HPC applications are configurable and their data and computation may vary at every run: in this context, it is often impossible to manually ensure optimal memory management. This paper proposes an approach that automatically generates a correct memory management with minimal overhead. Our approach is based on the dataflow computation model, and considers both data alignment constraints and inplace operations. We prove that the problem solved in this paper is NP-hard, and that our approach is sound and complete.

TCS Journal 2022 Journal Article

On logical and extensional characterizations of attributed feature models

  • Ferruccio Damiani
  • Michael Lienhardt
  • Luca Paolini

Software-intensive systems can have thousands of interdependent configuration options across different subsystems. Feature models (FMs) allow designers to organize the configuration space by describing configuration options using interdependent features: a feature is a name representing some functionality and each software variant is identified by a set of features. Attributed feature models (AFMs) extend FMs to describe the, possibly constrained, choice of a value from domains such as integers or strings: each attribute is associated to one feature, and when the feature is selected then the attribute brings some additional information relative to the selected features. Different representations of FMs and AFMs have been proposed in the literature. In this paper we focus on the logical representation (which works well in practice) and the extensional representation (which has been recently shown well suited for theoretical investigations). We provide an algebraic and a logical characterization of operations and relations on FMs and AFMs, and we formalize the connection between the two characterizations as monomorphisms from lattices of logical FMs and AFMs to lattices of extensional FMs and AFMs, respectively. This formalization sheds new light on the correspondence between the algebraic and logical characterizations of operations and relations for FMs and AFMs. It aims to foster the development of a formal framework for supporting practical exploitation of future theoretical developments on FMs, AFMs and multi software product lines.

v2026.09.13