Abstract
This paper focuses on being able to detect component errors which can lead to system failures in the scheduling part of the lock manager portion of the distributed database system by using embedded executable assertions. The technique used to generate the executable assertions is based on the mathematical model of program verification.
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 Office of Scientific Research under contract number F49620-92-J-0546 and the National Sciences and Engineering Research Council of Canada (NSERC) under contract number OGP0138180-S365A2, and in part, from the University of Western Ontario NSERC internal funding under contract number Z001A8-S365A1.
Preview
Unable to display preview. Download preview PDF.
Bibliography
Bernstein, P. and Goodman, N., “Concurrency Control in Distributed Database Systems,” Computing Surveys, 13, 2, 1981, pp. 185–221.
Eswan, K.P., Gray, J.N., Lorie, R.A., and Traiger I.L., “The Notions of Consistency and Predicate Locks in a Database System,” Communications of the ACM, 19, 11, 1976, pp. 624–633.
Hoare, C., “An Axiomatic Basis for Computer Programming,” Communications of the ACM, 12, 10, 1969, 576–583.
Kuhl, J. and Reddy, S., “Fault Tolerance Considerations in Large, Multiple Pro cessor Systems,” IEEE Computer, March 1986, pp. 56–67.
Lamport, L., Shostack, R. and Pease, M., “The Byzantine General's Problem,” ACM Transaction on Programming Language Systems, vol. 4, July 1982, pp. 382–401.
Levin, G.M and Gries, D., “A Proof Technique for Communicating Sequential Process,” Acta Information, 15, 1981, 281–302.
Lutfiyya, H. and McMillin, B., “Comparison of Three Axiomatic Proof Systems,” UMR Department of Computer Science Technical Report Number CSC 91-13, (Submitted to Information Processing Letters)
Lutfiyya, H., Schollmeyer, M., and McMillin, B., “Fault-Tolerant Distributed Sort Generated from a Verification Proof Outline,” Second International Workshop on Responsive Computer Systems, 1992 (To Appear)
Lutfiyya, H., Su, A., and McMillin, B., “Formal Derivation of an Error-Detecting Distributed Data Scheduler Using Changeling,” UMR Technical Report CSc. 92-014.
McMillin, B. and Ni, L., “Reliable Distributed Sorting Through The Application-oriented Fault Tolerance Paradigm,” IEEE Trans. On Parallel and Distributed Computing, Volume 3, Number 4, July 1992, pp. 411–420.
Owicki, S. and Lamport, L., “Proving Liveness Properties of Concurrent Programs,” ACM TOPLAS, Vol. 4, No. 3, July 1982, pp. 455–495.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lutfiyya, H., McMillin, B., Su, A. (1993). Formal derivation of an error-detecting distributed data scheduler using Changeling. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds) Formal Methods in Programming and Their Applications. Lecture Notes in Computer Science, vol 735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039720
Download citation
DOI: https://doi.org/10.1007/BFb0039720
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57316-6
Online ISBN: 978-3-540-48056-3
eBook Packages: Springer Book Archive