Using abstract specifications to verify powerPC™ custom memories by symbolic trajectory evaluation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2144, Issue , 2001, Pages 386-402

  Bhadra, Jayanta ^a,b   Martin, Andrew ^a   Abraham, Jacob ^b   Abadir, Magdy ^a  

^a MOTOROLA INC   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING; ROBOTS; SPECIFICATIONS;

ABSTRACT SPECIFICATIONS; EFFICIENT MEMORY MODELING; POWERPC PROCESSORS; REGISTER TRANSFER LEVEL; REGULAR EXPRESSIONS; SCHEMATIC DESCRIPTION; SYMBOLIC SIMULATION; SYMBOLIC TRAJECTORY EVALUATION;

ABSTRACTING;

EID: 84947233560     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44798-9_30     Document Type: Conference Paper

References (12)

1. M. N. Velev, R. E. Bryant, A. Jain. Efficient “Modeling of Memory Arrays in Symbolic Simulation”. CAV, 1997, Proceedings. LNCS, Vol. 1254, Springer, 1997, pp. 388-399.
2. M. N. Velev, R. E. Bryant. “Efficient Modeling of Memory Arrays in Symbolic Ternary Simulation”. TACAS, 1998.
3. N. Krishnamurthy, A. K. Martin, M. S. Abadir, J. A. Abraham. “Validating PowerPC Microprocessor Custom Memories” IEEE Design and Test of Computers, Vol. 17, No. 4, Oct-Dec 2000, pp. 61-76.
4. L.-C. Wang, M. S. Abadir, N. Krishnamurthy. “Automatic Generation of Assertions for Formal Verification of PowerPC Microprocessor Arrays Using Symbolic Trajectory Evaluation”. 35th ACM/IEEE DAC, June, 1998.
5. R. E. Bryant. “Algorithmic Aspects of Symbolic Switch NetworkAnalysis”. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 6(4), July 1987.
6. C.-J. H. Seger and R. E. Bryant. “Formal verification by symbolic evaluation of partially-ordered trajectories”. Formal Methods in System Design, 6(2):147-189, March, 1995.
7. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, 1979, pp. 1-45.
8. R. E. Bryant. “Graph-Based Algorithms for Boolean Function Manipulation”. IEEE Transactions on Computers, 35(8), August 1986.
9. R. E. Bryant. “Verifying a Static RAM Design by Logic Simulation”, Fifth MIT Conference on Advanced Research in VLSI, 1988, pp. 335-349.
10. N. Ganguly, M. S. Abadir, M. Pandey. “PowerPC array verification methodology using formal techniques”. International Test Conference 1996, pp.857-864.
11. M. Pandey, R. Raimi, D. L. Beatty, R. E. Bryant. “Formal Verification of PowerPC arrays using Symbolic Trajectory Evaluation”. 33rd ACM/IEEE DAC, June 1996, pp.649-654.
12. M. Pandey, R. Raimi, R. E. Bryant, M. S. Abadir. “Formal Verification of Content Addressable Memories using Symbolic Trajectory Evaluation”. 34th ACM/IEEE DAC, June 1997.