Circuit Level Verification of a High-Speed Toggle

As VLSI fabrication technology progresses to 65nm feature sizes and smaller, transistors no longer operate as ideal switches. This motivates verifying digital circuits using continuous models. This paper presents the verification of the high-speed, toggle flip-flop proposed by Yuan and Svensson [1]. Our approach builds on the projection based methods originally proposed by Greenstreet and Mitchell [2], [3]. While they were only able to demonstrate their approach with two- and threedimensional systems, we apply projection based analysis to a seven-dimensional model for the flip-flop. We believe that this is the largest verification to date of a digital circuit using non-linear circuit-level models. In this paper, we describe how we overcame problems of numerical errors and instability associated with the original projection based methods. In particular, we present a novel linear-program solver and new methods for constructing accurate linear approximations of non-linear dynamics. We use the toggle flip-flop as an example and consider how these methods could be extended to verify a standard cell library for digital design.

[1]  T. Henzinger,et al.  Algorithmic Analysis of Nonlinear Hybrid Systems , 1998, CAV.

[2]  B. Krogh,et al.  Towards formal verification of analog designs , 2004, ICCAD 2004.

[3]  Roberto Bagnara,et al.  Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library , 2002, SAS.

[4]  Ian M. Mitchell,et al.  Integrating Projections , 1998, HSCC.

[5]  Mark R. Greenstreet Verifying Safety Properties of Differential Equations , 1996, CAV.

[6]  Eugene Asarin,et al.  The d/dt Tool for Verification of Hybrid Systems , 2002, CAV.

[7]  H. Wong-Toi,et al.  Some lessons from the HYTECH experience , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[8]  Christer Svensson,et al.  High-speed CMOS circuit technique , 1989 .

[9]  Thomas A. Henzinger,et al.  Automatic symbolic verification of embedded systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[10]  Goran Frehse PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech , 2005, HSCC.

[11]  Amir Pnueli,et al.  Orthogonal Polyhedra: Representation and Computation , 1999, HSCC.

[12]  Leon O. Chua,et al.  Practical Numerical Algorithms for Chaotic Systems , 1989 .

[13]  B. I. Silva,et al.  Modeling and Verifying Hybrid Dynamic Systems Using CheckMate , 2001 .

[14]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[15]  Ian M. Mitchell,et al.  Reachability Analysis Using Polygonal Projections , 1999, HSCC.

[16]  Robert P. Kurshan,et al.  Analysis of digital circuits through symbolic reduction , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Roger W. Brockett,et al.  Smooth dynamical systems which realize arithmetical and logical operations , 1989 .

[18]  Rob A. Rutenbar,et al.  Verifying analog oscillator circuits using forward/backward abstraction refinement , 2006, Proceedings of the Design Automation & Test in Europe Conference.

[19]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[20]  Marius Laza,et al.  A robust linear program solver for projectahedra , 2002 .