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

Vinit Ogale

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

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 · 30% Embedded and real-time systems · 30% Distributed systems · 30%

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

TopicWeightPapersLastEvidence papers
Distributed systems › concurrency control
deadlock detection
0.112008
Predictive runtime verification of multi-processor SoCs in SystemC · DAC 2008
Electronic design automation
hardware verification and test
0.112008
Predictive runtime verification of multi-processor SoCs in SystemC · DAC 2008
Embedded and real-time systems › runtime monitoring
runtime verification
0.112008
Predictive runtime verification of multi-processor SoCs in SystemC · DAC 2008
Processor architecture and microarchitecture
chip multiprocessor
0.012008
Predictive runtime verification of multi-processor SoCs in SystemC · DAC 2008

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

predictive runtime verification · 0.1
YearPublicationVenuePosition
2008 Predictive runtime verification of multi-processor SoCs in SystemC
abstract
Concurrent interaction of multi-processor systems result in errors which are difficult to find. Traditional simulation-based verification techniques remove the concurrency information by arbitrary schedulings. We present a novel simulation-based technique for SystemC that preserves and exploits concurrency information. Our approach is unique in that we can detect potential errors in an observed execution, even if the error does not actually occur in that execution. We identify synchronization constructs in SystemC and develop predictive techniques for temporal assertion verification and deadlock detection. Our automated potential deadlock detection algorithm works on SystemC programs with semaphores, locks, wait and notify synchronizations and has less overhead compared with assertion verification. We patched SystemC kernel to implement our solution and obtained favorable results on industrial designs.
Alper Sen 0001, Vinit Ogale, Magdy S. Abadir
DAC2