Inferring Models of Concurrent Systems from Logs of Their Behavior with CSight

被引:110
|
作者
Beschastnikh, Ivan [1 ]
Brun, Yuriy [2 ]
Ernst, Michael D. [3 ]
Krishnamurthy, Arvind [3 ]
机构
[1] Univ British Columbia, Dept Comp Sci, Vancouver, BC, Canada
[2] Univ Massachusetts, Sch Comp Sci, Amherst, MA 01003 USA
[3] Univ Washington, Comp Sci & Engn, Seattle, WA 98195 USA
关键词
Model inference; log analysis; concurrency; distributed systems; CSight;
D O I
10.1145/2568225.2568246
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Concurrent systems are notoriously difficult to debug and understand. A common way of gaining insight into system behavior is to inspect execution logs and documentation. Unfortunately, manual inspection of logs is an arduous process, and documentation is often incomplete and out of sync with the implementation. To provide developers with more insight into concurrent systems, we developed CSight. CSight mines logs of a system's executions to infer a concise and accurate model of that system's behavior, in the form of a communicating finite state machine (CFSM). Engineers can use the inferred CFSM model to understand complex behavior, detect anomalies, debug, and increase confidence in the correctness of their implementations. CSight's only requirement is that the logged events have vector timestamps. We provide a tool that automatically adds vector timestamps to system logs. Our tool prototypes are available at http://synoptic.googlecode.com/. This paper presents algorithms for inferring CFSM models from traces of concurrent systems, proves them correct, provides an implementation, and evaluates the implementation in two ways: by running it on logs from three different networked systems and via a user study that focused on bug finding. Our evaluation finds that CSight infers accurate models that can help developers find bugs.
引用
收藏
页码:468 / 479
页数:12
相关论文
共 50 条
  • [31] Inferring balking behavior from transactional data
    Jones, LK
    OPERATIONS RESEARCH, 1999, 47 (05) : 778 - 784
  • [32] Inferring individual rules from collective behavior
    Lukeman, Ryan
    Li, Yue-Xian
    Edelstein-Keshet, Leah
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2010, 107 (28) : 12576 - 12580
  • [33] Inferring balking behavior from transactional data
    Department of Mathematical Sciences, University of Massachusetts, Lowell, MA 01854, United States
    Oper Res, 5 (778-784):
  • [34] Inferring Trader's Behavior from Prices
    Charbonneau, Louis
    Kharma, Nawwaf
    NATURAL COMPUTING IN COMPUTATIONAL FINANCE, VOL 3, 2010, 293 : 85 - +
  • [35] Compact and efficiently verifiable models for concurrent systems
    Hernán Ponce de León
    Andrey Mokhov
    Formal Methods in System Design, 2018, 53 : 407 - 431
  • [36] Automated Discovery of Concurrent Models of Decision-Making Systems from Data
    Suraj, Zbigniew
    Grochowalski, Piotr
    Drygas, Pawel
    COMPUTATIONAL SCIENCE, ICCS 2024, PT II, 2024, 14833 : 219 - 234
  • [37] Compact and efficiently verifiable models for concurrent systems
    de Leon, Hernan Ponce
    Mokhov, Andrey
    FORMAL METHODS IN SYSTEM DESIGN, 2018, 53 (03) : 407 - 431
  • [38] ON ONE APPROACH TO THE ANALYSIS OF CONCURRENT SYSTEMS BEHAVIOR
    NOVIKOV, JA
    AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1992, (04): : 12 - 19
  • [40] Analysis of the behavior of concurrent systems in different environments
    Petrenko, A
    Ulrich, A
    Chapenko, VP
    AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2003, 37 (03) : 1 - 7