André Rossi

André Rossi

Auto-generated profile, based on publicly available information

André Rossi

Université de Bretagne-Sud

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
1 May 2017 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
MSMaría Soto
María Soto
MSMarc Sevaux
Marc Sevaux
ARAndré Rossi
André Rossi
ARAndreas Reinholz
Andreas Reinholz

1 January 2016 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
CEChristopher Expósito-Izquierdo
Christopher Expósito-Izquierdo
ARAndré Rossi
André Rossi
MSMarc Sevaux
Marc Sevaux

29 March 2016 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Open access
CYCunxi Yu
Cunxi Yu
WBWalter Brown
Walter Brown
DLDuo Liu
Duo Liu
ARAndre Rossi
Andre Rossi
MCMaciej Ciesielski
Maciej Ciesielski
This paper presents an algebraic approach to functional verification of gate-level, integer arithmetic circuits. It is based on extracting a unique bit-level polynomial function computed by the circuit directly from its gate-level implementation. The method can be used to verify the arithmetic function computed by the circuit against its known specification, or to extract an arithmetic function implemented by the circuit. Experiments were performed on arithmetic circuits synthesized and mapped onto standard cells using ABC system. The results demonstrate scalability of the method to large arithmetic circuits, such as multipliers, multiply-accumulate, and other elements of arithmetic datapaths with up to 512-bit operands and over 2 million gates. The results show that our approach wins over the state-of-the-art SAT/satisfiability modulo theory solvers by several orders of magnitude of CPU time. The procedure has linear runtime and memory complexity, measured by the number of logic gates.

7 June 2015
Verified
Conference Paper
Open access
MCMaciej Ciesielski
Maciej Ciesielski
CYCunxi Yu
Cunxi Yu
WBWalter Brown
Walter Brown
DLDuo Liu
Duo Liu
ARAndré Rossi
André Rossi
The paper presents an algebraic approach to functional verification of gate-level, integer arithmetic circuits. It is based on extracting a unique bit-level polynomial function computed by the circuit directly from its gate-level implementation. The method can be used to verify the arithmetic function computed by the circuit against its known specification, or to extract the arithmetic function implemented by the circuit. Experiments were performed on arithmetic circuits synthesized and mapped onto standard cells using ABC system. The results demonstrate scalability of the method to large arithmetic circuits, such as multipliers, multiply-accumulate, and other elements of arithmetic datapaths with up to 512-bit operands and over 2 Million gates. The procedure has linear runtime and memory complexity, measured by the number of logic gates.

1 December 2014 in Computers & Operations Research
Verified
Journal Article
Closed access
FCFabian Castaño
Fabian Castaño
ARAndré Rossi
André Rossi
MSMarc Sevaux
Marc Sevaux
NVNubia Velasco
Nubia Velasco

1 December 2012 in Computers & Operations Research
Verified
Journal Article
Closed access
ARAndré Rossi
André Rossi
ASAlok Singh
Alok Singh
MSMarc Sevaux
Marc Sevaux