University of Cambridge

Automated
Reasoning
Group

Combining Deductive Theorem Proving with Symbolic State Enumeration

By Mike Gordon (Thursday 22nd October 1998 in TP4)

The talk will be about automated methods suitable for specifying and verifying state based systems (hardware or software). I'll describe some synergies resulting from combining deductive theorem proving with symbolic state space enumeration. The combination is achieved by linking higher order logic terms to binary decision diagrams (BDDs).

Several examples will be presented, including an autopilot (previously analysed by deduction in PVS and ACL2) and an asynchronous arbiter circuit (previously analysed algorithmically with Voss). These examples have been done in a soon-to-be-released version of the Hol98 system.

LS Home page or Talks in 1998/99 or ARG Home page