메뉴 건너뛰기




Volumn 5, Issue 3, 1994, Pages 299-307

Detection of Weak Unstable Predicates in Distributed Programs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER DEBUGGING; COMPUTER NETWORKS; COMPUTER SYSTEM RECOVERY; ERROR DETECTION; FORMAL LOGIC; PROGRAM DEBUGGING; STABILITY; UNIX; VECTORS;

EID: 0028400577     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.277788     Document Type: Article
Times cited : (115)

References (25)
  • 1
    • 0024136681 scopus 로고
    • Distributed debugging tools for heterogeneous distributed systems
    • P. Bates, “Distributed debugging tools for heterogeneous distributed systems,” Proc. 8th Int. Conf. Distrib. Computing Syst., 1988, pp. 308–315.
    • (1988) Proc. 8th Int. Conf. Distrib. Computing Syst , pp. 308-315
    • Bates, P.1
  • 2
    • 0022282104 scopus 로고
    • Repeated snapshots in distributed systems with synchronous communication and their implementation in CSP
    • L. Bouge, “Repeated snapshots in distributed systems with synchronous communication and their implementation in CSP,” Theoretical Comput. Sci., vol. 49, pp. 145–169, 1987.
    • (1987) Theoretical Comput. Sci , vol.49 , pp. 145-169
    • Bouge, L.1
  • 3
    • 0022020346 scopus 로고
    • Distributed snapshots: Determining global states of distributed systems
    • Feb
    • K. M. Chandy and L. Lamport, “Distributed snapshots: Determining global states of distributed systems,” ACM Trans. Comput. Syst., vol. 3, no. 1, pp. 63–75, Feb. 1985.
    • (1985) ACM Trans. Comput. Syst , vol.3 , Issue.1 , pp. 63-75
    • Chandy, K.M.1    Lamport, L.2
  • 8
    • 0027116164 scopus 로고
    • Some optimal algorithms for decomposed partially ordered sets
    • Nov
    • V. K. Garg, “Some optimal algorithms for decomposed partially ordered sets,” Information Processing Lett., vol. 44, pp. 39–43, Nov. 1992.
    • (1992) Information Processing Lett , vol.44 , pp. 39-43
    • Garg, V.K.1
  • 9
    • 0026851035 scopus 로고
    • Concurrent regular expressions and their relationship to petri net languages
    • V.K. Garg and M.T. Raghunath, “Concurrent regular expressions and their relationship to petri net languages ” Theoretical Comput. Sci., vol. 96, pp. 285–304, 1992.
    • (1992) Theoretical Comput. Sci , vol.96 , pp. 285-304
    • Garg, V.K.1    Raghunath, M.T.2
  • 10
    • 80053238417 scopus 로고
    • Detection of unstable predicate in distributed programs
    • Lecture Notes in Computer Science 652. New York: Springer-Verlag
    • V.K. Garg and B. Waldecker, “Detection of unstable predicate in distributed programs,” Proc. 12th Conf. Foundations of Software Tech. & Theoretical Comput. Sci., Lecture Notes in Computer Science 652. New York: Springer-Verlag, 1992, pp. 253–264.
    • (1992) Proc. 12th Conf. Foundations of Software Tech. & Theoretical Comput. Sci , pp. 253-264
    • Garg, V.K.1    Waldecker, B.2
  • 11
    • 0023826154 scopus 로고
    • Global events and global breakpoints in distributed systems
    • Jan
    • D. Haban and W. Weigel, “Global events and global breakpoints in distributed systems,” Proc. 21st Int. Conf. Syst. Sci., vol. 2, pp. 166–175, Jan. 1988.
    • (1988) Proc. 21st Int. Conf. Syst. Sci , vol.2 , pp. 166-175
    • Haban, D.1    Weigel, W.2
  • 15
    • 0003423423 scopus 로고    scopus 로고
    • Database System Concepts
    • New York: McGraw-Hill
    • H. Korth and A. Silberschatz, Database System Concepts, New York: McGraw-Hill, 1986.
    • Korth, H.1    Silberschatz, A.2
  • 16
    • 0017996760 scopus 로고
    • Time, clocks and the ordering of events in a distributed system
    • July
    • L. Lamport, “Time, clocks and the ordering of events in a distributed system,” Communic. ACM, vol. 21, no. 7, pp. 558–565, July 1978.
    • (1978) Communic. ACM , vol.21 , Issue.7 , pp. 558-565
    • Lamport, L.1
  • 18
    • 0024877192 scopus 로고
    • Debugging concurrent programs
    • Dec
    • C. E. McDowell and D. P. Helmbold, “Debugging concurrent programs,” ACM Computing Surv., vol. 21, pp. 593–622, Dec. 1989.
    • (1989) ACM Computing Surv , vol.21 , pp. 593-622
    • McDowell, C.E.1    Helmbold, D.P.2
  • 21
    • 0022092438 scopus 로고
    • The complexity of propositional linear temporal logic
    • A.P. Sistla and E.M. Clarke, “The complexity of propositional linear temporal logic,” J. ACM, vol. 32, no. 3, pp. 733–749, 1985.
    • (1985) J. ACM , vol.32 , Issue.3 , pp. 733-749
    • Sistla, A.P.1    Clarke, E.M.2
  • 23
    • 0024136011 scopus 로고
    • A general approach to recognizing event occurrences in distributed computations
    • M. Spezialetti and P. Kearns, “A general approach to recognizing event occurrences in distributed computations,” Proc. 9th Int. Conf Distrib. Computing Syst., 1988, pp. 300–307.
    • (1988) Proc. 9th Int. Conf Distrib. Computing Syst , pp. 300-307
    • Spezialetti, M.1    Kearns, P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.