H. Gaifman, M. J. Maher, and E. Shapiro. Replay, recovery, replication and snapshot of nondeterministic concurrent programs. Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, 76100, Israel, July 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Loosely-Coupled Processes - Jayadev Misra Department (1991) (5 citations) (Correct)
....which the writer, reader act as producer, consumer. Unlike logic variables, such shared variables may be assigned value more than once. Processes employing such shared variables where each variable is shared between two processes only can be shown to be loosely coupled. Gaifman, Maher and Shapiro [6] have observed that by restricting the updates of the common store to be monotonic, nondeterministic computations can be replayed efficiently, for the purposes of debugging and recovery. They also propose an easy solution to the snapshot problem for such programs. Steele [13] has argued that ....
H. Gaifman, M. J. Maher, and E. Shapiro. Replay, recovery, replication and snapshot of nondeterministic concurrent programs. Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, 76100, Israel, July 1990.
Oracle Semantics for Prolog - Barbuti, Codish, al. (1992) (9 citations) (Correct)
....The first shows that variable names are not significant. Proposition 4.1 ( congruence) Let f be a downward closed oracle for a program. Then, for any interpretation I and goals G; G 0 : G G 0 ) f(I ; G) f(I ; G 0 ) The following property is similar to properties of stability [Gaifman, Maher and Shapiro 91] and monotonicity [Saraswat, Weinbaum, Kahn and Shapiro 88] in relation to concurrent languages. Proposition 4.2. Let P be a program and f be a downward closed oracle for P . If G f Gamma P G 0 with associated substitution #, then G# f Gamma P G 00 and G 00 G 0 ....
H. Gaifman, M. J. Maher and E. Shapiro. Replay, Recovery, Replication and Snapshots of Nondeterministic Concurrent Programs, Proceedings of the ACM Symposium on Principles of Distributed Computation, 1991.
Oracle Semantics for Prolog - Barbuti, Codish (1992) (9 citations) (Correct)
....The first shows that variable names are not significant. Proposition 4.1 ( congruence) Let f be a downward closed oracle for a program. Then, for any interpretation I and goals G; G 0 : G G 0 ) f(I ; G) f(I ; G 0 ) The following property is similar to properties of stability [Gaifman, Maher and Shapiro 91] and monotonicity [Saraswat, Weinbaum, Kahn and Shapiro 88] in relation to concurrent languages. Proposition 4.2. Let P be a program and f be a downward closed oracle for P . If G f 0 3 P G 0 with associated substitution #, then G# f 0 3 P G 00 and G 00 G 0 . The ....
H. Gaifman, M.J. Maher and E. Shapiro, Replay, Recovery, Replication and Snapshots of Nondeterministic Concurrent Programs, Proceedings of the ACM Symposium on Principles of Distributed Computation, 1991.
Constraint Logic Programming: A Survey - Jaffar, Maher (1994) (359 citations) Self-citation (Maher) (Correct)
....to be rewritten simultaneously in an execution environment with concurrency. The above semantics only allows rewritings to be interleaved. A true concurrency semantics, based on graph rewriting, is given in [191] All ask tell CCLP programs have the following monotonicity [216] or stability [96] property: If hA; Ci r hA 0 ; C 0 i and D j= C 00 C 0 then hA; C 00 i r hA 0 ; C 00 i. This property provides for simple solutions to some problems in distributed computing related to reliability. When looked at in a more general framework [96] stability seems to be one ....
....monotonicity [216] or stability [96] property: If hA; Ci r hA 0 ; C 0 i and D j= C 00 C 0 then hA; C 00 i r hA 0 ; C 00 i. This property provides for simple solutions to some problems in distributed computing related to reliability. When looked at in a more general framework [96], stability seems to be one advantage of CCLP languages over other languages; most programs in conventional languages for concurrency are not stable. It is interesting to note that a notion of global failure (as represented in Section 5 by the state fail) destroys stability. Of course, there are ....
H. Gaifman, M.J. Maher & E. Shapiro, Replay, Recovery, Replication and Snapshots of Nondeterministic Concurrent Programs, Proc. 10th. ACM Symposium on Principles of Distributed Computation, 1991.
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