Handling special constructs in symbolic simulation

Symbolic simulation is a formal verification technique which combines the flexibility of conventional simulation with powerful symbolic methods. Some constructs, however, which are easy to handle in conventional simulation need special consideration in symbolic simulation. This paper discusses some special constructs that require unique treatment in symbolic simulation such as the symbolic representation of arrays, an efficient This paper discusses some special constructs that are unique to symbolic simulation such as the symbolic representation of arrays, an efficient symbolic method for storing arrayed instances and the handling of symbolic data-dependent delays. We present results which demonstrate the effectiveness of our symbolic array model in the simulation of highly regular structures like FPGAs, memories or cellular automata.

[1]  J. Kukula,et al.  Symbolic RTL simulation , 2001, DAC '01.

[2]  Randal E. Bryant,et al.  Verification of pipelined microprocessors by correspondence checking in symbolic ternary simulation , 1998, Proceedings 1998 International Conference on Application of Concurrency to System Design.

[3]  Frank M. Brown,et al.  Boolean reasoning - the logic of boolean equations , 1990 .

[4]  Randal E. Bryant,et al.  Formal hardware verification by symbolic ternary trajectory evaluation , 1991, 28th ACM/IEEE Design Automation Conference.

[5]  Randal E. Bryant,et al.  Efficient Modeling of Memory Arrays in Symbolic Simulation , 1997, CAV.

[6]  Alan J. Hu,et al.  Higher-Level Specification and Verification with BDDs , 1992, CAV.

[7]  Randal E. Bryant,et al.  Efficient modeling of memoryarrays in symbolic simulation , 1997, CAV 1997.

[8]  Randal E. Bryant,et al.  Symbolic timing simulation using cluster scheduling , 2000, Proceedings 37th Design Automation Conference.

[9]  Randal E. Bryant,et al.  Formally Verifying a Microprocessor Using a Simulation Methodology , 1994, 31st Design Automation Conference.

[10]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[11]  Giovanni De Micheli,et al.  Synthesis and Optimization of Digital Circuits , 1994 .

[12]  Bill Lin,et al.  Minimization of symbolic relations , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[13]  Randal E. Bryant,et al.  Formal verification by symbolic evaluation of partially-ordered trajectories , 1995, Formal Methods Syst. Des..

[14]  Randal E. Bryant,et al.  Efficient Modeling of Memory Arrays in Symbolic Ternary Simulation , 1998, TACAS.