close this section of the libraryftp://ftp.cs.umr.edu (50)
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/91-07.ps, 19911026
COMPARISON OF THREE AXIOMATIC SYSTEMS FOR CSP Hanan Lut yya and Bruce McMillin CSC-91-7 June 6, 1991 Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 ff@cs.umr.edu This work was supported in part by the National Science Foundation under Grant Numbers MIP-8909749 and
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/91-15.ps, 19911026
Experimental Computation Laboratory 1990-1991 ANNUAL REPORT Technical Report Number CSC-91-015 Contents Executive Summary ............................................. 2 History ................................................................. 3 Activities
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/91-12.ps, 19911026
FORMAL GENERATION OF EXECUTABLE ASSERTIONS FOR A FAULT-TOLERANT PARALLEL BITONIC SORT Hanan Lut yya and Bruce McMillin CSC-91-12 July 25, 1991 Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 ff@cs.umr.edu I. INTRODUCTION Multicomputers have gained much attention
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/91-13.ps, 19911026
FORMAL GENERATION OF EXECUTABLE ASSERTIONS FOR A FAULT-TOLERANT PARALLEL MATRIX RELAXATION Hanan Lut yya and Bruce McMillin CSC-91-13 October 15, 1991 Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 ff@cs.umr.edu This work was supported in part by the National
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/91-14.ps, 19911026
APPLICATION-ORIENTED FAULT-TOLERANT PARALLEL BRANCH & BOUND Aggie Y.Sun and Bruce McMillin CSC-91-014 September 3, 1991 Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 ff@cs.umr.edu This work was supported in part by the National Science Foundation under Grant
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/91-09.ps, 19911026
COMPOSITE STOCK CUTTING THROUGH SIMULATED ANNEALING Hanan Lut yya and Bruce McMillin Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 ff@cs.umr.edu Pipatpong Poshyanonda and Cihan Dagli Department of Engineering Management University of Missouri at Rolla Rolla,
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/91-16.ps, 19911108
MULTICAST ROUTING IN UNRELIABLE NETWORKS Martina Schollmeyer CSC-91-16 July 31, 1991 Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 This work was supported in part by the National Science Foundation under Grant Numbers MIP-8909749 and CDA-8820714, and in part by the
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/91-17.ps, 19911122
FORMAL METHODS OF REAL-TIME SYSTEMS Sumei Tsai and Bruce McMillin CSC-91-17 August 6, 1991 Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 ff@cs.umr.edu This work was supported in part by the National Science Foundation under Grant Numbers MIP-8909749 and
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/92-03.ps, 19920406
ADIVIDE AND CONQUER RING EMBEDDING SCHEME ON HYPERCUBES WITH EFFICIENT RECOVERYABILITY Junlin Liu and Bruce McMillin CSC-92-03 January 10, 1992 Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 ff@cs.umr.edu This work was supported in part by the National Science
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/92-01.ps, 19920406
AN ALGORITHM FOR GENERATING EXECUTABLE ASSERTIONS FOR FAULTTOLERANCE Martina Schollmeyer,Hanan Lut yya and Bruce McMillin CSC-92-01 March 21, 1992 Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 This work was supported in part by the National Science Foundation under
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/92-08.ps, 19920709
AN ENHANCED RECONFIGURABLE EMBEDDING SCHEME FOR RINGS IN HYPERCUBES Junlin Liu and Bruce M. McMillin CSC-92-08 Apr.30, 1992 Department of Computer Science University of Missouri - Rolla Rolla, Missouri 65401 ff@cs.umr.edu This work was supported in part by the National Science Foundation under Grant
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/92-02.ps, 19921116
FAULT-TOLERANT CONCURRENT BRANCH AND BOUND ALGORITHM DERIVED FROM PROGRAM VERIFICATION Hanan Lut yya, Aggie Sun and Bruce McMillin CSC 92-002 January 12, 1992 Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 ff@cs.umr.edu
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/92-14.ps, 19921116
FORMAL DERIVATION of an ERROR-DETECTING DISTRIBUTED DATA SCHEDULER USING CHANGELING Hanan Lut yya Bruce McMillin and Alan Su Department of Computer Science Department of Computer Science University of Western Ontario University of Missouri-Rolla London, ONTARIO N6A 5B7 Rolla, MO 65401 CANADA USA
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/92-06.ps, 19921116
Relaxing Synchronization in Distributed Simulated Annealing Chul-Eui Hong and Bruce M. McMillin Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 ff@cs.umr.edu (314)-341-6435 (314)-341-4501 (FAX) C.Sc. 92-06 This work was supported in part by the National Science
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/92-04.ps, 19921116
FAULT-TOLERANT DISTRIBUTED DEADLOCK DETECTION/RESOLUTION Pei-yu Li and Bruce McMillin CSC-92-04 October 15, 1992 Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 ff@cs.umr.edu This work was supported in part by the National Science Foundation under Grant Number
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/93-02.ps, 19930129
Genetic Algorithms For Vertex Splitting in DAGs1 Matthias Mayer2 and Fikret Ercal3 CSC-93-02 Fri Jan 29 1993 Department of Computer Science University of Missouri-Rolla Rolla, MO 65401, U.S.A. (314) 341-4491 1This paper has been submitted to the 5th International Conference on Genetic Algorithms
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/93-03.ps, 19930323
ENSURING VALUE LIVENESS of DISTRIBUTED SOFTWARE THROUGH CHANGELING Grace Tsai, Matt Insall and Bruce McMillin CSC-93-03 March 15, 1993 This work was supported in part by the National Science Foundation under Grant Numbers MSS-9216479 and CDA-9222827, and, in part, from the Air Force Of ce of Scienti c
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/92-15.ps, 19930628
FORMAL GENERATION OF EXECUTABLE ASSERTIONS FOR APPLICATION-ORIENTED FAULTTOLERANCE Hanan Lut yya, Martina Schollmeyer and Bruce McMillin C.Sc. 92-15 January 28, 1992
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/91-06.ps, 19930713
FAULT-TOLERANT PARALLEL MATRIX MULTIPLICATION WITH ONE ITERATION FAULTDETECTION LATENCY Chul-Eui Hong and Bruce M. McMillin CSC-91-06 September 15, 1991 Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 ff@cs.umr.edu This paper appears, in its entirety,inthe
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/93-05.ps, 19930715
Parallel Algorithm Fundamentals and Analysis CSC 93-05 BRUCE McMILLIN 1, HANAN LUTFIYYA 2, GRACE TSAI1, and JUN-LIN LIU1 1 Department of Computer Science University of Missouri-Rolla Rolla, MO 65401 USA 2 Department of Computer Science University of Western Ontario London, ONTARIO N6A 5B7 CANADA This
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/93-17.ps, 19930715
Parallel Algorithm Fundamentals and Analysis CSC 93-17 Bruce McMillin 1, Hanan Lutfiyya 2, Grace Tsai1, Jun-Lin Liu1 1 Department of Computer Science University of Missouri-Rolla Rolla, MO 65401 USA 2 Department of Computer Science University of Western Ontario London, Ontario N6A 5B7 Canada
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/92-16.ps, 19930810
USING MINIMAL AND MAXIMAL FAULTTOLERANCE FOR THE ASSESSMENT OF FAULT-TOLERANT ALGORITHMS Martina Schollmeyer and Bruce McMillin CSC-92-16 October 21, 1992 Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 This technical report is obsolete and has been replaced by a
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/93-13.ps, 19930810
OPERATIONAL EVALUATION OF RESPONSIVENESS PROPERTIES Grace Tsai, Matt Insall and Bruce McMillin CSC-93-06 June 30, 1993 This work was supported in part by the National Science Foundation under Grant Numbers MSS-9216479 and CDA-9222827, and, in part, from the Air Force Of ce of Scienti c Research under
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/92-07.ps, 19930811
AN IMPROVED CHARACTERIZATION OF 1-STEP RECOVERABLE EMBEDDINGS: RINGS IN HYPERCUBES Junlin Liu, Thomas J. Sager,and Bruce M. McMillin CS-92-07 Nov.241992 Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 ff@cs.umr.edu This work was supported in part by the National
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/93-20.ps, 19930920
ENSURING THE SATISFACTION OF A TEMPORAL SPECIFICATION AT RUN-TIME1 Grace Tsai, Matt Insall2 and Bruce McMillin3 CSC-93-020 August 1, 1993 1This work was supported by UM research board, the National Science Foundation under Grant Numbers MSS-9216479 and CDA-9222827, and from the Air Force Office of
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/92-24.ps, 19931011
AN APPLICATION-ORIENTED APPROACH TO DISTRIBUTED ERROR-DETECTING BRANCH & BOUND Aggie Y.Sun, Hanan Lut yya, and Bruce McMillin CSC-92-24 December 18, 1992 Department of Computer Science University of Missouri at Rolla Rolla, Missouri 65401 ff@cs.umr.edu This work was supported in part by the National
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/93-19.ps, 19931130
Asynchronous Parallel Schemes: A Survey Eric Jui-Lin Lu Michael G. Hilgers Bruce McMillin November 1993 CSC 93-19
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/93-31.ps, 19931201
Formal Model and Specification of Deadlock Pei-yu Li and Bruce McMillin August 1993 CSC-93-31
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/94-01.ps, 19940117
Efficient Run-Time Assurance in Distributed Systems Through Selection of Executable Assertions 1 Martina Schollmeyer and Bruce McMillin January 6, 1994 CSC 94-1
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/94-06.ps, 19940223
Formal Verification of Distributed Deadlock Detection Algorithm Using a Time-dependent Proof Technique Pei-yu Li and Bruce McMillin February 1994 CSC-94-06
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/94-05.ps, 19940322
A Reduction Semantics for Array Expressions: The PSI Compiler Lenore Mullin and Scott Thibault CSC-94-05 March 9, 1994 Department of Computer Science University of Missouri-Rolla Rolla, Missouri 65401 A Reduction Semantics for Array Expressions: The PSI Compiler Lenore Mullin Scott Thibault y March 9,
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/94-08.ps, 19940417
Generating Indexing Functions of Regularly Sparse Arrays for Array Compilers Scott Thibault, Lenore Mullin, Matt Insall CSC-94-08 April 4, 1994 Department of Computer Science University of Missouri-Rolla Rolla, Missouri 65401 Generating Indexing Functions of Regularly Sparse Arrays for Array Compilers
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/94-29.ps, 19940428
A RUN-TIME DECISION PROCEDURE FOR RESPONSIVE COMPUTING SYSTEMS GRACE TSAI Department of Computer Science University of Missouri-Rolla Rolla, MO 65401 USA sumeit@cs.umr.edu MATT INSALL Department of Mathematics and Statistics University of Missouri-Rolla Rolla, MO 65401 USA minsall@cs.umr.edu BRUCE
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/93-28.ps, 19940502
Using Temporal Subsumption for Developing Efficient Error-Detecting Distributed Algorithms 1 Martina Schollmeyer and Bruce McMillin October 21, 1993 CSC 93-28
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/94-14.ps, 19940620
c Copyright 1994 Pei-sheng Alan Su ALL RIGHT RESERVED This work is dedicated with love to my wife, Ingfang Tsai iii
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/93-16.ps, 19940628
A General Method for Maximizing the Error-Detecting Ability of Distributed Algorithms 1 2 Martina Schollmeyer and Bruce McMillin June 23, 1993 CSC 93-16
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/94-10.ps, 19940628
PROVIDING ASSURANCE FOR RESPONSIVE COMPUTING SYSTEMS by SU-MEI GRACE TSAI, 1961- A DISSERTATION Presented to the Faculty of the Graduate School of the UNIVERSITY OF MISSOURI-ROLLA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY in COMPUTER SCIENCE 1994 Dr. Bruce McMillin,
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/94-17.ps, 19940731
1 University of Missouri - Rolla University of Missouri - ROLLA Computer Science Department Technical Report Parallel Adaptive Mesh Refinement Algorithms by Mustafa Keskin - Fikret Ercal July 1994 i
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/94-21.ps, 19940915
Eighth-order Explicit Symplectic Runge-Kutta-Nystrom Integrators Daniel I. Okunbor and Eric J. Lu September, 1994 CSC 94-21
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/94-19.ps, 19940919
Teaching the Practice of Formal Methods in Distributed Computing Systems - A Module Beth Arrowsmith and Bruce McMillin1 July 30, 1994 CSC 94-19 Department of Computer Science University of Missouri-Rolla Rolla, MO 65401, USA e-mail: ff@cs.umr.edu This work appeared as a preliminary module in the
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/94-15.ps, 19940919
THE FORMAL DESCRIPTION OF RESOURCE DEADLOCK IN DISTRIBUTED SYSTEMS by PEI-YU LI, 1962- A DISSERTATION Presented to the Faculty of the Graduate School of the UNIVERSITY OF MISSOURI-ROLLA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY in COMPUTER SCIENCE 1994 Dr. Bruce M.
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/94-25.ps, 19940919
CONSTRUCTING AN INTERVALTEMPORAL LOGIC FOR REAL-TIME SYSTEMS Grace Tsai, Matt Insall and Bruce McMillin CSC-93-025 September 20, 1993 This work is supported by the research board of University of Missouri-Rolla, the National Science Foundation under Grant Numbers MSS-9216479 and CDA-9222827, and the Air
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/94-18.ps, 19940919
Using Temporal Subsumption to Generate Efficient Error-Detecting Distributed Algorithms by Martina F. Schollmeyer, 1964- A DISSERTATION Presented to the Faculty of the Graduate School of the UNIVERSITY OF MISSOURI-ROLLA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY in
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/94-20.ps, 19940919
How to Program in CCSP Beth Arrowsmith and Bruce McMillin1 August 30, 1994 CSC 94-20 Department of Computer Science University of Missouri-Rolla Rolla, MO 65401, USA e-mail: ff@cs.umr.edu This report replaces UMR Computer Science Technical Report 93-30
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/95-01.ps, 19950524
From Formal Security Specifications to Executable Assertions - A Distributed Systems Preliminary Study Cristina Serban and Bruce McMillin1 April 27, 1995 CSC 95-01 Department of Computer Science University of Missouri-Rolla Rolla, MO 65401, USA e-mail: fcserban, g@cs.umr.edu
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/95-08.ps, 19950817
Parallel Fast Multipole Algorithm using MPI Daniel Okunbor and Eric Jui-Lin Lu Computer Science Department University of Missouri - Rolla Rolla, MO 65401 June 21, 1995
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/95-10.ps, 19951113
Formal Methods: How, When, and Why They are Used BETH ARROWSMITH, BRUCE MCMILLIN, and RALPH WILKERSON 1 Technical Report CSC-95-10 October 1995 1Supported in part by the National Science Foundation under Grant Numbers MSS-9216479 and CDA-9222827, and, in part, from the Air Force Office of Scientific
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/95-11.ps, 19960724
Wheels: An Automated Program Analysis Tool Aggie Sun and Bruce McMillin1 March 20, 1996 CSC 95-11 Department of Computer Science University of Missouri-Rolla Rolla, MO 65401, USA e-mail: faggies, g@cs.umr.edu
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/96-05.ps, 19960819
Fast Algorithms for Maze Routing on an RMESH F. Ercaly and H. C. Leez Department of Computer Science University of Missouri-Rolla Rolla, MO 65401
open this document and view contentsftp://ftp.cs.umr.edu/pub/tech-reports/96-06.ps, 19961121
Efficient String Matching Algorithms on Reconfigurable Mesh Architectures H. C. Leey and F. Ercalz Department of Computer Science University of Missouri-Rolla Rolla, MO 65401