EDBT 2026 Demo / reviewers in the wild / expert
Prashant S. Parikh
dblp:40/5176
· DBLP profile ↗
6ranked-venue papers
3as first author
0since 2021 · last 1995
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 5 · 3 first-authorComputer networks · 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 · 100% | |
| Computer networks
1 paper |
Internet architecture and protocols · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols › protocol specification
formal specification |
0.0 | 1 | 1993 | From formal specification to implementation: experience with protocol tools · ICNP 1993 |
Internet architecture and protocols
protocol implementation |
0.0 | 1 | 1993 | From formal specification to implementation: experience with protocol tools · ICNP 1993 |
Electronic design automation › hardware verification and test
design for testability |
0.0 | 1 | 1993 | A Cost-Based Approach to Partial Scan · DAC 1993 |
Electronic design automation
hardware verification and test |
0.0 | 1 | 1993 | A Cost-Based Approach to Partial Scan · DAC 1993 |
Electronic design automation › hardware verification and test › design for testability › scan design
partial scan |
0.0 | 1 | 1993 | A Cost-Based Approach to Partial Scan · DAC 1993 |
Electronic design automation › hardware verification and test
testability analysis |
0.0 | 1 | 1993 | A Cost-Based Approach to Partial Scan · DAC 1993 |
Methods — techniques the papers use, named apart from their topics
sensitivity analysis · 0.0extended finite state machine · 0.0augmented protocol specification language · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | On Combining Design for Testability TechniquesabstractIn this paper, we present a testability-based method to combine three different DFT techniques: partial reset, partial observation, and partial scan. This approach combines the complementary strengths of the DFT techniques taking advantage of their different cost/benefit trade-offs, and results in more testable circuits with reduced design penalty. Prashant S. Parikh, Miron Abramovici |
ITC | 1 |
| 1995 | Testability-based partial scan analysis
Prashant S. Parikh, Miron Abramovici |
J. Electron. Test. | 1 |
| 1993 | A Cost-Based Approach to Partial ScanabstractIn this paper, we present a new method for selecting flip-flops for partial scan. Our method ranks all flip-flops based on a sensitivity analysis that determines the improvement in the testability of the circuit as a result of scanning a flip-flop. Testability is computed with respect to a given set of target faults. Our method can estimate the number of scan flip-flops needed to reach a good fault coverage. Prashant S. Parikh, Miron Abramovici |
DAC | 1 |
| 1993 | From formal specification to implementation: experience with protocol toolsabstractThe authors describe efforts to develop the Q.931 protocol software for the 5ESS Central Office Switch. Q.931 is a layer-3 message-based, user/network interface protocol for the integrated services digital network (ISDN). The approach uses a single formal specification written in the Augmented Protocol Specification Language to model the 1.931 protocol as a set of communicating extended finite state machines. From this specification, tools validate the protocol and generate the bulk of a C language implementation. The authors successfully integrated this code, along with other handwritten code, into a working system in the lab. Their results demonstrate that protocol tools can be used effectively to develop high quality protocol software quickly from formal specifications.> Thomas J. Baumgartner, David M. Kristol, J. D. Milleville, Prashant S. Parikh |
ICNP | 4 |
| 1993 | On Selecting Flip-Flops for Partial ResetabstractPartial reset is an inexpensive design for test technique in which an additional primary input is connected to the reset or the set inputs of a subset of flip-flops (FFs). In this paper, we present a new method to select the FFs to be initialized and their initial values. The FFs are selected based on their contribution to the testability of the circuit. A sensitivity analysis is done to determine the ranking of FFs. The results obtained by the new method show that our selection of FFs gives consistently better fault coverage than the previously used one.> Miron Abramovici, Prashant S. Parikh, Ben Mathew, Daniel G. Saab |
ITC | 2 |
| 1992 | Warning: 100% Fault Coverage May Be Misleading!!abstractIn this gaper we show that even when a sequential test generator does a perfect job and achieves 100% detectable fault coverage, a circuit passing the test may still exhibit severe testability problems caused by undetectable faults that prevent initialization (FPIs). Thus 100% fault coverage may be a misleading quality indicator, unless undetectable FPIs are accounted for. We present the first algorithm able to identify undetectable FPIs and we report the results obtained for the sequential benchmark circuits. We also discuss the design for testability techniques that make these faults detectable. Miron Abramovici, Prashant S. Parikh |
ITC | 2 |