메뉴 건너뛰기




Volumn , Issue , 2001, Pages 63-78

The maelstrom: Network service debugging via ''ineffective procedures''

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

EID: 85094588142     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (18)

References (28)
  • 1
    • 49549150925 scopus 로고
    • Short Permutation Strings
    • Adleman, L., ''Short Permutation Strings,'' Discrete Mathematics 10, pp. 197-200, 1974.
    • (1974) Discrete Mathematics , vol.10 , pp. 197-200
    • Adleman, L.1
  • 2
    • 0029311990 scopus 로고
    • A Site Configuration Engine
    • Burgess, M., ''A Site Configuration Engine,'' Computing Systems 8, 1995.
    • (1995) Computing Systems , vol.8
    • Burgess, M.1
  • 5
    • 49049133178 scopus 로고
    • A New Bound on the Length of the Shortest String Containing all r-Permutations
    • Cai, M., ''A New Bound on the Length of the Shortest String Containing all r-Permutations,'' Discrete Mathematics 39, 1982, pp. 329-330.
    • (1982) Discrete Mathematics , vol.39 , pp. 329-330
    • Cai, M.1
  • 7
    • 4444318715 scopus 로고    scopus 로고
    • SLINK: Simple, Effective Filesystem Maintenance Abstractions for Community-Based Administration
    • Couch, A., ''SLINK: Simple, Effective Filesystem Maintenance Abstractions for Community-Based Administration,'' Proc. Lisa-X, Usenix Assoc., 1996.
    • (1996) Proc. Lisa-X, Usenix Assoc
    • Couch, A.1
  • 8
    • 4444258498 scopus 로고    scopus 로고
    • Chaos Out of Order: A Simple, Scalable File Distribution Facility for 'Intentionally Heterogeneous' Networks
    • Couch, A., ''Chaos Out of Order: A Simple, Scalable File Distribution Facility for 'Intentionally Heterogeneous' Networks,'' Proc. LISA-XI, Usenix Assoc., 1997.
    • (1997) Proc. LISA-XI, Usenix Assoc
    • Couch, A.1
  • 9
    • 33750274774 scopus 로고    scopus 로고
    • It's Elementary, Dear Watson: Applying Logic Programming to Convergent System Management Processes
    • Couch, A., and M. Gilfix, ''It's Elementary, Dear Watson: Applying Logic Programming to Convergent System Management Processes,'' Proc. Lisa-XIII, Usenix Assoc., 1999.
    • (1999) Proc. Lisa-XIII, Usenix Assoc
    • Couch, A.1    Gilfix, M.2
  • 11
    • 0028532451 scopus 로고
    • Application and Experimental Evaluation of State Space Reduction Methods for Deadlock Analysis in Ada
    • ACM Press
    • Duri, S., U. Buy, R. Devarapalli, and S. M. Shatz, ''Application and Experimental Evaluation of State Space Reduction Methods for Deadlock Analysis in Ada,'' ACM Transactions on Software Engineering and Methodology, Vol. 3, No. 4, ACM Press, 1994.
    • (1994) ACM Transactions on Software Engineering and Methodology , vol.3 , Issue.4
    • Duri, S.1    Buy, U.2    Devarapalli, R.3    Shatz, S. M.4
  • 14
    • 85094898480 scopus 로고    scopus 로고
    • Peep (The Network Auralizer): Monitoring Your Network with Sound
    • Gilfix, M., and A. Couch, ''Peep (The Network Auralizer): Monitoring Your Network with Sound,'' Proc. LISA-XIV, Usenix Assoc., 2000.
    • (2000) Proc. LISA-XIV, Usenix Assoc
    • Gilfix, M.1    Couch, A.2
  • 17
    • 4444344569 scopus 로고    scopus 로고
    • The Arusha Project: A Framework for Collaborative Unix System Administration
    • San Diego CA
    • Holgate, Matt, and Will Partain, ''The Arusha Project: A Framework for Collaborative Unix System Administration,'' Proc. LISA XV, USENIX Assoc., San Diego CA, 2001.
    • (2001) Proc. LISA XV, USENIX Assoc
    • Holgate, Matt1    Partain, Will2
  • 19
    • 0013087076 scopus 로고
    • A Lower Bound on the Length of a Sequence Containing All Permutations as Subsequences
    • Kleitman, D. J., and D. J. Kwiatkowski, ''A Lower Bound on the Length of a Sequence Containing All Permutations as Subsequences,'' Journal of Combinatorial Theory (A) 21, pp. 129-136, 1976.
    • (1976) Journal of Combinatorial Theory (A) , vol.21 , pp. 129-136
    • Kleitman, D. J.1    Kwiatkowski, D. J.2
  • 22
    • 0001892939 scopus 로고
    • Shortest String Containing All Permutations
    • Mohanty, S. P., ''Shortest String Containing All Permutations,'' Discrete Mathematics, Vol. 31, pp. 91-95, 1980.
    • (1980) Discrete Mathematics , vol.31 , pp. 91-95
    • Mohanty, S. P.1
  • 25
    • 84884897906 scopus 로고    scopus 로고
    • Scheduling Partially Ordered events in a Randomised Framework - Empirical Results and Implications for Automatic Configuration Management
    • San Diego CA
    • Sandnes, Frode Eika, ''Scheduling Partially Ordered events in a Randomised Framework - Empirical Results and Implications for Automatic Configuration Management,'' Proc. LISA XV, USENIX Assoc., San Diego CA, 2001.
    • (2001) Proc. LISA XV, USENIX Assoc
    • Sandnes, Frode Eika1
  • 26
    • 0013131038 scopus 로고
    • Short Strings Containing All k-Element Permutations
    • Savage, C., ''Short Strings Containing All k-Element Permutations,'' Discrete Mathematics, Vol. 42, pp. 281-285, 1982.
    • (1982) Discrete Mathematics , vol.42 , pp. 281-285
    • Savage, C.1
  • 27
    • 45949115548 scopus 로고
    • ''Shortest Prefix Strings Containing All Subset Permutations,''
    • Schaffer, A. A., ''Shortest Prefix Strings Containing All Subset Permutations,'' Discrete Mathematics, Vol. 64, pp. 239-252, 1987
    • (1987) Discrete Mathematics , vol.64 , pp. 239-252
    • Schaffer, A. A.1


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