• Publications
  • Influence
SPUDD: Stochastic Planning using Decision Diagrams
This work proposes and examines a new value iteration algorithm for MDPs that uses algebraic decision diagrams (ADDs) to represent value functions and policies, assuming an ADD input representation of the MDP. Expand
Protocol verification as a hardware design aid
A novel protocol description language and verifier are described, along with experiences in applying them to two industrial protocols that were developed as part of hardware designs. Expand
System-on-Chip: Reuse and Integration
This paper focuses on the reuse and integration issues encountered in this paradigm shift in system-on-chip (SoC) design, which includes connecting the computational units to the communication medium, which is moving from ad hoc bus-based approaches toward structured network- on- chip (NoC) architectures. Expand
Calysto: scalable and precise extended static checking
The Calysto static checker achieves an unprecedented combination of precision and scalability in a completely automatic extendedstatic checker, which scales comparably to the leading, less precise, static-analysis-based tool for similar properties. Expand
BDDNOW: A Parallel BDD Package
This paper presents a parallel BDD package with several novel features - providing a subset of the CUDD API for the application programmer, and running on the widely available PVM package. Expand
Improving multiple-CMP systems using token coherence
This paper exploits the separation of correctness substrate and performance policy in the recently-proposed token coherence protocol to develop the first M-CMP coherence Protocol that is flat for correctness, but hierarchical for performance. Expand
Structural Abstraction of Software Verification Conditions
A novel approach to solving verification conditions, based on an automatic abstraction-checking-refinement framework that exploits natural abstraction boundaries present in software, is presented. Expand
Boosting Verification by Automatic Tuning of Decision Procedures
This paper study how an AI approach can improve a state-of-the-art SAT solver for large, real-world bounded model-checking and software verification instances, and finds that the availability of automatic tuning influenced the design of the solver, and the automatically-derived parameter settings provided a deeper insight into the properties of problem instances. Expand
BackSpace: Formal Analysis for Post-Silicon Debug
This work introduces a new paradigm for using formal analysis, augmented with some on-chip hardware support, to automatically compute error traces that lead to an observed buggy state, thereby greatly simplifying the post-silicon debug problem. Expand
Fixing Races for Fun and Profit: How to Use access(2)
  • Drew Dean, A. Hu
  • Computer Science
  • USENIX Security Symposium
  • 13 August 2004
It is proved the "folk theorem" that no portable, deterministic solution exists without changes to the system call interface, a probabilistic solution is presented, and the effect of increasing CPU speeds on the exploitability of the attack is examined. Expand