EDBT 2026 Demo / reviewers in the wild / expert
Adam Bauserman
dblp:18/3690
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2
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% Distributed systems · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › hardware verification and test › hardware verification
assertion-based verification |
0.1 | 1 | 2009 | Inferno: Streamlining Verification With Inferred Semantics · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2009 |
Electronic design automation › hardware verification and test › functional verification
constrained random verification |
0.1 | 1 | 2009 | Inferno: Streamlining Verification With Inferred Semantics · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2009 |
Electronic design automation
hardware verification and test |
0.1 | 1 | 2009 | Inferno: Streamlining Verification With Inferred Semantics · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2009 |
Distributed systems › distributed system verification
protocol verification |
0.0 | 1 | 2009 | Inferno: Streamlining Verification With Inferred Semantics · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2009 |
Methods — techniques the papers use, named apart from their topics
transaction inference · 0.1semantic extraction from simulation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Inferno: Streamlining Verification With Inferred SemanticsabstractUnderstanding designers' intentions and accurately verifying a design are major obstacles for verification engineers today. Currently available debugging tools, such as waveform viewers, are unwieldy, often requiring the user to search through millions of cycles of logic simulation data to locate a problem. In this paper, we present Inferno, a novel solution capable of automatically extracting semantic information from a design's interface from simulation information. The semantic structure of an interface's communication protocol is presented to the user as a set of transactions, that is, monolithic communication units that have typically been observed several times during the logic simulation. Transactions can graphically be presented to the user and used as an aid to understand and validate the communication protocol of a design's interface. In addition, approved transactions can also be encoded as assertions expressed in a hardware description language (HDL) and used in constrained-random simulation to certify that the interface protocol adheres to the set of observed (and user-approved) transactions. Moreover, we developed a new closed-loop verification methodology based on Inferno, called transactional verification, which leverages approved transactions to describe correct design behavior. In our methodology, transactions are concurrently extracted during a constraint-based random simulation: the anomalous ones are flagged as potentially buggy and presented to the user for inspection. In the experimental results, we evaluate the performance and the quality of the results of Inferno on a broad range of testbench designs and several of their interfaces, including a number of communication intellectual properties and the OpenSPARC T1 8-core processor from Sun. Andrew DeOrio, Adam Bauserman, Valeria Bertacco, Beth Isaksen |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 2 |
| 2008 | Post-silicon verification for cache coherenceabstractModern processor designs are extremely complex and difficult to validate during development, causing a growing portion of the verification effort to shift to post-silicon, after the first few hardware prototypes become available. Extremely slow simulation speeds during pre-silicon verification result in functional errors escaping into silicon, a problem that is further exacerbated by the growing complexity of the memory subsystem in multi-core platforms. In this work we present CoSMa, a novel technology offering high coverage functional post-silicon validation of cache coherence protocols in multi-core systems. It enables the detection and diagnosis of functional errors in the memory subsystem by recording at runtime a compact encoding of the operations occurring at each cache line and checking their correctness at regular intervals. We leverage the systempsilas existing memory resources to store the required activity, thus minimizing area overhead. When the system is finally ready for customer shipment, CoSMa can be completely disabled, eliminating any performance or memory overhead. We reproduce in our experiments a set of coherence protocol bugs based on published errata documents of commercial multi-core designs, and show that CoSMa is highly effective in detecting them. Andrew DeOrio, Adam Bauserman, Valeria Bertacco |
ICCD | 2 |