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

Saurabh Prabhakar

dblp:17/4757 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · unresolved

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

Systems, architecture and hardware · 1

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 · 87% Integrated circuit design · 13%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%

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

TopicWeightPapersLastEvidence papers
Program analysis
model inference
0.112008
Construction of concrete verification models from C++ · DAC 2008
Electronic design automation › hardware verification and test
hardware verification
0.112008
Construction of concrete verification models from C++ · DAC 2008
Electronic design automation › hardware verification and test › formal verification
sequential equivalence checking
0.112008
Construction of concrete verification models from C++ · DAC 2008
Integrated circuit design › system-on-chip
system-on-chip design
0.012008
Construction of concrete verification models from C++ · DAC 2008
YearPublicationVenuePosition
2008 Construction of concrete verification models from C++
abstract
C++ based verification methodologies are now emerging as the preferred method for SOC design. However most of the verification involving the C++ models are simulation based. The challenge of using C++ for sequential equivalence checking comes from two aspects (1) Language constructs such as pointers, polymorphism, virtual methods, dynamic memory allocation, dynamic loop bounds, floating points pose difficulty in creating a model suitable for equivalence checking (2) The memory and runtime required for creating models suitable for equivalence checking from practical C++ designs is huge.
Malay Haldar, Saurabh Prabhakar, Basant Dwivedi, Antara Ghosh
DAC3