Madalina Erascu

Madalina Erascu
West University of Timisoara · Department of Computer Science

PhD

About

21
Publications
14,375
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
127
Citations
Citations since 2017
9 Research Items
105 Citations
20172018201920202021202220230510152025
20172018201920202021202220230510152025
20172018201920202021202220230510152025
20172018201920202021202220230510152025
Introduction
In general, I am interested in developing algorithmic methods for building and maintaining reliable algorithms. To achieve this goal, I am combining theoretical research in formal methods, automated theorem proving and computer algebra motivated by practical applications in Cloud Computing, Big Data and Machine/Deep Learning. Currently, I am interested in symmetry and similarities techniques for speeding-up the finding of solutions of constraint optimization/satisfaction problems.
Additional affiliations
February 2016 - September 2021
West University of Timisoara
Position
  • Lecturer
February 2014 - present
Institute e-Austria Timisoara
Institute e-Austria Timisoara
Position
  • Researcher

Publications

Publications (21)
Article
Dealing with the provisioning of Cloud services granted by Security SLAs is a very challenging research topic. At the state of the art, the main related issues involve: (i) representing security features so that it is understandable by both customers and providers and measurable (by means of verifiable security-related Service Level Objectives (SLO...
Article
Automated deployment of component-based applications in the Cloud consists in the allocation of virtual machines (VMs) offers from various Cloud Providers such that the constraints induced by the interactions between components and by the components hardware/software requirements are satisfied and the performance objectives are optimized (e.g. cost...
Preprint
The problem of Cloud resource provisioning for component-based applications consists in the allocation of virtual machines (VMs) offers from various Cloud Providers to a set of applications such that the constraints induced by the interactions between components and by the components hardware/software requirements are satisfied and the performance...
Conference Paper
Full-text available
The problem of Cloud resource provisioning for component-based applications is very important. It consists in the allocation of virtual machines (VMs) from various Cloud Providers (CPs), to a set of applications such that the constraints induced by the inter- actions between components and by the components hardware/software requirements are satisf...
Conference Paper
Full-text available
The word post-truth was considered by Oxford Dictionaries Word of the Year 2016. The word is an adjective relating to or denoting circumstances in which objective facts are less influential in shaping public opinion than appeals to emotion and personal belief. This leads to misinformation and problems in society. Hence, it is important to make eff...
Conference Paper
We present our efforts on the formalization and automated formal verification of data-intensive applications based on the Storm technology, a well known and pioneering framework for developing streaming applications. The approach is based on the so-called array-based systems formalism, introduced by Ghilardi et al., a suitable abstraction of infini...
Conference Paper
We present an approach for the automated formal verification of distributed systems based on the Storm technology. The approach is based on a formal model of the behavior of Storm topologies given in terms of the CLTLoc metric temporal logic extended with counters. We present a tool-supported mechanism to automatically generate formal models from h...
Conference Paper
This paper presents efficient simplification techniques tailored for sign semi-definite conditions (SsDCs). The SsDCs for a polynomial \(f\in \mathbb {R}[y]\) with parametric coefficients are written as \(\underset{\begin{array}{c} y\\ L \le y \le U \end{array}}{\forall }\ f(y) \ge 0\) and \(\underset{\begin{array}{c} y\\ L \le y \le U \end{array}}...
Conference Paper
Quality-driven frameworks for developing data-intensive applications are becoming more and more popular, following the remarkable popularity of Big Data approaches. The DICE framework, designed within the DICE project (www.dice-h2020.eu), has the goal of offering a novel profile and tools for data-aware quality-driven development. One of its tools...
Conference Paper
We report on our on-going efforts to apply real quantifier elimination to the (semi-) automatic complexity analysis of numerical algorithms. In particular, we describe a case study on the square root problem: given a real number x and an error bound eps, find a real interval such that it contains sqrt(x) and its width is less than or equal to eps....
Article
We report on on-going efforts to apply real quantifier elimination to the synthesis of optimal numerical algorithms. In particular, we describe a case study on the square root problem: given a real number x and an error bound ε, find a real interval such that it contains [EQUATION] and its width is less than or equal to ε. A typical numerical algor...
Article
Consider the problem: given a real number x and an error bound eps, find an interval such that it contains sqrt(x) and its width is less than eps. One way to solve the problem is to start with an initial interval and repeatedly to update it by applying an interval refinement map on it until it becomes narrow enough. In this paper, we prove that the...
Conference Paper
We present a logic-based verification method for imperative loops (including ones with abrupt termination) and the automatic proof of its soundness. The verification method consists in generating verification conditions for total correctness of an imperative loop annotated with an invariant. We realized, in the \textit{Theorem a} system (\url{www.t...
Conference Paper
We present and illustrate a method for the generation of the termination conditions for nested loops with abrupt termination statements. The conditions are (first-order) formulae obtained by certain transformations of the program text. The loops are treated similarly to calls of recursively defined functions. The program text is analyzed on all pos...
Conference Paper
As an extension of our previous work on imperative program verification, we present a formalism for handling the total correctness of While loops in imperative programs, consisting in functional based definitions of the verification conditions for both partial correctness and for termination.A specific feature of our approach is the generation of v...

Network

Cited By

Projects

Projects (4)
Project
Our life depends on software and systems using software. Nowadays, software is complex and, hence, error-prone. In order to overcome this problem, we need methods for assisting the software development. This project addresses the challenging problem of program analysis by developing rigorous mathematical techniques dealing with the logically complex parts of software. At this aim, we will use, refine and combine methods from satisfiability checking, graph neural networks and symbolic computation. These will make possible the analysis of software that is beyond the power of existing methods since advanced symbolic computation techniques (invariant theory) and graph neural networks combined with satisfiability checking (SAT/SMT solving) is not exploited in the state-of-the-art program analysis methods and tools. e are going to develop new theory and algorithms that detects the problem symmetries and similarities in family of problems by combining invariant theory, graph neural networks and SAT/SMT solving which, unlike state-of-the-art, would allow solving efficiently theoretically intractable problems. Our research project targets the analysis of complex software and follows three main research directions: (1) Methods for symmetry breaking and for learning problems similarities (2) Theory and algorithms (3) Tools and evaluations Director: Mădălina Eraşcu Funding Agency: UEFISCDI (PN-III-P1-1.1-TE-2021-0676) Project Period: September 2022 - August 2024 Host Institution: West University of Timisoara Website: https://merascu.github.io/links/SAGE.html
Project
Cloud computing offers attractive options to migrate corporate applications without the software personnel (End Users - EUs) needing to manage any physical resources. While this "ease" is appealing, several issue arise: Which Cloud Providers (CPs) offer the best infrastructure at a fair budget? I am no Cloud expert then what are the characteristics of the infrastructure which best fit my application? To answer these questions one must solve a resource management problem, that is, the allocation of computing, storage, networking and (indirectly) cost resources to a set of applications such that the performance objectives of the application, CPs and EUs are jointly fulfilled. Efficient resource use is typically achieved through virtualization technologies, which facilitate statistical multiplexing of resources across the three parties. There are many approaches which answer separately these questions but there is no comprehensive and easily usable solution for these issues. MANeUveR solves this problem by integrating the following components: A Provider Acquisition Module, through a Web crawler, will periodically update a database with infrastructure details, in particular virtual machines (VMs) offers (CPUs number, memory, storage, price, operating system, number of IP addresses, transfer rate, etc.) from various CPs. An Application Description Module will provide the EU the capability to describe and store the VMs characteristics and application constraints in order to be consulted other times and to obtain a profile of the application. A Recommendation Module will provide a (sub)optimal solution for application deployment in the CP infrastructure regarding the number of VMs needed for deployment and their characteristics. Using a secure-billing e-mail service and secured web container applications, MANeUveR will demonstrate its effectiveness in real life. The tool will be based on an open-source core to motivate its wide adoption.
Project
Characterizing and understanding the performance of mathematical libraries under various architectures and OSs. Project sponsored by ESA. The specific target is newlib (https://sourceware.org/newlib/).