An Algebraic Model for Asynchronous Circuits Verification

An algebraic methodology for comparing switch-level circuits with higher-level specifications is presented. Switch-level networks, 'user' behavior, and input constraints are modeled as asynchronous machines. The model is based on the algebraic theory of characteristic functions (CF). An asynchronous automation is represented by a pair of CFs, called a dynamic CF (DCF): the first CF describes the potential stable states, and the second CF describes the possible transitions. The set of DCFs is a Boolean algebra. Machine composition and internal variables abstraction correspond, respectively, to the product and sum operations of the algebra. Internal variables can be abstracted under the presence of a domain constraint. The constraint is validated by comparison to the outside behavior. The model is well suited for speed-independent circuits for which the specification is given as a collection of properties. Verification reduces to the validation of Boolean inequalities. >

[1]  Michael John Gordon.  A model of register transfer systems with applications to microcode and VLSI correctness , 1982 .

[2]  Gregor von Bochmann.  Hardware Specification with Temporal Logic: An Example , 1982, IEEE Transactions on Computers.

[3]  Anthony S. Wojcik,et al.  A Formal Design Verification System Based on an Automated Reasoning System , 1984, 21st Design Automation Conference Proceedings.

[4]  George J. Milne,et al.  A Model for Hardware Description and Verification , 1984, 21st Design Automation Conference Proceedings.

[5]  Larry Wos,et al.  Automated Reasoning: Introduction and Applications , 1984 .

[6]  Edmund M. Clarke,et al.  Automatic verification of asynchronous circuits using temporal logic , 1986 .

[7]  Stephen H. Unger,et al.  Asynchronous sequential switching circuits , 1969 .

[8]  Harry G. Barrow,et al.  VERIFY: A Program for Proving Correctness of Digital Hardware Designs , 1984, Artif. Intell..

[9]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[10]  Ben C. Moszkowski,et al.  A Temporal Logic for Multilevel Reasoning about Hardware , 1985, Computer.

[11]  Vijay Pitchumani,et al.  An Inductive Assertion Method for Register Transfer Level Design Verification , 1983, IEEE Transactions on Computers.

[12]  Edmund M. Clarke,et al.  Hierarchical Verification of Asynchronous Circuits Using Temporal Logic , 1985, Theor. Comput. Sci..

[13]  Eduard Cerny,et al.  An Approach to Unified Methodology of Combinational Switching Circuits , 1977, IEEE Transactions on Computers.

[14]  Robert M. Keller,et al.  Towards a Theory of Universal Speed-Independent Modules , 1974, IEEE Transactions on Computers.

[15]  Randal E. Bryant,et al.  A Switch-Level Model and Simulator for MOS Digital Systems , 1984, IEEE Transactions on Computers.

[16]  Boris Beizer,et al.  Towards a New Theory of Sequential Switching Networks , 1970, IEEE Transactions on Computers.

[17]  Michael Yoeli,et al.  On a Ternary Model of Gate Networks , 1979, IEEE Transactions on Computers.

[18]  Leonard R. Marino,et al.  General theory of metastable operation , 1981, IEEE Transactions on Computers.

[19]  Randal E. Bryant,et al.  Symbolic Verification of MOS Circuits , 1985 .

[20]  Sergiu Rudeanu.  Boolean functions and equations , 1974 .

[21]  J. Hayes.  A unified switching theory with applications to VLSI design , 1982, Proceedings of the IEEE.

[22]  Todd Jeffry Wagner.  Hardware verification , 1977 .

[23]  Eduard Cerny,et al.  Simulation of MOS Circuits by Decision Diagrams , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[24]  Eduard Cerny.  Controllability and Fault Observability in Modular Combinational Circuits , 1978, IEEE Transactions on Computers.

[25]  Raymond E Miller.  Switching theory , 1979 .