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

Kyle L. Nelson

dblp:48/3033 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1Theory of computation · 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 · 86% Memory systems · 10% Processor architecture and microarchitecture · 3%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test
formal verification
0.022000
A methodology for formal design of hardware control with application to cache coherence protocols · DAC 2000
Formal Verification of a Superscalar Execution Unit · DAC 1997
Electronic design automation
hardware verification and test
0.012000
A methodology for formal design of hardware control with application to cache coherence protocols · DAC 2000
Electronic design automation
high-level synthesis
0.012000
A methodology for formal design of hardware control with application to cache coherence protocols · DAC 2000
Electronic design automation › hardware verification and test
hardware verification
0.011997
Formal Verification of a Superscalar Execution Unit · DAC 1997
Electronic design automation › hardware verification and test › formal verification
symbolic trajectory evaluation
0.011997
Formal Verification of a Superscalar Execution Unit · DAC 1997
Memory systems
cache coherence
0.012000
A methodology for formal design of hardware control with application to cache coherence protocols · DAC 2000
Memory systems › cache coherence
cache coherence protocol
0.012000
A methodology for formal design of hardware control with application to cache coherence protocols · DAC 2000

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

symbolic trajectory evaluation · 0.0
YearPublicationVenuePosition
2000 A methodology for formal design of hardware control with application to cache coherence protocols
abstract
We propose a methodology for developing hardware control. In addition to the usual distinction between control and data path, a further distinction within the control code is made between algorithmic code and bookkeeping code. The high level specification describes the algorithmic code in an object-oriented st yle, is executable, formally verified, and automatically translated into HDL, thus giving hardware which is by construction equivalen t to its specification. We discuss the application of this methodology as it is used in product development of cache coherence protocols.
Cindy Eisner, Irit Shitsevalov, Russ Hoover, Wayne G. Nation, Kyle L. Nelson, Ken Valk
DAC5
1997 Formal Verification of a Superscalar Execution Unit
abstract
. Many modern systems are designed as a set of interconnected reactive subsystems. The subsystem verification task is to verify an implementation of the subsystem against the simple deterministic high-level specification of the entire system. Our verification methodology, based on Symbolic Trajectory Evaluation, is able to bridge the wide gap between the abstract specification and the implementation specific details of the subsystem. This paper presents a detailed description of an industrial application of this methodology to the fixed point execution unit of the PowerPC processor. We were able to verify a representative instruction under all possible stall, bypass, pipeline conditions and under all possible timings for interface to other functional units in the processor. 1. Introduction Some modern systems with a simple deterministic high-level specification have implementations that exhibit highly nondeterministic behaviors. A large class of systems that exhibit such...
Kyle L. Nelson, Alok Jain, Randal E. Bryant
DAC1
1996 Verifying Nondeterministic Implementations of Deterministic Systems
Alok Jain, Kyle L. Nelson, Randal E. Bryant
FMCAD2