| S. D. Stoller and F. B. Schneider. Automated analysis of fault-tolerance in distributed systems. In Proc. First ACM SIGPLAN Workshop on Automated Analysis of Software, pages 33--44, 1997. |
....to reach these states. Notice that the use of temporal logic relations is not indispensable for modeling the temporal precedence of the predicate. Indeed, means have been invented like history lists, which are employed by a number of approaches (e.g. see (Chrysanthis and Ramamritham 1994) and (Stoller and Schneider 1996)) in order to avoid temporal relations for ordering the occurrences of events in a system and to remain purely first order logic. However, we use them because we believe that they render the formulas more legible. The formal framework we use is presented hereafter, followed by our approach to the ....
Stoller S. D. and Schneider F. B. (1996) Automated Analysis of Fault-Tolerance in Distributed Systems. Technical Report No.14853, Department of Computer Science, Cornell University, Ithaca, NY, USA.
....a partial order in which predicates are veri ed. Notice that the use of temporal logic relations is not indispensable for modeling the temporal precedence of the predicate. Indeed, means have been invented like history lists, which are employed by a number of approaches (e.g. see [15] and [71]) in order to avoid temporal relations for ordering the occurrences of events in a system and to remain purely rst order logic. However, the author believes that temporal operators render the formulas more legible. The remainder of this section is structured as follows. First the mathematical ....
S. D. Stoller and F. B. Schneider. Automated Analysis of Fault-Tolerance in Distributed Systems. Technical Report TR 96-1614, Department of Computer Science Cornell University, Ithaca, New York 14853, November 1996.
....data. Thus, we define Mul AMul) # , where the set AMul AVal of abstract multiplicities contains abstract values whose meanings are subsets of the natural numbers, excluding and 0 . The symbolic values in multiplicities are useful for e#cient analysis of systems with crash failures [SS97]. Abstract multiplicities are analogous to superscripts in regular expressions. To promote the resemblance, we assume AVal contains the following: 1, denoting 1 ; denoting 0, 1 ; denoting the set of positive natural numbers; and #, denoting the set of natural numbers. The notational ....
S. D. Stoller and F. B. Schneider. Automated analysis of fault-tolerance in distributed systems. In Proc. First ACM SIGPLAN Workshop on Automated Analysis of Software, pages 33--44, 1997.
....Mul Delta = Set(SVal Theta AMul) n f;g; where the set AMul AVal of abstract multiplicities contains abstract values whose meanings are subsets of the natural numbers, excluding ; and f0g. The symbolic values in multiplicities are useful for efficient analysis of systems with crash failures [SS97]. Abstract multiplicities are analogous to superscripts in regular expressions. To promote the resemblance, we assume AVal contains the following: 1, denoting f1g; denoting f0; 1g; denoting the set of positive natural numbers; and , denoting the set of natural numbers. The notational ....
S. D. Stoller and F. B. Schneider. Automated analysis of fault-tolerance in distributed systems. In Proc. First ACM SIGPLAN Workshop on Automated Analysis of Software, pages 33--44, 1997. Available via http://www.cs.indiana.edu/~stoller/ .
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