📄 http:^^www.cs.jhu.edu^~sullivan^
字号:
Date: Wed, 20 Nov 1996 23:02:09 GMT
Server: NCSA/1.5.1
Last-modified: Tue, 12 Nov 1996 12:57:18 GMT
Content-type: text/html
Content-length: 7978
<title> Gregory F. Sullivan's home page </title><body bgcolor="#FFFFFF"><h1> Gregory F. Sullivan </h1><h2> Education </h2> <pre>Ph.D. Computer Science Yale University 1986 M.S. Computer Science Yale University 1982 B.S. Computer Science Duke University 1980</pre><h2> Contact </h2> <UL><LI>E-mail: sullivan@cs.jhu.edu<LI>Phone: (410) 516-5553<LI>Fax: (410) 516-6134</UL><h2> Research </h2> Fault-tolerant computing; software design for testability; and designand analysis of algorithms.<p>Society increasingly relies on complex computerized systems toaccomplish basic daily functioning. This reliance demands thatcomputer systems be built that can continue to operate even when oneor more hardware modules and/or software programs malfunction. Acentral theme of Dr. Sullivan's research is designing systemsthat can tolerate faults. With his colleagues, Dr. Sullivan hasdefined and analyzed novel probabilistic models of self-monitoringmultiprocessor systems and provided powerful diagnostic strategies forlocalizing and removing faults. He and Prof. Masson have alsointroduced a promising software fault tolerance technique called thecertification trail method. Dr. Sullivan's research interests alsoinclude the broad area of the design and analysis of algorithms, e.g.,algorithms motivated by artificial intelligence applications.<p><!WA0><A HREF="http://www.cs.jhu.edu/~sullivan/download.html">Click here to seeselected publications available for downloading</A><h2> Bibliography of Selected Publications </h2> <p>J. D. Bright, G. F. Sullivan, and G. M. Masson, ``A Formally Verified Sorting Certifier,'' <cite>IEEE Transactions on Computers</cite>, IEEE Computer Society Press,accepted for publication. <p>G. M. Masson, D. Blough, and G. F. Sullivan, ``System Diagnosis''In <cite>Fault-Tolerant Computer System Design</cite>,(D.K. Pradhan, Editor), Prentice-Hall, pp. 478-536, 1996. <p>D. Heath, S. Kasif, S. R. Kosaraju, S. Salzberg and G. Sullivan, ``Learning Nested Concept Classes with Limited Storage''<cite>Journal of Experimental and Theoretical Artificial Intelligence</cite>,Vol. 8, April-June, pp. 129-148, 1996. <p>G. Sullivan, D. Wilson, and G. M. Masson,``Certification of Computational Results'',<cite>IEEE Transactions on Computers</cite>, IEEE Computer Society Press,Vol. 44, pp. 833-847, 1995. <p>J. D. Bright and G. Sullivan,``On-Line Error Monitoring for Several Data Structures'',<cite>Digest of the 25th Symposium on Fault-Tolerant Computing</cite>, IEEE Computer Society Press,pp. 392-401, 1995. <p>J. D. Bright, G. Sullivan, and G. M. Masson,``Checking the Integrity of Trees'',<cite>Digest of the 25th Symposium on Fault-Tolerant Computing</cite>, IEEE Computer Society Press,pp. 402-411, 1995. <p>D. M. Blough and G. Sullivan,``Voting Using Predispositions'',<cite>IEEE Transactions on Reliability</cite>,IEEE Computer Society Press,Vol. 43,pp. 604-616, 1994. <p>J. D. Bright and G. Sullivan,``Checking Mergeable Priority Queues'',<cite>Digest of the 24th Symposium on Fault-Tolerant Computing</cite>,IEEE Computer Society Press,pp. 144-153, June 1994. <p>S. Kasif, S. Banerjee, A. Delcher and G. Sullivan,``Some Results on the Complexity of Symmetric Connectionist Networks,''<cite>Annals of Mathematics and Artificial Intelligence</cite>,pp. 327-344, vol 9, 1993. <p>D. Wilson, G. F. Sullivan and G. Masson,``Certification Trails and Software Design for Testability,''<cite>Proceedings of the 1993 International Test Conference</cite>,pp. 200-209,International Test Conference - IEEE Computer Society Press,October 1993.<p>D. Wilson, G. F. Sullivan, and G. M. Masson,``Experimental Evaluation of Certification Trails UsingAbstract Data Type Validation'', <cite>16th Annual International Computer Software and Applications Conference</cite>,IEEE Computer Society Press, pp. 300-305, 1992. <p>G. M. Masson, and G. F. Sullivan,``A Method and Apparatus for Fault Tolerance."<cite>United States Patent Office</cite>, Serial No. 07/543451. <p>D. M. Blough, G. F. Sullivan, G. M. Masson,``Intermittent Fault Diagnosis in Multiprocessor Systems'',<cite>IEEE Transactions on Computers</cite>,IEEE Computer Society Press,Vol. 41, pp. 1430-1441, 1992. <p>D. M. Blough, G. F. Sullivan, G. M. Masson, ``Efficient Diagnosis of Multiprocessor Systems UnderProbabilistic Models'',<cite>IEEE Transactions on Computers</cite>,IEEE Computer Society Press,Vol. 41, pp. 1126-1136, 1992. <p>G. F. Sullivan and G. M. Masson,``Certification Trails for Data Structures'',<cite>Digest of the 21st Symposium on Fault-Tolerant Computing</cite>,IEEE Computer Society Press,pp. 240-247, 1991. <p>D. Heath, S. Kasif, S. R. Kosaraju, S. Salzberg and G. Sullivan, ``Learning Nested Concept Classes with Limited Storage'',<cite>Proc. of the 12th International JointConference on Artificial Intelligence</cite>,pp. 777-782,Sydney, Australia, 1991.<p>G. F. Sullivan and G. M. Masson,``Using Certification Trails to Achieve Software Fault Tolerance'',<cite>Digest of the 20th Symposium on Fault-Tolerant Computing</cite>,IEEE Computer Society Press,pp. 423-431, 1990.<p>D. M. Blough and G. Sullivan,``A Comparison of Voting Strategies for Fault-TolerantDistributed Systems'',<cite>Proceedings of the 9th Symposium on Reliable Distributed Systems</cite>,pp. 136-145,1990.<p>E. Schmeichel, S. L. Hakimi, M. Otsuka, and G. F. Sullivan,``A Parallel Fault Identification Algorithm'',<cite>Journal of Algorithms</cite>,Vol. 11, pages 231-241, 1990. <p>R. Beigel, S. R. Kosaraju and G. F. Sullivan,``Locating Faults in a Constant Number of Parallel Testing Rounds'',<cite>Proceedings of the 1989 ACM Symposium on Parallel Algorithms andArchitectures</cite>,pages 189-198, ACM Press, New York, NY, 1989. <p>D. Blough, G. F. Sullivan and G. M. Masson,``Fault Diagnosis for Sparsely Interconnected Multiprocessor Systems'',<cite>Digest of the 19th Symposium on Fault-Tolerant Computing</cite>,pages 62-69,IEEE Computer Society Press,1989.<p>D. Blough, G. F. Sullivan and G. M. Masson.``Almost Certain Diagnosis for Intermittently Faulty Systems'',<cite>Digest of the 18th Symposium on Fault-Tolerant Computing</cite>,IEEE Computer Society Press,June 1988.<p>E. Schmeichel, S. L. Hakimi, M. Otsuka, and G. F. Sullivan,``On Minimizing Testing Rounds for Fault Identification'',<cite>Digest of the 18th Symposium on Fault-Tolerant Computing</cite>,IEEE Computer Society Press,June 1988.<p>S. R. Kosaraju and G. F. Sullivan,``Detecting Cycles in Dynamic Graphs in Polynomial Time'',<cite>20th ACM Symposium on Theory of Computing</cite>,ACM Press, pp. 398-406, May 1988. <p>G. F. Sullivan, ``An $O(t^3 +|E|)$ Fault Identification Algorithm for Diagnosable Systems'',<cite>IEEE Transactions on Computers</cite>,IEEE Computer Society Press,Vol. C-37, pages 388-397, 1988. <p>G. F. Sullivan,``System-Level Fault Diagnosability in Probabilistic and Weighted Models'',<cite>Digest of the 17th Symposium on Fault-Tolerant Computing</cite>,pp. 190-195, IEEE Computer Society Press,July 1987. <p>G. F. Sullivan,``The Complexity of System-Level Fault Diagnosis and Diagnosability,''<cite>Ph. D. Thesis</cite>,Yale University, 1986. <p>G. F. Sullivan,``A Polynomial Time Algorithm for Fault Diagnosability,''<cite>25th IEEE Symposium on Foundations of Computer Science</cite>,pp. 148-156, IEEE Computer Society Press,October 1984. <p><!WA1><A HREF="http://www.cs.jhu.edu/~sullivan/links.html">Web Links</A>, some relevant pointers<p><!WA2><A HREF="http://www.cs.jhu.edu/~sullivan/research/reslinks.html">Research Links</A>, restricted access <P> <!WA3><A HREF="http://www.webtechs.com/html-val-svc/"> <!WA4><IMG SRC="http://www.cs.jhu.edu/~sullivan/valid_html.mcom.gif" ALT="WebTechs Mozilla Checked!"></A></Body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -