연구동향 분석
박사

A further improvement of manually fine-tuned static analyzer by a data-driven approach

김진영 2020년

논문상세정보
인용/피인용
' A further improvement of manually fine-tuned static analyzer by a data-driven approach' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • 응용 물리
  • 경로 민감 분석
  • 데이터 기반 프로그램 분석
  • 정적 프로그램 분석
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
4,654 0

0.0%

' A further improvement of manually fine-tuned static analyzer by a data-driven approach' 의 참고문헌

  • ¡°Precise and scalable points-to analysis via datadrivenContext tunneling
    2 ( OOPSLA ) :140 [2018]
  • ¡°Learning a strategy for adapting a program analysis via bayesian optimisation
    volume 50 , pages 572–588 . ACM [2015]
  • ¡°Data-drivenContext-sensitivity for points-to analysis ,
    1 ( OOPSLA ) :100 [2017]
  • [3] Jacob Burnim and Koushik Sen. Heuristics for scalable dynamic test generation. In Proceedings of the 2008 23rd IEEE/ACM international conference on automated software engineering, pages 443–446. IEEE Computer Society, 2008.
  • [25] Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar. Foundations of machine learning. MIT press, 2018.
  • [1] Al Bessey, Ken Block, Ben Chelf, Andy Chou, Bryan Fulton, Seth Hallem, Charles Henri-Gros, Asya Kamsky, Scott McPeak, and Dawson Engler. A few billion lines of code later: using static analysis to find bugs in the real world. Communications of the ACM, 53(2):66–75, 2010.
  • [14] Radu Grigore and Hongseok Yang. Abstraction refinement guided by a learnt probabilistic model. In ACM SIGPLAN Notices, volume 51, pages 485–498. ACM, 2016.
    volume 51 , pages 485–498 . ACM [2016]
  • [12] Patrick Cousot and Radhia Cousot. Abstract interpretation frameworks. Journal of logic and computation, 2(4):511–547, 1992.
  • [11] Patrick Cousot and Radhia Cousot. Systematic design of program analysis frameworks. In Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pages 269–282. ACM, 1979.
  • [10] Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pages 238–252. ACM, 1977.
  • Template-guided concolic testing via online learning
    pages 408–418 [2018]
  • SelectiveContext-sensitivity guided by impact pre-analysis
    volume 49 , pages 475–484 . ACM [2014]
  • Resource-aware program analysis via online abstractionCoarsening
    [2019]
  • Predicting program properties from bigCode .
    volume 50 , pages 111– 124 . ACM [2015]
  • Machine-learning-guided selectively unsound static analysis . In Proceedings of the 39th International Conference on Software Engineering
    pages 519–529 [2017]
  • Machine Learning . McGraw-Hill , Inc.
    1 edition [1997]
  • Learning a variable-clustering strategy for octagon from labeled data generated by a static analysis
    [2016]
  • Learning a strategy for choosing widening thresholds from a large codebase . In Asian Symposium on Programming Languages and Systems
    pages 25–41 [2016]
  • Learning a static analyzer from data
    [2017]
  • Klee : Unassisted and automatic generation of high-coverage tests for complex systems programs
    volume 8 , pages 209–224 , [2008]
  • J. Vanderplas , A. Passos , D. Cournapeau , M. Brucher , M. Perrot , and E. Duchesnay . Scikit-learn : Machine learning in Python
    12:2825– 2830 [2011]
  • Introduction to Static Analysis : an Abstract Interpretation Perspective
    [2020]
  • How we get there : A context-guided search strategy in concolic testing
    [2014]
  • Fast numerical program analysis with reinforcement learning
    [2018]
  • Estimating types in binaries using predictive modeling
    volume 51 , pages 313– 326 . ACM [2016]
  • Design and implementation of sparse global analyses for c-like languages
    volume 47 , pages 229–238 . ACM [2012]
  • Concolic testing with adaptively changing search heuristics
    [2019]
  • Carfast : Achieving higher statement coverage faster . In Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering
    [2012]
  • Cab-fuzz : Practical concolic testing techniques for { COTS } operating systems
    { USENIX } { ATC } 17 ) , pages 689–701 , [2017]
  • Automatically generating search heuristics for concolic testing
    pages 1244–1254 . ACM [2018]
  • Automatically generating features for learning program analysis heuristics for c-like languages .
    1 ( OOPSLA ) :101 [2017]
  • Artificial Intelligence : A Modern Approach
    3rd internat . edn [2010]
  • Adaptive static analysis via learning with bayesian optimization .
    40 ( 4 ) :14 [2018]
  • Adaptive context-sensitive analysis for javascript . In 29th European Conference on Object-Oriented Programming
    [2015]
  • Access-based abstract memory localization in static analysis
    78 ( 9 ) :1701–1727 [2013]
  • A machinelearning algorithm with disjunctive model for data-driven program analysis .
    41 ( 2 ) :13 [2019]
  • A comparative study of industrial static analysis tools .
    [2008]