Paolo Pasini

Dr. Paolo Pasini

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
1 January 2016 in Journal on Satisfiability, Boolean Modeling and Computation
Verified
Journal Article
Open access
PDF file
GCGianpiero Cabodi
Gianpiero Cabodi
CLCarmelo Loiacono
Carmelo Loiacono
MPMarco Palena
Marco Palena
Paolo PasiniPaolo Pasini
Paolo Pasini
DPDenis Patti
Denis Patti
KHKeijo Heljanko
Keijo Heljanko
Model checkers and sequential equivalence checkers have become essential tools for the semiconductor industry in recent years. The Hardware Model Checking Competition (HWMCC) was founded in 2006 with the purpose of intensifying research interest in t

11 May 2018 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
Riccardo CantoroRiccardo Cantoro
Riccardo Cantoro
FZFarrokh Ghani Zadegan
Farrokh Ghani Zadegan
MPMarco Palena
Marco Palena
Paolo PasiniPaolo Pasini
Paolo Pasini
ELErik Larsson
Erik Larsson
Matteo Sonza ReordaMatteo Sonza Reorda
Matteo Sonza Reorda
Modern devices often include several embedded instruments, such as BIST interfaces, sensors, calibration facilities. New standards, such as IEEE Std 1687, provide vehicles to access these instruments. In approaches based on reconfigurable scan networks (RSNs), instruments are coupled with scan registers, connected into chains and interleaved with reconfigurable modules. Such modules embed reconfigurable multiplexers that permit a selective access to different parts of the chain. A similar scenario is also supported by IEEE Std 1149.1-2013. The test of permanent faults affecting an RSN requires to shift test vectors throughout a certain number of network configurations. This paper presents some methodologies to select the list of configurations that perform the complete test of the reconfigurable modules of the RSN. In particular, one method is presented that, by construction, can be proved to be able to apply the test in the minimum amount of clock cycles. Other methods are sub-optimal in terms of test application time (TAT), but scale well on large circuits. In order to provide a comparison between the proposed methods, experimental results on some benchmark RSNs are provided.

27 November 2024 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Open access
RBRoberto Bosio
Roberto Bosio
FMFilippo Minnella
Filippo Minnella
TUTeodoro Urso
Teodoro Urso
Mario R. CasuMario R. Casu
Mario R. Casu
Luciano LavagnoLuciano Lavagno
Luciano Lavagno
Paolo PasiniPaolo Pasini
Paolo Pasini
Skip connections have emerged as a key component of modern convolutional neural networks (CNNs) for computer vision tasks, allowing for the creation of more accurate and deeper models by addressing the vanishing gradient problem. However, the existing implementations of field-programmable gate array (FPGA)-based accelerators for ResNets and MobileNetV2 often experience decreased performance and increased computational latency due to the implementation of skip blocks. This paper presents a novel framework for developing deep learning models on FPGAs that focuses on skip connections, with a unique approach to reduce buffering overhead. This results in a more efficient utilization of resources in the implementation of the skip layer. The nn2fpga compiler follows a thorough set of high-level synthesis (HLS) design principles and optimization strategies, exploiting in novel ways standard techniques to effectively map skip connection-based networks into static dataflow accelerators. To maximize throughput and efficiently use the available resources, our compiler employs a fast and effective design space exploration method based on a binary integer programming model which accurately assigns FPGA resources to the network layers, to maximize global throughput under resource constraints and then minimize resources for the achieved maximum throughput. Experimental results on the CIFAR-10 and ImageNet datasets demonstrate substantial gains in throughput (3× to 7× on past HLS-based work) for ResNet8, ResNet20, and MobileNetV2 models deployed on various Xilinx FPGA boards. Notably, MobileNetV2 deployed on the ZCU102 achieves a throughput of 2115 FPS, representing even a 10% speedup over a state-of-the-art highly optimized manual RTL implementation, showing that HLS can actually improve over manual design, thanks to the faster exploration of the design space.

1 June 2018 in International Journal on Software Tools for Technology Transfer
Verified
Journal Article
Closed access
PDF file
GCG. Cabodi
G. Cabodi
PCP. E. Camurati
P. E. Camurati
CLC. Loiacono
C. Loiacono
MPM. Palena
M. Palena
Paolo PasiniPaolo Pasini
Paolo Pasini
Stefano QuerStefano Quer
Stefano Quer

1 November 2016
Verified
Conference Paper
Open access
Riccardo CantoroRiccardo Cantoro
Riccardo Cantoro
MPMarco Palena
Marco Palena
Paolo PasiniPaolo Pasini
Paolo Pasini
Matteo Sonza ReordaMatteo Sonza Reorda
Matteo Sonza Reorda
Modern devices often include several embedded instruments, such as BISTs, sensors, and other analog components. New standards, such as IEEE Std. 1687, provide vehicles to access these instruments. In approaches based on reconfigurable scan networks, instruments are coupled with scan registers, connected into chains and interleaved with reconfigurable multiplexers, permitting a selective access to different parts of the chain. A similar scenario is also supported by IEEE Std. 1149.1-2013, where a test data register can be constructed as a chain of multiple segments, some of which can be excluded or mutually selected. The test of permanent faults affecting a reconfigurable scan network requires to shift test patterns throughout a certain number of network configurations. This paper presents a method to select the list of configurations needed to apply the complete test set in the minimum amount of clock cycles. The method is based on a graph representation ofthe problem. Experimental results on some benchmark networks are provided, together with a comparison with other approaches based on heuristics. The provided results can be effectively usedto evaluate the test time of sub-optimal 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.