DocumentCode
2010642
Title
Directions in multiprocessor verification
Author
Logan, Carol A.
Author_Institution
IBM Corp., Austin, TX, USA
fYear
1995
fDate
28-31 Mar 1995
Firstpage
29
Lastpage
33
Abstract
IBM server products, mainframes and RISC engines, have witnessed an evolution in verification techniques. Costly special-purpose engines and blunt attempts to force operating system initial program load´s (IPL´s) in simulation have given way to the idea of more complete, lower level simulation with smart testcase generation algorithms. The idea is to explore the state space of the smaller piece of logic more fully before integrating if into its larger residence. This form of divide and conquer is being used in IBM´s Austin facility. Shared-Memory Multiprocessor (SMP) verification represents a special case of verification for an entire computer system. Many of its constraints are common with other parts of the system. This paper examines verification from a historical perspective, explores some of the ways of using existing hardware resources without additional capital investment and highlights how IBM´s Austin facility addresses SMP simulation
Keywords
formal verification; shared memory systems; virtual machines; IBM´s Austin facility; SMP simulation; multiprocessor verification; shared-memory multiprocessor; testcase generation; verification; Computational modeling; Engines; Hardware; Investments; Logic; Operating systems; Reduced instruction set computing; Space exploration; State-space methods; System testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers and Communications, 1995., Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix Conference on
Conference_Location
Scottsdale, AZ
Print_ISBN
0-7803-2492-7
Type
conf
DOI
10.1109/PCCC.1995.472516
Filename
472516
Link To Document