Demo Data from EDBT 2026 / reviewers in the wild / expert
Hillel Miller
dblp:51/6734
· DBLP profile ↗
4ranked-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 · 2Theory of computation · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author
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.
| Theoretical computer science
1 paper |
Automata and formal languages · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages
finite automata |
0.0 | 1 | 1996 | Saving Space by Fully Exploiting Invisible Transitions · CAV 1996 |
Automata and formal languages › automata algorithms
state minimization |
0.0 | 1 | 1996 | Saving Space by Fully Exploiting Invisible Transitions · CAV 1996 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | Automatic Vector Generation Using Constraints and Biasing
Jun Yuan 0007, Kurt Shultz, Carl Pixley, Hillel Miller, Adnan Aziz |
J. Electron. Test. | 4 |
| 1999 | Modeling design constraints and biasing in simulation using BDDsabstractConstraining and input biasing are frequently used techniques in functional verification methodologies based on randomized simulation generation. Constraints confine the simulation to a legal input space, while input biasing, which can be considered as a probabilistic constraint, makes it easier to cover interesting "corner" cases. In this paper, we propose to use constraints and biasing to form a simulation environment instead of using an explicit testbench in hierarchical functional verification. Both constraints and input biasing can depend on the state of the design and thus are very expressive in modeling the environment. We present a novel method that unifies the handling of constraints and biasing via the use of Binary Decision Diagrams (BDDs). The distribution of input vectors under the effect of constraints and input biasing are determined by what we refer to as the constrained probabilities. A BDD representing the constraints is first built, then an algorithm is applied to bias the branching probabilities in the BDD. During simulation, this annotated BDD is used to generate input vectors whose distribution matches their predetermined constrained probabilities. The simulation generation is a one-pass process, i.e., no backtracking or retry is needed. Also, we describe a partitioning method to minimize the size of BDDs used in simulation generation. Our techniques were used in the verification of a set of commercial designs; experimental results demonstrated their effectiveness. Jun Yuan 0007, Kurt Shultz, Carl Pixley, Hillel Miller, Adnan Aziz |
ICCAD | 4 |
| 1999 | Saving Space by Fully Exploiting Invisible Transitions
Shmuel Katz, Hillel Miller |
Formal Methods Syst. Des. | 2 |
| 1996 | Saving Space by Fully Exploiting Invisible Transitions
Hillel Miller, Shmuel Katz |
CAV | 1 |