Madalina Erascu

Orcid: 0000-0002-0435-5883

Affiliations:
  • West University of Timisoara, Romania


According to our database1, Madalina Erascu authored at least 25 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast and Exact Synthesis of Application Deployment Plans using Graph Neural Networks and Satisfiability Modulo Theory.
Proceedings of the International Joint Conference on Neural Networks, 2024

2023
Benchmarking Local Robustness of High-Accuracy Binary Neural Networks for Enhanced Traffic Sign Recognition.
Proceedings of the Proceedings 7th Symposium on Working Formal Methods, 2023

Benchmarking Optimization Solvers and Symmetry Breakers for the Automated Deployment of Component-based Applications in the Cloud (EXTENDED ABSTRACT).
CoRR, 2023

Architecturing Binarized Neural Networks for Traffic Sign Recognition.
Proceedings of the Artificial Neural Networks and Machine Learning, 2023

SAGE - A Tool for Optimal Deployments in Kubernetes Clusters.
Proceedings of the IEEE International Conference on Cloud Computing Technology and Science, 2023

2022
Automatic Deployment of Component-based Applications in the Cloud (short paper).
Proceedings of the 7th SC-Square Workshop co-located with the Federated Logic Conference, 2022

Transferring Learning into the Workplace: Evaluating a Student-centered Learning Approach through Computer Science Students' Lens.
Proceedings of the 14th International Conference on Computer Supported Education, 2022

2021
Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking.
J. Log. Algebraic Methods Program., 2021

2018
An Architecture for a Management Agency for Cloud Resources.
Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018

A Tool for Fake News Detection.
Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018

Influence of Variables Encoding and Symmetry Breaking on the Performance of Optimization Modulo Theories Tools Applied to Cloud Resource Selection.
Proceedings of the LPAR-22 Workshop and Short Paper Proceedings, 2018

Constraint Satisfaction Approaches in Cloud Resource Selection for Component Based Applications.
Proceedings of the 14th IEEE International Conference on Intelligent Computer Communication and Processing, 2018

2017
Automatically Enforcing Security SLAs in the Cloud.
IEEE Trans. Serv. Comput., 2017

Formal verification of data-intensive applications through model checking modulo theories.
Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, 2017

2016
Real quantifier elimination for the synthesis of optimal numerical algorithms (Case study: Square root computation).
J. Symb. Comput., 2016

A tool for verification of big-data applications.
Proceedings of the 2nd International Workshop on Quality-Aware DevOps, 2016

Towards the Formal Verification of Data-Intensive Applications Through Metric Temporal Logic.
Proceedings of the Formal Methods and Software Engineering, 2016

A Security SLA-driven Methodology to Set-Up Security Capabilities on Top of Cloud Services.
Proceedings of the 10th International Conference on Complex, 2016

Efficient Simplification Techniques for Special Real Quantifier Elimination with Applications to the Synthesis of Optimal Numerical Algorithms.
Proceedings of the Computer Algebra in Scientific Computing - 18th International Workshop, 2016

2014
Semi-automatic analysis of algorithm complexity (Case study: Square-root computation).
Proceedings of the IEEE 12th International Symposium on Intelligent Systems and Informatics, 2014

Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation).
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013
The Secant-Newton Map is Optimal Among Contracting Quadratic Maps for Square Root Computation.
Reliab. Comput., 2013

2012
Soundness of a Logic-Based Verification Method for Imperative Loops.
Proceedings of the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012

2010
A Purely Logical Approach to the Termination of Imperative Loops.
Proceedings of the 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2010

2009
A Calculus for Imperative Programs: Formalization and Implementation.
Proceedings of the 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009


  Loading...