R. S. Boyer and J S. Moore. MJRTY - a fast majority vote algorithm. In R. S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe, volume 1 of Automated Reasoning, pages 105-117. Kluwer Academic Publishers, 1991.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....a definition. This allows us a certain freedom in the implementation of this function. Although the three properties are all that is required of an implementation of HybridMajority , in earlier work a concrete implementation of HybridMajority was provided based on the Boyer Moore MJRTY algorithm [3], and proved that the axioms below are satisfied by this implementation [13] Thus the following may be considered axioms, or may be considered lemmas proven by appeal to imported hybridmjrty theory: HybridMajority(caucus, v) T = proj1(Hybridmjrty(caucus, v, n) HybridMajority1: LEMMA ....

Boyer, R. and Moore, J., "MJRTY---a fast majority vote algorithm," In Robert S. Boyer, volume 1 of Automated Reasoning Series, pp. 105--117. Kluwer, 1991.

....round. 18 value associated with each of them. The function maj returns the majority value if one exists; otherwise some functionally determined value. This behavior can either be specified axiomatically, or defined constructively using an algorithm such as Boyer and Moore s linear time MJRTY [4]. Thus, p s decision in the computation phase of the second round is represented by maj (rcvrs; q : send(1; send(0; v; T; q) q; p) where rcvrs is the set of all receiver processors. We can use this formula as the definition for a higher order function OM1(T; v) whose value is a function that ....

Robert S. Boyer and J Strother Moore. MJRTY---a fast majority vote algorithm. In Robert S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe, volume 1 of Automated Reasoning Series, pages 105--117. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1991.

.... qlast (l , r , lst) 5.6 The Boyer Moore Majority Voting Algorithm The last example in this chapter is the correctness proof of the object code of the following C program mjrty. This program implements the majority voting algorithm invented and mechanically proved correct by Boyer and Moore [10]. This small program can be used to determine if there is a candidate who has received a majority of votes cast in an election. a majority voting algorithm by Boyer and Moore #define YES 1 #define NO 0 struct winner int x; int y; struct winner mjrty (int a[ int n) int cand, i, k; ....

Robert S. Boyer and J Strother Moore. MJRTY - a fast majority vote algorithm. In Robert S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe, pages 105--117. Kluwer Academic, 1991.

.... had identified our mistake, we were able to repair it and to develop and formally verify a new and correct algorithm for Interactive Consistency under a hybrid fault model [41] 42] And this time, we did verify an implementation (a modified version of the Boyer Moore linear time MJRTY algorithm [43]) against our axioms for a hybrid majority voter [44] Overall, this work took less than two weeks, and was primarily undertaken by Pat Lincoln as his first exercise in mechanized formal verification using PVS. As with clock synchronization, availability of a formally verified algorithm for hybrid ....

Robert S. Boyer and J Strother Moore, "MJRTY---a fast majority vote algorithm", in Automated Reasoning: Essays in Honor of Woody Bledsoe, Robert S. Boyer, Ed., vol. 1 of Automated Reasoning Series, pp. 105--117. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1991.

....in the Appendix) The two axioms are stated in terms of the fault status of system components, a choice that simplifies their application here, but slightly complicates the provision of a model. We have separately verified that an implementation based on the efficient Boyer Moore MJRTY algorithm [3] satisfies these axioms [17] We now turn our attention to the main properties we would like to verify: Validity and Agreement. The following specification corresponds to the property Validity stated informally earlier. Validity Final : theorem gp(p) ap(G) num 2 Theta (japj jaij jspj ....

Robert S. Boyer and J Strother Moore. MJRTY--- a fast majority vote algorithm. In Robert S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe, volume 1 of Automated Reasoning Series, pages 105--117. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1991.

.... function j j; filters , which defines the function filter; card set , which supplies a set of lemmas regarding the previous two theories, such as a set is empty if and only if its cardinality is zero ; and hybrid mjrty, which defines and proves correct a version of the Boyer Moore MJRTY algorithm [2] that ignores error values (see [5] The first three of these four imported theories are from the prelude of standard theories. The OMH algorithm proceeds through a number of rounds counted by the natural numbers 0; 1; m; this range of numbers is specified as the type rounds , using ....

Robert S. Boyer and J Strother Moore. MJRTY---a fast majority vote algorithm. In Robert S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe, volume 1 of Automated Reasoning Series, pages 105--117. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1991.

....represent the primitive inference steps for disjunctive simplification and conjunctive splitting, respectively. 4 Experience and Prospects Only a few modest sized example verifications have so far been carried out using PVS; these include the correctness of the Boyer Moore majority algorithm [2], the proof that insertion into an ordered binary tree preserves order, the Oral Messages Algorithm for Byzantine Agreement [4] Cantor s theorem, the Schroder Bernstein theorem, and the equivalence of a pipelined and an unpipelined microprocessor design [7] All of these examples took on the ....

Robert S. Boyer and J Strother Moore. MJRTY---a fast majority vote algorithm. In Robert S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe, volume 1 of Automated Reasoning Series, pages 105--117. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1991.

....(1 qlast (l , r , lst ) 5. 6 The Boyer Moore Majority Voting Algorithm The last example in this chapter is the correctness proof of the object code of the following C program mjrty that implements the majority voting algorithm invented and mechanically proved correct by Boyer and Moore [10]. This small program can be used to determine if there is a candidate who has received a majority of votes cast in an election. a majority voting algorithm by Boyer and Moore #define YES 1 #define NO 0 struct winner int x; int y; struct winner mjrty (int a[ int n) int cand, i, k; ....

Robert S. Boyer and J Strother Moore. MJRTY - a fast majority vote algorithm. In Robert S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe, pages 105--117. Kluwer Academic, 1991. 696 697

....(1 qlast (l , r , lst ) 5. 6 The Boyer Moore Majority Voting Algorithm The last example in this chapter is the correctness proof of the object code of the following C program mjrty that implements the majority voting algorithm invented and mechanically proved correct by Boyer and Moore [10]. This small program can be used to determine if there is a candidate who has received a majority of votes cast in an election. a majority voting algorithm by Boyer and Moore #define YES 1 #define NO 0 struct winner int x; int y; struct winner mjrty (int a[ int n) int cand, i, k; ....

Robert S. Boyer and J Strother Moore. MJRTY - a fast majority vote algorithm. In Robert S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe, pages 105--117. Kluwer Academic, 1991. 696 697

.... for introducing concurrency into sorting networks [13] When connected to a verification condition generator for Fortran [5] the system has proved the correctness of Fortran implementations of the Boyer Moore fast string searching algorithm [4, 5] and Moore s linear time majority vote algorithm [6]. 6 2.3 An Interactive Enhancement to the Prover Also available for assistance in proving theorems stated in the Boyer Moore logic is an interactive interface to the prover written by Matt Kaufmann [12] The purpose of the interface is to give the user more precise control of the theorem prover ....

R. S. Boyer and J S. Moore. MJRTY - A Fast Majority Vote Algorithm. Tech. Rept. ICSCA-CMP-32, Institute for Computing Science and Computer Applications, University of Texas at Austin, 1982. Also available through Computational Logic, Inc., Suite 290, 1717 West Sixth Street, Austin, TX 78703..

....behind much automatic theoremproving research certainly ours is to mechanize the often mundane and tedious proofs arising in connection with computer programs. For example, our theorem prover has been used to prove thousands of theorems related to the correctness of various programs [4, 5], communications protocols [9] and computer security [10] Because of the high cost of bugs in software, the increasing impact of software due to cheap microprocessors, and the relatively shallow nature of most program correctness proofs, we expect to see, within the decade, commercial use of ....

R. S. Boyer and J S. Moore. MJRTY - A Fast Majority Vote Algorithm. Technical Report ICSCA-CMP-32, Institute for Computing Science and Computer Applications, University of Texas at Austin, 1982.

....g forces. Allowance for noise in the sensors can be handled by existing program verification technology. For example, if one provides redundant sensors and employs a signal select algorithm based on software majority voting, DELTAV can be rewritten to use an algorithm such as that verified in [8] to compute the majority sensor reading (if any) The proof that the vehicle stays on course can then be carried over directly if one is willing to assume that at each sampling interval a majority of the sensors agree. 9 However, the other two unrealistic aspects of our problem are more ....

R. S. Boyer and J S. Moore. MJRTY - A Fast Majority Vote Algorithm. Technical Report ICSCA-CMP-32, Institute for Computing Science and Computer Applications, University of Texas at Austin, 1982. Also available through Computational Logic, Inc., Suite 290, 1717 West Sixth Street, Austin, TX 78703..

....behind much automatic theorem proving research certainly ours is to mechanize the often mundane and tedious proofs arising in connection with computer programs. For example, our theorem prover has been used to prove thousands of theorems related to the correctness of various programs [4, 5], communications protocols [9] and computer security [10] Because of the high cost of bugs in software, the increasing impact of software due to cheap microprocessors, and the relatively shallow nature of most program correctness proofs, we expect to see, within the decade, commercial use of ....

R. S. Boyer and J S. Moore. MJRTY - A Fast Majority Vote Algorithm. Technical Report ICSCACMP -32, Institute for Computing Science and Computer Applications, University of Texas at Austin, 1982.

.... conditions for a Fortran implementation of the Boyer Moore fast string searching algorithm (Boyer and Moore, BGM90] fortran vcg isqrt.events ) proofs of the verification conditions for a Fortran implementation of the integer version of Newton s square root algorithm (Boyer and Moore, [BM91], fortran vcg mjrty.events ) proofs of the verification conditions for a Fortran implementation of a linear time majority vote algorithm (Hunt, Hun85] hunt fm8501.events ) formalizations of the machine code for the 16 bit FM8501 microprocessor, a register transfer model of a microcoded ....

R. S. Boyer and J S. Moore. MJRTY - A Fast Majority Vote Algorithm, pages 105--117. Automated Reasoning Series, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1991.

.... generated are proved by the Boyer Moore theorem prover [5] Among the FORTRAN programs proved correct mechanically by the above described system are a fast string searching algorithm [6] an integer square root algorithm using Newton s method [7] and a linear time majority vote algorithm [9]. These programs are each relatively small, requiring no more than a page of code. However, the correctness arguments are fairly deep. Two of the most widely known verification systems, the Stanford Verifier by David Luckham and his students at Stanford University and the Gypsy Verification ....

R. S. Boyer and J S. Moore. MJRTY - A Fast Majority Vote Algorithm. Technical Report ICSCACMP -32, Institute for Computing Science and Computer Applications, University of Texas at Austin, 1982.

....with Shankar s checking of the Church Rosser theorem. On pp. 4 9 of ACLH, we enumerate many other applications of NQTHM, including those in list processing, elementary number theory, metamathematics, set theory, and concurrent algorithms. Descriptions of some of these applications may be found in [16, 66, 12, 21, 17, 67, 68, 69, 20, 60, 28, 51, 37, 52, 13, 14, 15, 22, 77] and also in [1, 31, 32, 33, 40, 75, 3, 48, 44, 41, 42, 39, 45, 23, 24, 25] Recently colleagues of ours at Computational Logic, Inc. Bill Young and Bill Bevier, have used NQTHM to construct mechanically checked proofs of properties relating to faulttolerance. A key problem facing the designers ....

R. S. Boyer and J S. Moore. MJRTY - A Fast Majority Vote Algorithm. Technical Report ICSCA-CMP-32, Institute for Computing Science and Computer Applications, University of Texas at Austin, 1982.

No context found.

R. S. Boyer and J S. Moore. MJRTY - a fast majority vote algorithm. In R. S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe, volume 1 of Automated Reasoning, pages 105-117. Kluwer Academic Publishers, 1991.

No context found.

R. S. Boyer and J S. Moore. MJRTY - a fast majority vote algorithm. In R. S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe, volume 1 of Automated Reasoning, pages 105-117. Kluwer Academic Publishers, 1991.

No context found.

Robert S. Boyer and J Strother Moore. MJRTY---a fast majority vote algorithm. In Robert S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe, volume 1 of Automated Reasoning Series, pages 105--117. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1991.

No context found.

Robert S. Boyer and J Strother Moore. MJRTY---a fast majority vote algorithm. Technical Report 32, Institute for Computing Science, University of Texas, Austin TX, February 1981.

No context found.

Robert S. Boyer and J Strother Moore. MJRTY---a fast majority vote algorithm. Technical Report 32, Institute for Computing Science, University of Texas, Austin TX, February 1981.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC