Matches in SemOpenAlex for { <https://semopenalex.org/work/W2006383766> ?p ?o ?g. }
Showing items 1 to 96 of
96
with 100 items per page.
- W2006383766 endingPage "332" @default.
- W2006383766 startingPage "305" @default.
- W2006383766 abstract "It is generally assumed that formal proofs of programs are considerably longer and more tedious than their informal counterparts. Informal proofs employ a form of common sense reasoning whereby “obvious” facts are often omitted and the proof steps rely upon the intuition of the reader. Typically informal proofs are operational; arguments consist of the properties of program executions as they unfold over time. Our goal in this paper is to suggest, by means of an example, that formal proofs can be made as concise as the informal ones. This argument rests upon two observations: (1) informal proofs tend to be long and difficult (in addition to being error-prone) when there are many interleaved execution sequences to consider, as is the case in multiprocess programs, and (2) formal proofs can be made concise by employing a logic that is appropriate for the problem domain and whose operators possess a number of useful properties that can be exploited in proofs. In recent years, we have developed a programming and proof theory, called UNITY, Chandy and Misra [1988]. Our experience in using the UNITY proof theory on a wide range of problems has led us to believe that formal proofs need not be outrageously long or tedious. In this paper, we apply the UNITY proof theory to a problem in distributed computing—termination detection. We specify the problem and develop a correctness proof of a solution without relying upon the operational aspects of program execution. Use of our logic allows us to eliminate arguments about a program’s execution sequences. We believe strongly that formal proofs cannot be made concise as long as they mimic the arguments in the informal proofs. Most of this paper is about UNITY theory and specification of message communicating processes; only sections 4 and 6 contain the proof of the termination detection algorithm. The paper is selfcontained: no familiarity with UNITY or termination detection is assumed." @default.
- W2006383766 created "2016-06-24" @default.
- W2006383766 creator A5033569113 @default.
- W2006383766 creator A5062846068 @default.
- W2006383766 date "1991-03-01" @default.
- W2006383766 modified "2023-09-23" @default.
- W2006383766 title "Proof of distributed algorithms: an exercise" @default.
- W2006383766 cites W1857327297 @default.
- W2006383766 cites W1964727056 @default.
- W2006383766 cites W1982568673 @default.
- W2006383766 cites W2103953153 @default.
- W2006383766 cites W2118900647 @default.
- W2006383766 cites W2166656159 @default.
- W2006383766 cites W2477142793 @default.
- W2006383766 cites W2479293983 @default.
- W2006383766 cites W3146075203 @default.
- W2006383766 hasPublicationYear "1991" @default.
- W2006383766 type Work @default.
- W2006383766 sameAs 2006383766 @default.
- W2006383766 citedByCount "4" @default.
- W2006383766 crossrefType "book" @default.
- W2006383766 hasAuthorship W2006383766A5033569113 @default.
- W2006383766 hasAuthorship W2006383766A5062846068 @default.
- W2006383766 hasConcept C105605280 @default.
- W2006383766 hasConcept C108710211 @default.
- W2006383766 hasConcept C111472728 @default.
- W2006383766 hasConcept C11413529 @default.
- W2006383766 hasConcept C132010649 @default.
- W2006383766 hasConcept C138885662 @default.
- W2006383766 hasConcept C185592680 @default.
- W2006383766 hasConcept C195653647 @default.
- W2006383766 hasConcept C199343813 @default.
- W2006383766 hasConcept C199360897 @default.
- W2006383766 hasConcept C203265346 @default.
- W2006383766 hasConcept C2318724 @default.
- W2006383766 hasConcept C2524010 @default.
- W2006383766 hasConcept C2777686260 @default.
- W2006383766 hasConcept C33923547 @default.
- W2006383766 hasConcept C41008148 @default.
- W2006383766 hasConcept C55439883 @default.
- W2006383766 hasConcept C55493867 @default.
- W2006383766 hasConcept C71924100 @default.
- W2006383766 hasConcept C80444323 @default.
- W2006383766 hasConcept C94461902 @default.
- W2006383766 hasConcept C98184364 @default.
- W2006383766 hasConceptScore W2006383766C105605280 @default.
- W2006383766 hasConceptScore W2006383766C108710211 @default.
- W2006383766 hasConceptScore W2006383766C111472728 @default.
- W2006383766 hasConceptScore W2006383766C11413529 @default.
- W2006383766 hasConceptScore W2006383766C132010649 @default.
- W2006383766 hasConceptScore W2006383766C138885662 @default.
- W2006383766 hasConceptScore W2006383766C185592680 @default.
- W2006383766 hasConceptScore W2006383766C195653647 @default.
- W2006383766 hasConceptScore W2006383766C199343813 @default.
- W2006383766 hasConceptScore W2006383766C199360897 @default.
- W2006383766 hasConceptScore W2006383766C203265346 @default.
- W2006383766 hasConceptScore W2006383766C2318724 @default.
- W2006383766 hasConceptScore W2006383766C2524010 @default.
- W2006383766 hasConceptScore W2006383766C2777686260 @default.
- W2006383766 hasConceptScore W2006383766C33923547 @default.
- W2006383766 hasConceptScore W2006383766C41008148 @default.
- W2006383766 hasConceptScore W2006383766C55439883 @default.
- W2006383766 hasConceptScore W2006383766C55493867 @default.
- W2006383766 hasConceptScore W2006383766C71924100 @default.
- W2006383766 hasConceptScore W2006383766C80444323 @default.
- W2006383766 hasConceptScore W2006383766C94461902 @default.
- W2006383766 hasConceptScore W2006383766C98184364 @default.
- W2006383766 hasLocation W20063837661 @default.
- W2006383766 hasOpenAccess W2006383766 @default.
- W2006383766 hasPrimaryLocation W20063837661 @default.
- W2006383766 hasRelatedWork W1494663138 @default.
- W2006383766 hasRelatedWork W1541634856 @default.
- W2006383766 hasRelatedWork W1608219313 @default.
- W2006383766 hasRelatedWork W1857327297 @default.
- W2006383766 hasRelatedWork W2003553652 @default.
- W2006383766 hasRelatedWork W2022394930 @default.
- W2006383766 hasRelatedWork W2163019390 @default.
- W2006383766 hasRelatedWork W2276270716 @default.
- W2006383766 hasRelatedWork W2509920464 @default.
- W2006383766 hasRelatedWork W2625847401 @default.
- W2006383766 hasRelatedWork W2690247432 @default.
- W2006383766 hasRelatedWork W2729688257 @default.
- W2006383766 hasRelatedWork W2741692070 @default.
- W2006383766 hasRelatedWork W2808563004 @default.
- W2006383766 hasRelatedWork W2898766805 @default.
- W2006383766 hasRelatedWork W2987633325 @default.
- W2006383766 hasRelatedWork W2998420931 @default.
- W2006383766 hasRelatedWork W3122106493 @default.
- W2006383766 hasRelatedWork W3185279362 @default.
- W2006383766 hasRelatedWork W47204537 @default.
- W2006383766 isParatext "false" @default.
- W2006383766 isRetracted "false" @default.
- W2006383766 magId "2006383766" @default.
- W2006383766 workType "book" @default.