Bose, B. DDD: A transformation system for digital design derivation. Tech. Rep. 331, Indiana University, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... verifying that a program runs in bounded space [73] In this scheme a list containing n elements each of type # would have the type List n (#) Sized types have been integrated into a variant of ML designed for programming embedded systems [72] Johnson s Digital Design Derivation (DDD) system [27] uses a scheme like language to describe circuit behaviour. A series of semantics preserving transformations are presented which can be used to refine a behavioural specification into a circuit structure; the transformations are applied manually by an engineer. In some ways this is similar to our ....

BOSE, B. DDD: A transformation system for digital design derivation. Tech. Rep. 331, Indiana University, 1991.

....in refining the formulations. However, in this study, invalid theorems always revealed inadequacies in the specification, rather than mistakes in the design. 5 Derivation of a Single Pulser using DDD DDD (Digital Design Derivation) is a specialized transformation system for digital system design [9, 2]. It operates on two dialects of first order functional expressions concretely represented by Scheme (Lisp) s expressions. These dialects correspond to behavioral and structural forms of hardware description. The goal of transformation is to reduce a higher level algorithmic specification into a ....

....by extending the binary operation ANDx element wise to the streams I and X. Recursion in system letrec expressions corresponds to feedback in the stream network, but there is no feedback in the single pulser example. Streams are not standard Scheme constructs but are added as a syntactic extension [2]. The first step in the derivation constructs an initial structural description. The two components of this description are (a) a selection combination, which represents the control structure of the specification, and (b) an initial sequential system. a) define select (lambda ( s p0) v0 v1 ....

Bhaskar Bose. DDD - A Transformation system for Digital Design Derivation. Technical Report 331, Computer Science Dept. Indiana University, May 1991.

....cannot cause a side e#ect, the evaluation of this expression can be omitted at run time. 17 Benchmark lines Description texer 3,000 A Scheme pretty printer with T E X output similix 7,000 Self application of the Similix [Bondorf 1993] partial evaluator ddd 15,000 A hardware derivation system [Bose 1991] deriving a Scheme machine [Burger 1994] conform 450 A program that manipulates lattices and partial orders dynamic 2,200 A dynamic type inferencer applied to itself earley 650 Earley s algorithm for generating parsers for context free grammars em fun 490 EM clustering algorithm in functional ....

Bose, B. 1991. DDD---A transformation system for Digital Design Derivation. Tech. Rep. 331, Indiana University, Computer Science Department. May.

.... Description compiler 30,000 Chez Scheme recompiling itself texer 3,000 Scheme pretty printer with T E X output softscheme 10,000 Wright s soft typer [23] checking a 2,500 line program similix 7,000 self application of the Similix [2] partial evaluator ddd 15,000 hardware derivation system [3] deriving Scheme machine [6] em fun 490 EM clustering algorithm in functional style em imp 460 EM clustering algorithm in imperative style dynamic 2,200 a dynamic type inferencer applied to itself graphs 500 counts the number of directed graphs with particular properties lattice 200 ....

Bhaskar Bose. DDD---A transformation system for Digital Design Derivation. Technical Report 331, Indiana University, Computer Science Department, May 1991.

.... 6 Independent Testing at Indiana University Bhaskar Bose of Indiana University, working under the supervision of Steven Johnson, studied the FM9001 design with an eye towards attempting to automatically synthesize an FM9001 design from its behavioral specification using the DDD synthesis tool [3, 4]. As a part of the preparation for this synthesis project, William Hunt (Warren s brother) of the VLSI laboratory of the Computer Science Department at Indiana University interfaced a fabricated FM9001 to the Indiana University Logic Engine. This provided a way to test the FM9001 in a manner that ....

Bhaskar Bose. DDD---A Transformation System for Digital Design Derivation. Technical Report 331, Computer Science Department, Indiana University, May, 1991.

....cause a side effect, the evaluation of this expression can be omitted at run time. Delta 16 Benchmark lines Description texer 3,000 A Scheme pretty printer with T E X output similix 7,000 Self application of the Similix [Bondorf 1993] partial evaluator ddd 15,000 A hardware derivation system [Bose 1991] deriving a Scheme machine [Burger 1994] conform 450 A program that manipulates lattices and partial orders dynamic 2,200 A dynamic type inferencer applied to itself earley 650 Earley s algorithm for generating parsers for context free grammars em fun 490 EM clustering algorithm in functional ....

Bose, B. 1991. DDD---A transformation system for Digital Design Derivation. Technical Report 331 (May), Indiana University, Computer Science Department.

....unique feature of behavior tables. A system can be specified at the symbolic level and later transformed into a boolean system by assigning types to entries in the tables. The research reported here grew out of our existing design derivation system, which is based on first order functional algebra [11, 12]. As an example of the use of transformations on behavior tables, we sketch parts of the derivation of a boolean level behavior table implementation of Hunt s FM9001 processor. 2 Behavior Tables Behavior tables are an extension of register transfer tables that can model the control, datapath, ....

....that preserve the implementation relation. Indirection transformations can be used to move parts of the system between control and datapath. The transformations on the datapath have been adapted for use on behavior tables from the algebra on purely functional datapath descriptions reported in [14, 12]. Column Insertion Deletion Renaming : A column denoting a new functional unit can be added to a behavior table with any value for any transition. A column can be deleted if all values in the column are don t cares. A column can be renamed and all references to the column in the rest of the table ....

B. Bose, "DDD - A Transformation system for Digital Design Derivation," Tech. Rep. 331, Department of Computer Science, Indiana University, May 1991.

....later developed and implemented a verified clock synchronization circuit that implements this algorithm [36] Several formal methods were used in their design and implementation. The register transfer level architecture was developed using the Digital Design Derivation (DDD) system from Indiana [37]: this transforms an abstract state machine specification into a concrete architecture by applying a number of correctness preserving transformations. Most of the transformations used were built in to DDD, but some additional ad hoc transformations were required; these were justified using PVS. ....

Bhaskar Bose, "DDD---a transformation system for Digital Design Deriviation", Tech. Rep. 331, Computer Science Department, Indiana University, Bloomington, IN, May 1991.

....cause a side effect, the evaluation of this expression can be omitted at run time. Delta 17 Benchmark lines Description texer 3,000 A Scheme pretty printer with T E X output similix 7,000 Self application of the Similix [Bondorf 1993] partial evaluator ddd 15,000 A hardware derivation system [Bose 1991] deriving a Scheme machine [Burger 1994] conform 450 A program that manipulates lattices and partial orders dynamic 2,200 A dynamic type inferencer applied to itself earley 650 Earley s algorithm for generating parsers for context free grammars em fun 490 EM clustering algorithm in functional ....

Bose, B. 1991. DDD---A transformation system for Digital Design Derivation. Tech. Rep. 331, Indiana University, Computer Science Department. May.

....can be achieved with looser synchronization. Furthermore, these verifications are not robust in the face of changes. That is, a small change in the design may invalidate much of the correctness proof. A different approach is formal derivation of hardware. The Digital Design Derivation system (DDD) [2] implements a collection of behavior preserving transformations that allow a designer to realize a design that is correct by construction . There have been a number of significant designs realized using DDD. In particular, Bose has formally derived the DDDFM9001 [3] processor from Hunt s formal ....

....employing the fault tolerant midpoint convergence function. 3 Overview of Verification Procedure This verification effort involves the use of three distinct classes of verification tools: mechanical theorem proving systems (Ehdm [17] PVS [14] a formal Digital Design Derivation system (DDD [2]) and automatic tautology checking using Ordered Binary Decision Diagrams (OBDDs [5] Figure 1 gives an overview of the various formal verifications performed. The top two levels in the figure represent Miner s mechanical verification of Schneider s paradigm [12] This is a fully mechanized ....

[Article contains additional citation context not shown here]

Bhaskar Bose. DDD - A Transformation system for Digital Design Derivation. Technical Report 331, Computer Science Dept. Indiana University, May 1991.

....in a 0CFA analysis. The information lost when the analysis is forced to generalize is not severe. There are two ways in which the loss is contained. First, only the information about Benchmark lines Description Compiler 30,000 Chez Scheme recompiling itself DDD 15,000 hardware derivation system [3] deriving Scheme machine [6] Similix 7,000 self application of the Similix [2] partial evaluator SoftScheme 10,000 Wright s soft typer [23] checking a 2,500 line program Texer 3,000 Scheme pretty printer with T E X output Table 1: Benchmarks unstable portions of the code is generalized beyond the ....

Bhaskar Bose. DDD---A transformation system for Digital Design Derivation. Technical Report 331, Indiana University, Computer Science Department, May 1991.

....to the translation table. 4 Performance To assess both compile time and run time performance of the dynamic recompiler and profiler, we used a set of benchmarks comprised of Chez Scheme 5.0g recompiling itself, Soft Scheme [29] checking its pattern matcher, Digital Design Derivation System 1. 0 [4] deriving a Scheme CPU [6] Similix 5.0 partially evaluating itself [3] and the Gambit C 2.3.1 benchmark suite. All measurements were taken on a DEC Alpha 3000 600 running Digital UNIX V4.0A and are reported in detail elsewhere [7] Initial instrumentation has an average run time overhead of 50 ....

Bhaskar Bose. DDD---A transformation system for Digital Design Derivation. Technical Report 331, Indiana University, Computer Science Department, May 1991.

....map over problems. The environment we have developed is based on the programming language Scheme [1] a Lisp dialect which serves as the framework implementation language, as a formal modeling language for system specification, and with certain restrictions as a hardware description language [2, 3]. We exploit some advanced features of Scheme most notably its support of functional values with appropriate scoping rules in the techniques we describe below. These techniques are standard in functional programming methodology, but this is the first time they have been applied directly to ....

....of the system when three of the processors along with the primitive memory are grouped as the heap object. Both the CPU and the heap may be implemented in either hardware or software. Initially, the entire system is modeled at a behavioral level in software. Using tools that we have developed [3], the executable subsystem descriptions are individually transformed into hardware. Figure 3 shows a prototype in which the heap system and the CPU have been realized in this way. The prototype environment, shown in Figure 3, consists of an uncommitted wire wrap area, banks of lights and CPU ....

[Article contains additional citation context not shown here]

B. Bose, "DDD - A Transformation system for Digital Design Derivation," Tech. Rep. 331, Indiana University, Computer Science Department, May 1991.

....very specialized, Scheme specific instructions. The Scheme Machine implements a slight variation of this virtual machine. This project started in the spring of 1993 with some informal meetings held by Steve Johnson. Peter Weingartner and I learned about the Digital Design Derivation (DDD) system [1] and began to transform the software CPU I designed in the C511 course into a form acceptable to DDD. In the summer of 1993 I worked on the Scheme Machine for C890 credit under Steve Johnson. Kamlesh Rath, Esen Tuna, and Willie Hunt helped me learn more about the DDD system and how to design ....

Bhaskar Bose. DDD---A transformation system for Digital Design Derivation. Technical Report 331, Indiana University, Computer Science Department, May 1991.

....in terms of caller save registers and the simplified language of expressions based on Scheme [8] below. In Section 2.4 we explain how our strategy applies to callee save registers. Benchmark Lines Description Compiler 30,000 Chez Scheme recompiling itself DDD 15,000 hardware derivation system [3] deriving Scheme machine [4] Similix 7,000 self application of the Similix [2] partial evaluator SoftScheme 10,000 Wright s soft typer [15] checking a 2,500 line program Table 1. E x true false call (seq E1 E2) if E1 E2 E3) We assume that assignment conversion has already been ....

Bhaskar Bose. DDD---A transformation system for Digital Design Derivation. Technical Report 331, Indiana University, Computer Science Department, May 1991.

.... logic devices (PLDs) and FOXI fiber optic communications chips [48] Using a combination of formal techniques, a verified clock synchronization circuit design has also been developed[49] The principal design tool was the Digital Design Derivation system (DDD) developed by Indiana University[50]. Some design optimizations that were not possible within DDD were verified using PVS. 4.1.3 Byzantine Agreement Algorithms Fault tolerant systems, although internally redundant, must deal with single source information from the external world. For example, a flight control system is built around ....

....Langley Graduate Student Research Program fellowship, Bhaskar Bose developed the Digital Design Derivation system (DDD) and used it to design a verified microprocessor. DDD implements a formal design algebra that allows a designer to transform a formal specification into a correct implementation[50]. Bose formally derived the DDD FM9001[70] microprocessor from Hunt s toplevel specification of the FM9001 microprocessor[71] 5 Some Observations Some general conclusions can be drawn from the collective experience of the Langley sponsored projects. First, modern formal specification languages ....

Bhaskar Bose, "DDD - A Transformation system for Digital Design Derivation", Technical Report 331, Indiana University, Computer Science Department, May 1991.

....are used at strategic levels of thinking. We illustrate how the choice of target technology influences the tactical course of derivation. Throughout, we try to give a sense of how functional abstractions are manipulated in the engineering process. 1 Introduction The DDD transformation system [2] was developed to help us explore and demonstrate a formalization of digital design based on functional algebra. DDD stands for digital design derivation; the system is used interactively to transform higher level behavioral specifications into hierarchical boolean systems, to which logic ....

Bhaskar Bose. DDD - a transformation system for digital design derivation. Technical Report 331, Indiana University, Computer Science Department, May 1991.

....place in engineering practice. The DDD FM9001 is a 32 bit general purpose microprocessor formally derived from Hunt s Boyer Moore Logic FM9001 microprocessor specification [35, 36] The derivation involved the use of three mechanical verification tools: the DDD digital design derivation system [42, 40, 6, 41] , the Nqthm theorem prover [11] and the COSMOS boolean tautology checker [14, 15] The project was undertaken to explore the nature of integration between derivation and verification. The DDD digital design derivation system is a first order transformation system that implements a basic design ....

....procedures and with other reasoning systems. Chapter 3 DDD Design Derivation System 3. 1 Introduction DDD (Digital Design Derivation System) is a transformation system that implements a basic design algebra for synthesizing digital circuit descriptions from high level functional specifications [42, 40, 6]. The system is a formalization of digital design based on a functional algebra. DDD is much like a proof checker in the sense that it automates the transformations needed for circuit synthesis, but requires substantial guidance to perform a derivation. The system is implemented in the Lisp ....

Bhaskar Bose. DDD - a transformation system for digital design derivation - reference manual. Technical Report 331, Computer Science Dept., Indiana University, May 1991.

No context found.

Bose, B. DDD: A transformation system for digital design derivation. Tech. Rep. 331, Indiana University, 1991.

No context found.

B. Bose. DDD: A transformation system for digital design derivation. Technical Report 331, Computer Science Department, Indiana University, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC