A Cloud-Based Execution Framework for Program Analysis

被引:0
作者
Balasubramanian, Daniel [1 ]
Kostyuchenko, Dmitriy [1 ]
Luckow, Kasper [2 ]
Kersten, Rody [2 ]
Karsai, Gabor [1 ]
机构
[1] Vanderbilt Univ, Inst Software Integrated Syst, Nashville, TN 37212 USA
[2] Carnegie Mellon Univ, Moffett Field, CA 94035 USA
来源
SOFTWARE ENGINEERING AND FORMAL METHODS, SEFM 2018 | 2018年 / 10886卷
关键词
D O I
10.1007/978-3-319-92970-5_9
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Program analysis is a popular method to determine properties about program behavior, such as execution times and potential security vulnerabilities. One of the biggest challenges faced by almost every form of program analysis is scalability. One way to address scalability issues is to distribute the analysis across multiple machines. However, this is not an easy task; designing a distribution framework that is capable of supporting multiple types of program analysis requires careful thought and consideration. This paper presents the cloud-based execution framework that we built for performing distributed analysis of Java bytecode programs. We describe the design decisions that allow this framework to be generic enough to support multiple types of analysis but remain efficient at the same time. We also present a simple, static work partitioning algorithm that we have found to work well in practice and provide benchmarks to show its efficiency.
引用
收藏
页码:139 / 154
页数:16
相关论文
共 17 条
  • [1] [Anonymous], P 4 ANN S CLOUD COMP, DOI [10.1145/2523616.2523633, DOI 10.1145/2523616.2523633]
  • [2] [Anonymous], 2012, ACM QUEUE, DOI DOI 10.1145/2090147.2094081
  • [3] [Anonymous], 2012, P 2 EDITION PROGRAMM
  • [4] [Anonymous], MONTE CARLO TR UNPUB
  • [5] Beyer D, 2014, LECT NOTES COMPUT SC, V8559, P327, DOI 10.1007/978-3-319-08867-9_21
  • [6] A Survey of Monte Carlo Tree Search Methods
    Browne, Cameron B.
    Powley, Edward
    Whitehouse, Daniel
    Lucas, Simon M.
    Cowling, Peter I.
    Rohlfshagen, Philipp
    Tavener, Stephen
    Perez, Diego
    Samothrakis, Spyridon
    Colton, Simon
    [J]. IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2012, 4 (01) : 1 - 43
  • [7] Bucur S, 2011, EUROSYS 11: PROCEEDINGS OF THE EUROSYS 2011 CONFERENCE, P183
  • [8] WISE: Automated Test Generation for Worst-Case Complexity
    Burnim, Jacob
    Juvekar, Sudeep
    Sen, Koushik
    [J]. 2009 31ST INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, PROCEEDINGS, 2009, : 463 - 473
  • [9] Cadar Cristian, 2008, OSDI'08, P209, DOI 10.5555/1855741.1855756
  • [10] Unleashing MAYHEM on Binary Code
    Cha, Sang Kil
    Avgerinos, Thanassis
    Rebert, Alexandre
    Brumley, David
    [J]. 2012 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2012, : 380 - 394