Citation Context

...system [20], used extensively for hardware verication. Voss uses a lazy functional language called FL as its interface language. In FL, booleans are implemented using Binary Decision Diagrams (BDDs) [=-=-=-4]. In eect, a decision procedure for propositional logic is built into the language, allowing the user to combine simulation and verication in powerful ways. In this paper, we introduce two newsavors...

Citation Context

...an by designing and implementing (and maintaining!) a new language. For the secondsavor of booleans, we extend the logic to quantier-free predicate logic by using the Stanford Validity Checker (SVC) [=-=2-=-]. The implementations of eachsavor are complex and have a strong imperative feel to them, but for both we have dened referentially transparent interfaces, allowing the underlying tools to do their wo...

Citation Context

...uld be particularly important for defect-nding verication eorts. 8 Related Work This work extends the brief description of linking BDDs with Haskell found in Launchbury, Lewis, and Cook [14]. Lava [3] is a Haskell-based hardware description language. They provide multiple interpretations of circuit descriptions for simulation, verication, and code generation. For verication, Lava interfaces to t...

Citation Context

...ing the integer and boolean cases. 5 The Stanford Validity Checker The Stanford Validity Checker (SVC) is an implementation of a decision procedure for a quantier-free,srst-order logic with equality [=-=2, 7, 11-=-]. It has been used extensively for microprocessor validation and verication [7, 11, 12, 22] and recently for requirements validation [18]. The logic allows models to include uninterpreted functions, ...

Citation Context

...ample 2: Microprocessor Verication As a second example of the use of SVC in Haskell, we present the verication of a simple pipelined ALU used in Burch and Dill [7] (originally found in Burch et al. [6]). In their presentation, they use a simple hardware description language based on Lisp as input to their verication process. This section describes how this example can be veried in Haskell using S...