Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rocco Salvia

dblp:226/0551 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2021
0009-0004-5754-3302ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Program verification · 50% Program analysis · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program verification › code-level verification
numerical program verification
0.512021
Rigorous Roundoff Error Analysis of Probabilistic Floating-Point Computations · CAV (2) 2021
Program analysis › numerical program analysis
roundoff error analysis
0.512021
Rigorous Roundoff Error Analysis of Probabilistic Floating-Point Computations · CAV (2) 2021

Methods — techniques the papers use, named apart from their topics

symbolic affine arithmetic · 0.5probabilistic error analysis · 0.5SMT · 0.5
YearPublicationVenuePosition
2021 Rigorous Roundoff Error Analysis of Probabilistic Floating-Point Computations
abstract
Abstract We present a detailed study of roundoff errors in probabilistic floating-point computations. We derive closed-form expressions for the distribution of roundoff errors associated with a random variable, and we prove that roundoff errors are generally close to being uncorrelated with their generating distribution. Based on these theoretical advances, we propose a model of IEEE floating-point arithmetic for numerical expressions with probabilistic inputs and an algorithm for evaluating this model. Our algorithm provides rigorous bounds to the output and error distributions of arithmetic expressions over random variables, evaluated in the presence of roundoff errors. It keeps track of complex dependencies between random variables using an SMT solver, and is capable of providing sound but tight probabilistic bounds to roundoff errors using symbolic affine arithmetic. We implemented the algorithm in the PAF tool, and evaluated it on FPBench, a standard benchmark suite for the analysis of roundoff errors. Our evaluation shows that PAF computes tighter bounds than current state-of-the-art on almost all benchmarks.
George A. Constantinides, Fredrik Dahlqvist, Zvonimir Rakamaric, Rocco Salvia
CAV (2)4
2019 Memory-Efficient Mixed-Precision Implementations for Robust Explicit Model Predictive Control
abstract
We propose an optimization for space-efficient implementations of explicit model-predictive controllers (MPC) for robust control of linear time-invariant (LTI) systems on embedded platforms. We obtain an explicit-form robust model-predictive controller as a solution to a multi-parametric linear programming problem. The structure of the controller is a polyhedral decomposition of the control domain, with an affine map for each domain. While explicit MPC is suited for embedded devices with low computational power, the memory requirements for such controllers can be high. We provide an optimization algorithm for a mixed-precision implementation of the controller, where the deviation of the implemented controller from the original one is within the robustness margin of the robust control problem. The core of the mixed-precision optimization is an iterative static analysis that co-designs a robust controller and a low-bitwidth approximation that is statically guaranteed to always be within the robustness margin of the original controller. We have implemented our algorithm and show on a set of benchmarks that our optimization can reduce space requirements by up to 20.9% and on average by 12.6% compared to a minimal uniform precision implementation of the original controller.
Mahmoud Salamati, Rocco Salvia, Eva Darulova, Sadegh Esmaeil Zadeh Soudjani, Rupak Majumdar
ACM Trans. Embed. Comput. Syst.2