메뉴 건너뛰기




Volumn , Issue CONFCODENUMBER, 2014, Pages 468-478

Inferring models of concurrent systems from logs of their behavior with CSight

Author keywords

concurrency; CSight; distributed systems; log analysis; Model inference

Indexed keywords

SOFTWARE ENGINEERING;

EID: 84993661835     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2568225.2568246     Document Type: Conference Paper
Times cited : (173)

References (59)
  • 5
    • 71049171650 scopus 로고
    • Finding patterns common to a set of strings
    • Dana Angluin. Finding Patterns Common to a Set of Strings. Journal of Computer and System Sciences, 21 (1): 46-62, 1980.
    • (1980) Journal of Computer and System Sciences , vol.21 , Issue.1 , pp. 46-62
    • Angluin, D.1
  • 11
    • 84938806379 scopus 로고
    • On the synthesis of finite-state machines from samples of their behavior
    • June
    • Alan W. Biermann and Jerome A. Feldman. On the synthesis of finite-state machines from samples of their behavior. IEEE Transactions on Computers (TC), 21 (6): 592-597, June 1972.
    • (1972) IEEE Transactions on Computers (TC) , vol.21 , Issue.6 , pp. 592-597
    • Biermann, A.W.1    Feldman, J.A.2
  • 12
    • 0016521417 scopus 로고
    • Toward a mathematical theory of inductive inference
    • Lenore Blum and Manuel Blum. Toward a Mathematical Theory of Inductive Inference. Information and Control, 28 (2): 125-155, 1975.
    • (1975) Information and Control , vol.28 , Issue.2 , pp. 125-155
    • Blum, L.1    Blum, M.2
  • 14
    • 0020735797 scopus 로고
    • On communicating finite-state machines
    • April
    • Daniel Brand and Pitro Zafiropulo. On Communicating Finite-State Machines. Journal of the ACM, 30 (2): 323-342, April 1983.
    • (1983) Journal of the ACM , vol.30 , Issue.2 , pp. 323-342
    • Brand, D.1    Zafiropulo, P.2
  • 15
    • 0036236516 scopus 로고    scopus 로고
    • Construction of deadlock-free designs of communication protocols from observations
    • January
    • Xiao J. Chen and Hasan Ural. Construction of Deadlock-free Designs of Communication Protocols from Observations. The Computer Journal, 45 (2): 162-173, January 2002.
    • (2002) The Computer Journal , vol.45 , Issue.2 , pp. 162-173
    • Chen, X.J.1    Ural, H.2
  • 17
    • 0348230609 scopus 로고    scopus 로고
    • Discovering models of behavior for concurrent workflows
    • Jonathan E. Cook, Zhidian Du, Chongbing Liu, and Alexander L. Wolf. Discovering models of behavior for concurrent workflows. Computers in Industry, 53 (3): 297-319, 2004.
    • (2004) Computers in Industry , vol.53 , Issue.3 , pp. 297-319
    • Cook, J.E.1    Du, Z.2    Liu, C.3    Wolf, A.L.4
  • 25
    • 0023833640 scopus 로고
    • Timestamps in message-passing systems that preserve the partial ordering
    • University of Queensland, Australia
    • Colin J. Fidge. Timestamps in Message-Passing Systems that Preserve the Partial Ordering. In the Australian Computer Science Conference, pages 55-66, University of Queensland, Australia, 1988.
    • (1988) The Australian Computer Science Conference , pp. 55-66
    • Fidge, C.J.1
  • 30
    • 49949150022 scopus 로고
    • Language identification in the limit
    • E. Mark Gold. Language Identification in the Limit. Information and Control, 10 (5): 447-474, 1967.
    • (1967) Information and Control , vol.10 , Issue.5 , pp. 447-474
    • Mark Gold, E.1
  • 31
  • 39
    • 0017996760 scopus 로고
    • Time, clocks, and the ordering of events in a distributed system
    • July
    • Leslie Lamport. Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM, 21 (7): 558-565, July 1978.
    • (1978) Communications of the ACM , vol.21 , Issue.7 , pp. 558-565
    • Lamport, L.1
  • 40
    • 20344376607 scopus 로고    scopus 로고
    • Improving the adaptability of multi-mode systems via program steering
    • Boston, MA, USA
    • Lee Lin and Michael D. Ernst. Improving the Adaptability of Multi-mode Systems via Program Steering. In the International Symposium on Software Testing and Analysis, pages 206-216, Boston, MA, USA, 2004.
    • (2004) The International Symposium on Software Testing and Analysis , pp. 206-216
    • Lin, L.1    Ernst, M.D.2
  • 48
    • 0027353425 scopus 로고
    • The minimum consistent dfa problem cannot be approximated within any polynomial
    • Leonard Pitt and Manfred K. Warmuth. The Minimum Consistent DFA Problem Cannot be Approximated Within any Polynomial. Journal of the ACM, 40 (1): 95-142, 1993.
    • (1993) Journal of the ACM , vol.40 , Issue.1 , pp. 95-142
    • Pitt, L.1    Warmuth, M.K.2
  • 51
    • 0030832833 scopus 로고    scopus 로고
    • Dummynet: A simple approach to the evaluation of network protocols
    • January
    • Luigi Rizzo. Dummynet: a Simple Approach to the Evaluation of Network Protocols. Computer Communication Review (CCR), 27 (1): 31-41, January 1997.
    • (1997) Computer Communication Review (CCR) , vol.27 , Issue.1 , pp. 31-41
    • Rizzo, L.1
  • 56
    • 84994117018 scopus 로고    scopus 로고
    • Voldemort. http: //project-voldemort. com, 2013.
    • (2013)


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