2003/12/05 by Olga Shumsky Matlin, Matlin, Olga Shumsky, William McCune +3
Computer Science · #D.1.3 #D.2.4 #Distributed #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Parallel #and Cluster Computing (cs.DC) #cs.DC #cs.LO
paper · pdf · doi:10.48550/arxiv.cs/0312012
12 pages, 3 figures, 1 table
arxiv created 2003/12/05 · arxiv updated 2009/12/01
We report on an effort to develop methodologies for formal verification of parts of the Multi-Purpose Daemon (MPD) parallel process management system. MPD is a distributed collection of communicating processes. While the individual components of the collection execute simple algorithms, their interaction leads to unexpected errors that are difficult to uncover by conventional means. Two verification approaches are discussed here: the standard model checking approach using the software model checker SPIN and the nonstandard use of a general-purpose first-order resolution-style theorem prover OTTER to conduct the traditional state space exploration. We compare modeling methodology and analyze performance and scalability of the two methods with respect to verification of MPD.