Statically identifying XSS using deep learning
International audience
A single-source C++20 HLS flow for function evaluation on FPGA and beyond
This paper presents a framework to reuse the intelligence of RTL generators in a single-source HLS setting. This framework is illustrated by a C++ fixed-point library to generate mathematical function evaluator. A compiler flow from C++20 to Vivado IPs has been developed to make the library usable with Vitis HLS. This flow is demonstrated on two ap...
Design of Optimal Multiplierless FIR Filters
This work presents two novel optimization methods based on integer linear programming (ILP) that minimize the number of adders used to implement a direct/transposed finite impulse response (FIR) filter adhering to a given frequency specification. The proposed algorithms work by either fixing the number of adders used to implement the products (mult...
Testing interval arithmetic libraries, including their IEEE-1788 compliance
As developers of libraries implementing interval arithmetic, we faced the same difficulties when it came to testing our libraries. What must be tested? How can we devise relevant test cases for unit testing? How can we ensure a high (and possibly 100%) test coverage? In this paper we list the different aspects that, in our opinion, must be tested, ...
Efficient Emission Scheduling for Dynamic Massive IoT Monitoring
In current sensor-based monitoring solutions, each application involves a customized deployment and requires significant configuration efforts to adapt to changes in the sensor field. This becomes particularly problematic for massive deployments of battery-powered monitoring sensors.In this paper, we propose a generic solution for sensor emission s...
A New Approach to Polynomial Modular Number System Internal Reduction
The Polynomial Modular Number System (PMNS) is an alternative to the binary multi-precision representation that allows to transport the arithmetic of a finite field to a polynomial ring. The most important operation in that system is the internal reduction that follows any arithmetic operation. All recent works on the subject use the same algorithm...
Probably faster multiplication of sparse polynomials
In this paper, we present a probabilistic algorithm to multiply two sparse polynomials almost as efficiently as two dense univariate polynomials with a result of approximately the same size. The algorithm depends on unproven heuristics that will be made precise.
Emission scheduling strategies for massive-IoT: implementation and performance optimization
In today's monitoring solutions, each application involves custom deployment and requires significant configuration efforts to accommodate sensor changes. In contrast, in this paper, a massive deployment of battery-powered sensors is considered and we propose a more versatile monitoring solution that is not tied to physical device deployment.We cha...
FLODAM: Cross-Layer Reliability Analysis Flow for Complex Hardware Designs
Modern technologies make hardware designs more and more sensitive to radiation particles and related faults. As a result, analysing the behavior of a system under radiationinduced faults has become an essential part of the system design process. Existing approaches either focus on analysing the radiation impact at the lower hardware design layers, ...
Formalization of double-word arithmetic, and comments on "Tight and rigorous error bounds for basic building blocks of d...
Recently, a complete set of algorithms for manipulating double-word numbers (some classical, some new) was analyzed [15]. We have formally proven all the theorems given in that paper, using the Coq proof assistant. The formal proof work led us to: i) locate mistakes in some of the original paper proofs (mistakes that, however, do not hinder the val...
