V. K. Garg. Observation and control for debugging distributed computations. In Proceedings of the Third International Workshop on Automated Debugging, pages 112, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Reflection and Debug for CORBA Applications - Duchien, Seinturier (Correct)
....order is a semantic order, and (2) its observation is performed transparently with a reflective language. Several extensions can be considered for this work. First, from the traces, some algorithms could be added to check global predicates (with techniques described for instance in [CG98] and [Gar97]) Second, some tools could be developed to filter and to analyze more precisely the traces. ....
V.K. Garg. Observation and control for debugging distributed computations. In Proceedings of the 3rd Intl Workshop on Automated and Algorithmic Debugging (AADEBUG'97), 1997.
Reflection and Debug for CORBA Applications - Laurence Duchien Lionel (Correct)
....order is a semantic order, and (2) its observation is performed transparently with a reflective language. Several extensions can be considered for this work. First, from the traces, some algorithms could be added to check global predicates (with techniques described for instance in [CG98] and [Gar97]) Second, some tools could be developed to filter and to analyze more precisely the traces. ....
V.K. Garg. Observation and control for debugging distributed computations. In Proceedings of the 3rd Intl Workshop on Automated and Algorithmic Debugging (AADEBUG'97), 1997.
On Detecting Global Predicates in Distributed Computations - Mittal, Garg (2001) (2 citations) Self-citation (Garg) (Correct)
....such as absence of simple majority and exclusive or of local predicates can now be detected. Additionally, the problem is proved to be NP complete if each x i can be changed by an arbitrary amount at each step. Our results solve the previously open problems in predicate detection proposed in [7] and bridge the gap between the known tractability and intractability results. 1. Introduction Correct non trivial distributed programs are hard to write. Testing and debugging is an important and feasible way to ensure their reliability and dependability. To that end, predicate detection ....
....predicate Figure 1. Known results in predicate detection. all receive events on every process are totally ordered or all send events on every process are totally ordered. Our contributions in this paper are as follows. We solve the previously open problems in predicate detection proposed in [7]. In Section 3, we establish that the problem of determining whether there exists a consistent cut of a computation that satisfies a predicate in k CNF such that no two clauses contain variables from the same process, called singular k CNF predicate, is NP complete in general when k is at least ....
[Article contains additional citation context not shown here]
V. K. Garg. Observation and Control for Debugging Distributed Computations. In Proceedings of the International Workshop on Automated Debugging (AADEBUG), pages 1-- 12, Linkoping, Sweden, 1997. Keynote Presentation.
On Detecting Global Predicates in Distributed Computations - Mittal, Garg (2001) (2 citations) Self-citation (Garg) (Correct)
....such as absence of simple majority and exclusive or of local predicates can now be detected. Additionally, the problem is proved to be NP complete if each x i can be changed by an arbitrary amount at each step. Our results solve the previously open problems in predicate detection proposed in [7] and bridge the wide gap between the known tractability and intractability results that existed until now. 1. Introduction Correct non trivial distributed programs are hard to write. Testing and debugging is an important and feasible supported in part by the NSF Grants ECS 9907213, ....
....solve the problem efficiently for special cases when either all receive events on every process are totally ordered or all send events on every process are totally ordered. Our contributions in this paper are as follows. We solve the previously open problems in predicate detection proposed in [7]. In Section 3, we establish that the problem of determining whether there exists a consistent cut of a computation that satisfies a predicate in k CNF such that no two clauses contain variables from the same process, called singular k CNF predicate, is NP complete in general when k is at least 2. ....
[Article contains additional citation context not shown here]
V. K. Garg. Observation and Control for Debugging Distributed Computations. In Proceedings of the International Workshop on Automated Debugging (AADEBUG), pages 1-- 12, Linkoping, Sweden, 1997. Keynote Presentation.
Tracing System-Level Communication in Distributed Systems - Mann, Kondorosi (2004) (Correct)
No context found.
V. K. Garg. Observation and control for debugging distributed computations. In Proceedings of the Third International Workshop on Automated Debugging, pages 112, 1997.
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