Jim Grundy

A reflective functional language for hardware design and theorem proving

This paper introduces reFLect, a functional programming language with reflection features intended for applications in hardware design and verification. The reFLect language is strongly typed and similar to ML, but has quotation and antiquotation constructs. These may be used to construct and decompose expressions in the reFLect language itself. The paper motivates and presents the syntax and type system of this language, which brings together a new combination of pattern-matching and reflection features targeted specifically at our application domain. It also gives an operational semantics based on a novel use of contexts as expression constructors, and it presents a scheme for compiling reFLect programs using the same context mechanism.

Ground Interpolation for the Theory of Equality

Given a theory

Synthesizable high level hardware descriptions: using statically typed two-level languages to guarantee verilog synthesizability

\mathcal{T}

Static consistency checking for verilog wire interconnects: using dependent types to check the sanity of verilog descriptions

and two formulas A and B jointly unsatisfiable in

Tool Building Requirements for an API to First-Order Solvers

\mathcal{T}

An Efficient 2-Phase Strategy to Achieve High Branch Coverage

, a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by A and B , (ii) it is entailed by A in

Static consistency checking for Verilog wire interconnects

\mathcal{T}

Synthesizable high level hardware descriptions

, and (iii) it is unsatisfiable with B in

Firmware validation: challenges and opportunities

\mathcal{T}

Ground interpolation for the theory of equality

. Theory interpolants are used in model checking to accelerate the computation of reachability relations. We present a novel method for computing ground interpolants for ground formulas in the theory of equality. Our algorithm computes interpolants from colored congruence graphs representing derivations in the theory of equality. These graphs can be produced by conventional congruence closure algorithms in a straightforward manner. By working with graphs, rather than at the level of individual proof steps, we are able to derive interpolants that are pleasingly simple (conjunctions of Horn clauses) and smaller than those generated by other tools.