Paolo Enrico Camurati

Dr. Paolo Enrico Camurati

orcid

Research Focus & Metrics

Academic Career Length

36Years (1991-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 February 2019 in Electronics
Verified
Journal Article
Open access
PDF file
GCGianpiero Cabodi
Gianpiero Cabodi
PCPaolo Enrico Camurati
Paolo Enrico Camurati
AGAlessandro Garbo
Alessandro Garbo
MGMichele Giorelli
Michele Giorelli
Stefano QuerStefano Quer
Stefano Quer
FSFrancesco Savarese
Francesco Savarese
Research on autonomous cars, early intensified in the 1990s, is becoming one of the main research paths in automotive industry. Recent works use Rapidly-exploring Random Trees to explore the state space along a given reference path, and to compute the minimum time collision-free path in real time. Those methods do not require good approximations of the reference path, they are able to cope with discontinuous routes, they are capable of navigating in realistic traffic scenarios, and they derive their power from an extensive computational effort directed to improve the quality of the trajectory from step to step. In this paper, we focus on re-engineering an existing state-of-the-art sequential algorithm to obtain a CUDA-based GPGPU (General Purpose Graphics Processing Units) implementation. To do that, we show how to partition the original algorithm among several working threads running on the GPU, how to propagate information among threads, and how to synchronize those threads. We also give detailed evidence on how to organize memory transfers between the CPU and the GPU (and among different CUDA kernels) such that planning times are optimized and the available memory is not exceeded while storing massive amounts of fuse data. To sum up, in our application the GPU is used for all main operations, the entire application is developed in the CUDA language, and specific attention is paid to concurrency, synchronization, and data communication. We run experiments on several real scenarios, comparing the GPU implementation with the CPU one in terms of the quality of the generated paths and in terms of computation (wall-clock) times. The results of our experiments show that embedded GPUs can be used as an enabler for real-time applications of computationally expensive planning approaches.

9 June 2024 in Algorithms
Verified
Journal Article
Open access
PDF file
GCGianpiero Cabodi
Gianpiero Cabodi
PCPaolo Enrico Camurati
Paolo Enrico Camurati
MPMarco Palena
Marco Palena
Paolo PasiniPaolo Pasini
Paolo Pasini
Digital systems are nowadays ubiquitous and often comprise an extremely high level of complexity. Guaranteeing the correct behavior of such systems has become an ever more pressing need for manufacturers. The correctness of digital systems can be addressed resorting to formal verification techniques, such as model checking. Currently, it is usually impossible to determine a priori the best algorithm to use given a verification task and, thus, portfolio approaches have become the de facto standard in model checking verification suites. This paper describes the most relevant algorithms and techniques, at the foundations of bit-level SAT-based model checking itself.

7 May 2019 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
GCGianpiero Cabodi
Gianpiero Cabodi
PCPaolo Enrico Camurati
Paolo Enrico Camurati
MPM. Palena
M. Palena
Paolo PasiniPaolo Pasini
Paolo Pasini
DVDanilo Vendraminetto
Danilo Vendraminetto
We address the problem of reducing the size of Craig’s interpolants used in SAT-based Model Checking. Whereas it is well known that interpolants are highly redundant, their compaction is typically tackled by reducing the proof graph and/or by exploiting standard logic synthesis techniques. Furthermore, strengthening and weakening have been studied as options to control interpolant quality. In this paperSome of the techniques here described were presented in a preliminary version at FMCAD’16 Cabodi2016 we propose a SAT-based interpolant weakening/strengthening technique, for interpolant compaction, where the UNSAT core extracted from an additional SAT query is used to obtain a gate-level abstraction of the interpolant. The abstraction introduces fresh new variables at gate cuts that must be quantified out in order to obtain a valid interpolant. We show how to efficiently quantify them out, by working on an NNF representation of the circuit. The paper includes an experimental evaluation, showing the benefits of the proposed approach, on a set of benchmark interpolants arising from hardware model checking problems.

19 September 2019 in Electronics
Verified
Journal Article
Open access
PDF file
GCGianpiero Cabodi
Gianpiero Cabodi
PCPaolo Enrico Camurati
Paolo Enrico Camurati
FFFabrizio Finocchiaro
Fabrizio Finocchiaro
DVDanilo Vendraminetto
Danilo Vendraminetto
Spectre and Meltdown attacks in modern microprocessors represent a new class of attacks that have been difficult to deal with. They underline vulnerabilities in hardware design that have been going unnoticed for years. This shows the weakness of the state-of-the-art verification process and design practices. These attacks are OS-independent, and they do not exploit any software vulnerabilities. Moreover, they violate all security assumptions ensured by standard security procedures, (e.g., address space isolation), and, as a result, every security mechanism built upon these guarantees. These vulnerabilities allow the attacker to retrieve leaked data without accessing the secret directly. Indeed, they make use of covert channels, which are mechanisms of hidden communication that convey sensitive information without any visible information flow between the malicious party and the victim. The root cause of this type of side-channel attacks lies within the speculative and out-of-order execution of modern high-performance microarchitectures. Since modern processors are hard to verify with standard formal verification techniques, we present a methodology that shows how to transform a realistic model of a speculative and out-of-order processor into an abstract one. Following related formal verification approaches, we simplify the model under consideration by abstraction and refinement steps. We also present an approach to formally verify the abstract model using a standard model checker. The theoretical flow, reliant on established formal verification results, is introduced and a sketch of proof is provided for soundness and correctness. Finally, we demonstrate the feasibility of our approach, by applying it on a pipelined DLX RISC-inspired processor architecture. We show preliminary experimental results to support our claim, performing Bounded Model-Checking with a state-of-the-art model checker.

30 July 2025
Verified
Book Chapter
Open access
GSGiulia Sindoni
Giulia Sindoni
Paolo PasiniPaolo Pasini
Paolo Pasini
GCGianpiero Cabodi
Gianpiero Cabodi
PCPaolo Enrico Camurati
Paolo Enrico Camurati
AGAlberto Griggio
Alberto Griggio
STStefano Tonetta
Stefano Tonetta
In the field of formal verification, certifying proofs serve as compelling evidence to demonstrate the correctness of a model within a deductive system. These proofs can be automatically generated as a by-product of the verification process and are key artifacts for high-assurance systems. Their significance lies in their ability to be independently verified by proof checkers, which provides a more convenient approach than certifying the tools that generate them. Modern model checking algorithms adopt deductive methods and usually generate proofs in terms of inductive invariants, assuming that these apply to the original system under verification. Model checkers, though, often make use of a range of complex pre-processing simplifications and transformations to ease the verification process, which add another layer of complexity to the generation of proofs. In this paper, we present a novel approach for certifying model checking results exploiting a theorem prover and a theory of temporal deductive rules that can support various kinds of transformations and simplification of the original circuit. We implemented and experimentally evaluated our contribution on invariants generated using two state-of-the-art model checkers, nuXmv and PdTRAV, and by defining a set of rules within a theorem prover, to validate each certificate.

11 April 2024 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
GCGianpiero Cabodi
Gianpiero Cabodi
PCPaolo Enrico Camurati
Paolo Enrico Camurati
JMJoao Marques-Silva
Joao Marques-Silva
MPMarco Palena
Marco Palena
Paolo PasiniPaolo Pasini
Paolo Pasini
Machine learning (ML) is ever more frequently used as a tool to aid decision making. The need to understand the decisions made by ML algorithms has sparked a renewed interest in explainable ML models. A number of known models are often regarded as interpretable by human decision makers with varying degrees of difficulty. The size of such models plays a crucial role in determining how easily they can be understood by a human. In this article we propose the use of binary decision diagrams (BDDs) as an interpretable ML model. BDDs can be deemed as interpretable as decision trees (DTs) while offering a often more compact representation due to node sharing. Fixed variable ordering also allows for more concise explanations. We propose a SAT-based approach for learning optimal BDDs that exhibit perfect accuracy on training data. We also explore heuristic methods for computing suboptimal BDDs, in order to improve scalability. We also investigate procedures to transform instances of known ML models into BDDs in order to provide more concise explanations.