MJRTY - A Fast Majority Vote Algorithm.
作者： Robert S. Boyer , J. Strother Moore
DOI: 10.1007/978-94-011-3488-0_5
关键词: Computation 、 Redundancy (engineering) 、 Algorithm 、 Computer science 、 Code (cryptography) 、 Majority rule 、 Magnetic tape 、 Verification system 、 Informal proof 、 Fortran
摘要: A new algorithm is presented for determining which, if any, of an arbitrary number candidates has received a majority the votes cast in election. The comparisons required at most twice votes. Furthermore, uses storage way that permits efficient use magnetic tape. Fortran version exhibited. code been proved correct by mechanical verification system Fortran. and proof are discussed.
springer.com
sci-hub.se 参考文章(9)
J Strother Moore, Robert S Boyer, A Verification Condition Generator for FORTRAN. ,(1980)
J. Strother Moore, Robert S. Boyer, The Correctness Problem in Computer Science Published in <b>1981</b> in London by Academic press. ,(1982)
James Cornelius King, A program verifier ifip congress. pp. 234- 249 ,(1970)
Zohar Manna, Mathematical Theory of Computation Dover Publications, Incorporated. ,(2003)
Robert S. Boyer, A computational logic ,(1979)
J. Misra, David Gries, Finding Repeated Elements Science of Computer Programming. ,vol. 2, pp. 143- 152 ,(1982) , 10.1016/0167-6423(82)90012-0
J.H. Wensley, L. Lamport, J. Goldberg, M.W. Green, K.N. Levitt, P.M. Melliar-Smith, R.E. Shostak, C.B. Weinstock, SIFT: Design and analysis of a fault-tolerant computer for aircraft control Proceedings of the IEEE. ,vol. 66, pp. 1240- 1255 ,(1978) , 10.1109/PROC.1978.11114
D. Evelyn, Proving programs correct ,(1979)
M. V. Wilkes, The Art of Computer Programming, Volume 3, Sorting and Searching The Computer Journal. ,vol. 17, pp. 324- 324 ,(1974) , 10.1093/COMJNL/17.4.324