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

Chunduri Rama Mohan

dblp:38/3934 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · none

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

Systems, architecture and hardware · 6 · 2 first-authorSoftware engineering, systems software and programming languages · 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
2 papers
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
hardware verification and test
0.122006
Design-Intent Coverage - A New Paradigm for Formal Property Verification · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2006
EARTH: combined state assignment of PLA-based FSM's targeting area and testability · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Electronic design automation › hardware verification and test
formal verification
0.112006
Design-Intent Coverage - A New Paradigm for Formal Property Verification · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2006
Electronic design automation › hardware verification and test
fault modeling
0.011996
EARTH: combined state assignment of PLA-based FSM's targeting area and testability · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Electronic design automation
logic synthesis
0.011996
EARTH: combined state assignment of PLA-based FSM's targeting area and testability · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Electronic design automation › logic synthesis
state assignment
0.011996
EARTH: combined state assignment of PLA-based FSM's targeting area and testability · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996

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

formal verification · 0.1RTL property checking · 0.1state assignment algorithm · 0.0
YearPublicationVenuePosition
2020 Assertions for Protecting Mixed-Signal Latency Contracts in Power Management
abstract
Mixed-signal components, such as low dropouts (LDOs) and phase locked loops (PLLs), are widely used inside the on-chip power management fabric of low power integrated system-on-chip (SoC) designs. The digital brain of the power management logic that is responsible for regulating the power delivery to different power domains in the chip has to consider the real time latencies of the analog components, which otherwise leads to functional errors in the domains being driven. The latencies may be viewed as contracts between the digital and the analog. This article presents an approach for generating assertions for protecting such mixed-signal latency contracts and using them to rule out timing bugs in the power management logic. Our tool flow enables the verification of the power management fabric, combining a novel mixed-signal assertion checking method in a simulation setting, and a full formal verification method for the digital brain of the power management logic. To the best of our knowledge, this is the first framework where assertions are used for binding analog latency contracts on the digital logic of power management.
Sudipa Mandal, Pallab Dasgupta, Aritra Hazra, Chunduri Rama Mohan
IEEE Trans. Very Large Scale Integr. Syst.4
2006 Design-Intent Coverage - A New Paradigm for Formal Property Verification
abstract
It is essential to formally ascertain whether the register-transfer level (RTL) validation effort effectively guarantees the correctness with respect to the design's architectural intent. The design's architectural intent can be expressed in formal properties. However, due to the capacity limitations of formal verification, these architectural properties cannot be directly verified on the RTL. As a result, a set of lower level RTL properties are developed and verified against the RTL modules. In a top-down design approach, the architect would ideally like to formally guarantee the coverage of the architectural intent at the time of creating the specifications for the component RTL modules (that is, before they are passed to the designers for implementation). In this paper, the authors present: 1) a method for checking whether the RTL properties are covering the architectural properties, that is, whether verifying the RTL properties guarantees the correctness of the design's architectural intent; 2) a method to identify which architectural properties are still uncovered, that is, not guaranteed by the RTL properties; and 3) a methodology for representing the gap between the specifications in a legible form
Prasenjit Basu, Sayantan Das 0001, Ansuman Banerjee, Pallab Dasgupta, P. P. Chakrabarti 0001, Chunduri Rama Mohan, Limor Fix, Roy Armoni
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.6
2004 Formal Verification Coverage: Are the RTL-Properties Covering the Design's Architectural Intent?
abstract
It is essential to formally ascertain whether the RTL validation effort effectively guarantees the correctness with respect to the design's architectural intent. The design's architectural intent can be expressed in formal properties. However, due to the capacity limitation of formal verification, these architectural-properties cannot be directly verified on the RTL. As a result, a set of lower level RTL-properties are developed and verified against the RTL. In this paper we present: (1) a method for checking whether the RTL-properties are covering the architectural-properties, that is, whether verifying the RTL-properties guarantee the correctness of the design's architectural intent; and (2) a method to identify the coverage holes in terms of the architectural properties (or their sub-properties) that are not covered.
Prasenjit Basu, Sayantan Das 0001, Pallab Dasgupta, P. P. Chakrabarti 0001, Chunduri Rama Mohan, Limor Fix
DATE5
2004 Formal verification coverage: computing the coverage gap between temporal specifications
abstract
Existing methods for formal verification coverage compare a given specification with a given implementation, and evaluate the coverage gap in terms of quantitative metrics. We consider a new problem, namely to compare two formal temporal specifications and to find a set of additional temporal properties that close the coverage gap between the two specifications. In this paper we present: (1) the problem definition and motivation, (2) a methodology for computing the coverage gap between specifications, and (3) a methodology for representing the coverage gap as a collection of temporal properties that preserve the syntactic structure of the target specification.
Sayantan Das 0001, Prasenjit Basu, Ansuman Banerjee, Pallab Dasgupta, P. P. Chakrabarti 0001, Chunduri Rama Mohan, Limor Fix, Roy Armoni
ICCAD6
1996 EARTH: combined state assignment of PLA-based FSM's targeting area and testability
abstract
Stuck-at and crosspoint faults in PLA's introduce combinational and sequential redundancies in PLA-based FSM's that affect the testability of these FSM's. We propose a new state assignment algorithm for PLA-based FSM's called EARTH that simultaneously considers area minimization and testability of the resultant PLA's. Our fault model is the single stuck-at and/or single crosspoint fault model. Experimental results show that, on an average, the number of undetectable faults which result due to state assignment by EARTH is about five times less than those generated due to state assignment by NOVA with area overhead 2% more than NOVA.
Chunduri Rama Mohan, P. P. Chakrabarti 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1994 A new approach for factorizing FSM's
Chunduri Rama Mohan, P. P. Chakrabarti 0001
ICCAD1