Pascal Raymond

Pascal Raymond

Auto-generated profile, based on publicly available information

Pascal Raymond

Univ. Grenoble Alpes, CNRS, Grenoble INP, Verimag

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

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

Representative Publications

View All Publications
12 October 2009
Verified
Conference Paper
Open access
PDF file
MPMarc Pouzet
Marc Pouzet
PRPascal Raymond
Pascal Raymond

1 January 1996
Verified
Book Chapter
Open access
PDF file
PRPascal Raymond
Pascal Raymond
This paper addresses the problem of building a Boolean dataflow network (sequential circuit) recognizing the language described by a regular expression. The main result is that both the construction time and the size of the resulting network are linear with respect to the size of the regular expression.

10 September 2025 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
OOOussama Oulkaid
Oussama Oulkaid
BFBruno Ferres
Bruno Ferres
MMMatthieu Moy
Matthieu Moy
PRPascal Raymond
Pascal Raymond
MGMehdi Khosravian Ghadikolaei
Mehdi Khosravian Ghadikolaei
The behavior of any electronic system can be traced back to how its constituting components physically interact with each other. Such low-level interactions explain how specific states of a given circuit are physically possible. Some circuit states can be erroneous, e.g., applying a voltage stress greater than what some device can tolerate. It is of particular importance to know whether such errors can happen on a given circuit, so that required corrections can be made. Identifying errors requires some circuit modeling technique and a way to explore the state space of the circuit model (which may be very large if at all finite). In this work, we show the limitations of classical verification techniques and propose a new approach based on formal methods to overcome them. We propose new circuit semantics for transistor-level descriptions from 1) recalling and improving existing semantics and 2) introducing novel alternate ones. We then demonstrate their usage in our verification framework—which makes use of a satisfiability modulo theories (SMT) solver—to verify specific electric properties of circuits. Specifically, we address the problem of the search for circuit transistors that are subject to electrical overstress (EOS). We draw interesting conclusions by comparing the presented circuit semantics, both formally and via experimental benchmarks.

20 September 2025 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
BFBruno Ferres
Bruno Ferres
OOOussama Oulkaid
Oussama Oulkaid
MMMatthieu Moy
Matthieu Moy
GRGabriel Radanne
Gabriel Radanne
LHLudovic Henrio
Ludovic Henrio
MKMehdi Khosravian
Mehdi Khosravian
Hardware verification is crucial to ensure the quality of Integrated Circuits, and prevent costly bugs down the manufacturing flow. Electrical Rule Checking (ERC) is a verification step used to assert that a circuit complies with some electrical rules, from the absence of short-circuits to dedicated constructor rules. In this survey, we provide a global overview of existing ERC techniques at transistor-level, where voltage values are explicit. We propose a new classification method to compare the existing approaches based on their semantic modeling of circuits. This survey precisely describes transistor-level ERC research challenges and existing solutions. We believe it will help structure this research domain by positioning existing approaches with respect to each other. Obviously, a survey should also facilitate technological transfer and this one should help CAD vendors identify the most relevant approaches to integrate in their tools. Finally, we highlight several promising directions to improve the existing solutions.