• Publications
  • Influence
A Theory of Timed Automata
TLDR
The main construction of the paper is an (PSPACE) algorithm for checking the emptiness of the language of a (nondeterministic) timed automaton, and it is proved that the universality problem and the language inclusion problem are solvable only for the deterministic automata. Expand
Symbolic Model Checking: 10^20 States and Beyond
TLDR
It is shown how the novel mu-calculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satisfiability of linear-time temporal logic formulas, strong and weak observational equivalence of finite transition systems, and language containment of finite omega -automata. Expand
Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks
TLDR
Results show that the novel, scalable, and efficient technique presented can successfully prove properties of networks that are an order of magnitude larger than the largest networks verified using existing methods. Expand
Model-Checking in Dense Real-time
TLDR
An algorithm for model-checking, for determining the truth of a TCTL-formula with respect to a timed graph, is developed and it is argued that choosing a dense domain instead of a discrete domain to model time does not significantly blow up the complexity of the model- checking problem. Expand
EXE: Automatically Generating Inputs of Death
TLDR
This article presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code by solving the current path constraints to find concrete values using its own co-designed constraint solver, STP. Expand
Automata For Modeling Real-Time Systems
TLDR
To model the behavior of finite-state asynchronous real-time systems, the notion of timed Buchi automata (TBA) is proposed, coupled with a mechanism to express constant bounds on the timing delays between system events. Expand
Timing Assumptions and Verification of Finite-State Concurrent Systems
  • D. Dill
  • Computer Science
  • Automatic Verification Methods for Finite State…
  • 12 June 1989
TLDR
A scheme that allows timing assumptions to be incorporated into automatic proofs of arbitrary finite-state temporal properties is described, and it is conjecture that the method presented can be extended in this way. Expand
A Decision Procedure for Bit-Vectors and Arrays
TLDR
Experimental results indicate that the above mix of algorithms along with the overall architecture is far more effective, for a variety of applications, than a direct translation of the original formula to SAT or other comparable decision procedures. Expand
Automatic verification of Pipelined Microprocessor Control
TLDR
The method handles more complicated designs, and requires less human intervention, than existing methods, and results from an efficient validity checker for a logic of uninterpreted functions with equality. Expand
Trace theory for automatic hierarchical verification of speed-independent circuits
  • D. Dill
  • Computer Science
  • ACM distinguished dissertations
  • 7 September 1989
TLDR
The problem of receptiveness is proved to be decidable, by reduction to Church's solvability problem, and the resulting verification methodology is naturally hierarchical, because specifications at one level of abstraction can be used as descriptions at higher levels of abstraction. Expand
...
1
2
3
4
5
...