DocumentCode :
3030661
Title :
Swarm Verification
Author :
Holzmann, Gerard J. ; Joshi, Rajeev ; Groce, Alex
Author_Institution :
Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA
fYear :
2008
fDate :
15-19 Sept. 2008
Firstpage :
1
Lastpage :
6
Abstract :
Reportedly, supercomputer designer Seymour Cray once said that he would sooner use two strong oxen to plow afield than a thousand chickens. Although this is undoubtedly wise when it comes to plowing afield, it is not so clear for other types of tasks. Model checking problems are of the proverbial "search the needle in a haystack" type. Such problems can often be parallelized easily. Alas, none of the usual divide and conquer methods can be used to parallelize the working of a model checker. Given that it has become easier than ever to gain access to large numbers of computers to perform even routine tasks it is becoming more and more attractive to find alternate ways to use these resources to speed up model checking tasks. This paper describes one such method, called swarm verification.
Keywords :
parallel processing; program verification; divide-and-conquer method; model checking; parallel processing; swarm verification; Central Processing Unit; Computer networks; Laboratories; Logic; Propulsion; Random access memory; Read-write memory; Space technology; Supercomputers; Switches;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Automated Software Engineering, 2008. ASE 2008. 23rd IEEE/ACM International Conference on
Conference_Location :
L´Aquila
ISSN :
1938-4300
Print_ISBN :
978-1-4244-2187-9
Electronic_ISBN :
1938-4300
Type :
conf
DOI :
10.1109/ASE.2008.9
Filename :
4639302
Link To Document :
بازگشت