"Deadlock detection for concurrent programs has traditionally been accomplished by symbolic methods or by search of a state transition system. This work examines an approach that uses geometric semantics involving the topological notion of dihomotopy to partition the state space into components, followed by an exhaustive search of the reduced state space. Prior work partitioned the state-space inductively; however, this work shows that a technique motivated by recursion further reduces the size of the state transition system. The reduced state space results in asymptotic improvements in overall runtime for verification. Thus, with efficient partitioning, more efficient deadlock detection and eventually more efficient verification of some temporal properties can be expected for large problems"--Abstract, page iii.
McMillin, Bruce M.
Tauritz, Daniel R.
Liu, Xiaoqing Frank
Ph. D. in Computer Science
Missouri University of Science and Technology
xii, 135 pages
© 2010 David Andrew Cape, All rights reserved.
Dissertation - Open Access
Library of Congress Subject Headings
Electronic data processing
Multiprogramming (Electronic computers)
Parallel processing (Electronic computers)
Print OCLC #
Electronic OCLC #
Link to Catalog Recordhttp://laurel.lso.missouri.edu/record=b8057360~S5
Cape, David Andrew, "Deadlock detection and dihomotopic reduction via progress shell decomposition" (2010). Doctoral Dissertations. 1899.