11 citations · 19 across the 4 of their papers we have counts for
6 papers
ReFuzz: Reusing Tests for Processor Fuzzing with Contextual Bandits
Chen Chen, Zaiyan Xu, Mohamadreza Rostami +4
Processor designs rely on iterative modifications and reuse well-established designs. However, this reuse of prior designs also leads to similar vulnerabilities across multiple pro…
Pebbling Arguments for Tree Evaluation
David Liu
The Tree Evaluation Problem was introduced by Cook et al. in 2010 as a candidate for separating P from L and NL. The most general space lower bounds known for the Tree Evaluation P…
Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star
Janusz Brzozowski, David Liu
We study the state complexity of boolean operations and product (concatenation, catenation) combined with star. We derive tight upper bounds for the symmetric differences and diffe…
Universal Witnesses for State Complexity of Basic Operations Combined with Reversal
Janusz Brzozowski, David Liu
We study the state complexity of boolean operations, concatenation and star with one or two of the argument languages reversed. We derive tight upper bounds for the symmetric diffe…
Syntactic Complexity of Finite/Cofinite, Definite, and Reverse Definite Languages
Janusz Brzozowski, David Liu
We study the syntactic complexity of finite/cofinite, definite and reverse definite languages. The syntactic complexity of a class of languages is defined as the maximal size of sy…
Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
Per Austrin, Toniann Pitassi, Yu Wu
We study the approximability of a number of graph problems: treewidth and pathwidth of graphs, one-shot black (and black-white) pebbling costs of directed acyclic graphs, and a var…