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

Aswin Krishna

dblp:158/8098 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2015
—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 · 91% Reconfigurable computing and FPGAs · 9%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › model checking
bounded model checking
0.212015
Formal Verification ATPG Search Engine Emulator (Abstract Only) · FPGA 2015
Electronic design automation
hardware verification and test
0.212015
Formal Verification ATPG Search Engine Emulator (Abstract Only) · FPGA 2015
Electronic design automation › hardware verification and test
test generation
0.212015
Formal Verification ATPG Search Engine Emulator (Abstract Only) · FPGA 2015
Reconfigurable computing and FPGAs
FPGA-based emulation
0.112015
Formal Verification ATPG Search Engine Emulator (Abstract Only) · FPGA 2015

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

state justification · 0.2bounded model checking · 0.2automatic test pattern generation · 0.2
YearPublicationVenuePosition
2015 Formal Verification ATPG Search Engine Emulator (Abstract Only)
abstract
Bounded Model Checking (BMC), as a formal method of verifying VLSI circuits, shows violation of a given circuit property by finding a counter-example to the property along bounded state paths of the circuit. In this paper, we present an emulation framework for Automatic Test Pattern Generation (ATPG)-BMC model capable of checking properties on gate-level design. In our approach, counterpart to a property is mapped into a structural monitor with one output. A target fault is then injected at the monitor output, and a modified ATPG-based state justification algorithm is used to find a test for this fault which corresponds to formally establishing the property. In this paper, emulating the process of ATPG-based BMC on reconfigurable hardware is presented. The ATPG-BMC emulator achieves a speed-up over software based methods, due to the fine-grain massive parallelism inherent to hardware. As circuit sizes approach limits of even ATPG-based method feasibility, further solutions are required. In this presentation, we propose an ATPG-based algorithm for formal verification implementation on reconfigurable hardware (FPGA). This implementation is shown to have a linear relationship between the size of the circuit being verified and FPGA resource utilization. This implies a reasonable bound on the size of the implementation, as opposed to an exponential utilization explosion as circuit size increases.
Gregory Ford, Aswin Krishna, Jacob A. Abraham, Daniel G. Saab
FPGA2