Results 1 
4 of
4
Symbolic Verification of MOS Circuits
, 1985
"... The program MOSSYM simulates the behavior of a MOS circuit represented as a switchlevel network symbolically. That is, during simulator operation the user can set an input to either 0, 1, or a Boolean variable. The simulator then computes the behavior of the circuit as a function of the past and pr ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
The program MOSSYM simulates the behavior of a MOS circuit represented as a switchlevel network symbolically. That is, during simulator operation the user can set an input to either 0, 1, or a Boolean variable. The simulator then computes the behavior of the circuit as a function of the past and present input variables. By using heuristically efficient Boolean function manipulation algorithms, the verification of a circuit by symbolic simulation can proceed much more quickly than by exhaustive logic simulation. In this paper we present our concept of symbolic simulation, derive an algorithm for switchlevel symbolic simulation, and present experimental measurements from MOSSYM.
Automatic Verification of a Class of Systolic Circuits
 Formal Aspects of Computing
, 1996
"... Systolic circuits have drawn considerable attention as a means of implementing parallel algorithms in areas such as linear algebra, signal processing, pattern matching, etc. A systolic circuit is composed of a number of computation cells which are connected in a regular pattern. Each cell can perfor ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Systolic circuits have drawn considerable attention as a means of implementing parallel algorithms in areas such as linear algebra, signal processing, pattern matching, etc. A systolic circuit is composed of a number of computation cells which are connected in a regular pattern. Each cell can perform computations, store data, and communicate with other cells in the circuit. We present a method for automatic verification of a class of these circuits. We define a language to describe implementations and specifications of our class of circuits, and present a method to automatically check whether a circuit implementation fulfills its specification. The main advantage of our approach, as compared to earlier work in the field, is that the verification is performed fully automatically. We give an example of how the method may be applied to verify a convolution circuit. 1 Introduction The advent of VLSI has increased the interest in designing highlyparallel computing architectures in order t...
The Data Field Model
 Coyne R D, Rosenman M A, Radford A D, Balachandran M and Gero J S Knowledgebased
, 2001
"... Indexed data structures are prevalent in many programming applications. Collectionoriented languages provide means to operate directly on these structures, rather than having to loop or recurse through them. This style of programming will often yield clear and succinct programs. However, these prog ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Indexed data structures are prevalent in many programming applications. Collectionoriented languages provide means to operate directly on these structures, rather than having to loop or recurse through them. This style of programming will often yield clear and succinct programs. However, these programming languages will often provide only a limited choice of indexed data types and primitives, and the exact semantics of these primitives will sometimes vary with the data type and language. In this paper we develop a unifying semantical model for indexed data structures. The purpose is to support the construction of abstract data types and language features for such structures from first principles, such that they are largely generic over many kinds of data structures. The use of these abstract data types can make programs and their semantics less dependent of the actual data structure. This makes programs more portable across different architectures and facilitates the early design phase. The model is a generalisation of arrays, which we call data fields: these are functions with explicit information about their domains. This information can be conventional array bounds but it could also define other shapes, for instance sparse. Data fields can be interpreted as partial functions, and we define a metalanguage for partial functions. In this language we define abstract versions of collectionoriented operations, and we show a number of identities for them. This theory is used to guide the design of data fields and their operations so they correspond closely to the more abstract notion of partial functions. We define phiabstraction, a lambdalike syntax for defining data fields in a shapeindependent manner, and prove a theorem which relates phiabstraction and lambdaabstraction semantically. We also define a small data field language whose semantics is given by formal data fields, and give examples of data field programming for parallel algorithms with arrays and sparse structures, database quering and computing, and specification of symbolic drawings.
Decidable and Undecidable Problems in Systolic Circuit Verification
, 1991
"... We present a decision method for automatic verification of a nontrivial class of systolic circuits. A formal model for systolic circuits, and a formal definition of systolic circuit verification are provided. Using this model, we give a decision method for verification of a class of circuits, in whi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a decision method for automatic verification of a nontrivial class of systolic circuits. A formal model for systolic circuits, and a formal definition of systolic circuit verification are provided. Using this model, we give a decision method for verification of a class of circuits, in which the cell operations of the circuits are regarded as uninterpreted function symbols. If a circuit is verified in this manner then the circuit is correctly implemented with respect to its specification regardless of the particular interpretation of the cell operations. Finally we show that simple generalizations of the class lead to undecidable verification problems. Examples of circuits which can be verified automatically by our method include circuits for: convolution algorithms, matrix operations (such as matrix multiplication and transposition), string comparisons (such as substring detection, approximate string matching, and palindrome recognition), and implementation of digital filter...