Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Philippe Georgelin

dblp:90/3351 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2006
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test
hardware verification
0.112006
Towards a C++-based design methodology facilitating sequential equivalence checking · DAC 2006
Electronic design automation › hardware verification and test › formal verification
sequential equivalence checking
0.112006
Towards a C++-based design methodology facilitating sequential equivalence checking · DAC 2006
Electronic design automation
high-level synthesis
0.012006
Towards a C++-based design methodology facilitating sequential equivalence checking · DAC 2006

Methods — techniques the papers use, named apart from their topics

formal verification · 0.1RTL verification · 0.1
YearPublicationVenuePosition
2006 Towards a C++-based design methodology facilitating sequential equivalence checking
abstract
It has long been the practice to create models in C or C++ for architectural studies, software prototyping and RTL verification in the design of Systems-on-Chip (SoC). These models are written in C++ primarily because it is possible to achieve very high simulation speeds, but also because it is productive to code at high levels of abstraction. In this paper we present a modeling methodology that continues to exploit the inherent advantages of writing models in C++ while ensuring that they are usable for formal verification of RTL through the use of sequential equivalence checking technology. An industrial case study is presented to show the validity of the approach.
Philippe Georgelin, Venkat Krishnaswamy
DAC1