연구동향 분석
박사

정적 분석기 사용자 편의성 증대에 관한 연구 = Improving the Usability of Static Analyzers

이우석 2016년

논문상세정보
인용/피인용
' 정적 분석기 사용자 편의성 증대에 관한 연구 = Improving the Usability of Static Analyzers' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • 응용 물리
  • 동형암호
  • 버퍼오버런 탐지
  • 비통계적 클러스터링
  • 사용자 편의성
  • 요약 해석
  • 진행율 예측
  • 포인터분석
  • 프로그래밍 언어
  • 프로그램 정적 분석
  • 허위 경보
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
4,721 0

0.0%

' 정적 분석기 사용자 편의성 증대에 관한 연구 = Improving the Usability of Static Analyzers' 의 참고문헌

  •  1] Software clinic service. http://rosaec.snu.ac.kr/clinic.
  • Zvika Brakerski. Fully homomorphic encryption without modulus switching from classical gapsvp. In Reihaneh Safavi-Naini and Ran Canetti, editors, Advances in Cryptology – CRYPTO 2012, volume 7417 of Lecture Notes in Computer Science, pages 868–886. Springer Berlin Heidelberg, 2012.
  • Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. (leveled) fully homomorphic encryption without bootstrapping. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS ’12, pages 309–325, New York, NY, USA, 2012. ACM.
  • Zvika Brakerski and Vinod Vaikuntanathan. Efficient fully homomorphic encryption from (standard) lwe. In Proceedings of the 2011 IEEE 52Nd Annual Symposium on Foundations of Computer Science, FOCS ’11, pages 97–106, Washington, DC, USA, 2011. IEEE Computer Society.
  • Yungbum Jung, Jaehwang Kim, Jaeho Shin, and Kwangkeun Yi. Taming false alarms from a domain-unaware c analyzer by a bayesian statistical post analysis. In Proceedings of the 12th International Conference on Static Analysis, SAS’05, pages 203–217, Berlin, Heidelberg, 2005. Springer-Verlag.
  • Youil Kim, Jooyong Lee, Hwansoo Han, and Kwang-Moo Choe. Filtering false alarms of buffer overflow analysis using smt solvers. Inf. Softw. Technol., 52(2):210–219, February 2010.
  • Xavier Rival. Understanding the origin of alarms in astr Ee. In Proceedings of the 12th International Conference on Static Analysis, SAS’05, pages 303–319, Berlin, Heidelberg, 2005. Springer-Verlag.
  • Xavier Rival and Laurent Mauborgne. The trace partitioning abstract domain. ACM Trans on Programming Languages and System, 29(5):26–51, 2007.
  • Woosuk Lee, Wonchan Lee, and Kwangkeun Yi. Sound non-statistical clustering of static analysis alarms. In Proceedings of the 13th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI’12, pages 299–314, Berlin, Heidelberg, 2012. Springer-Verlag.
  • Woosuk Lee, Hyunsook Hong, Kwangkeun Yi, and JungHee Cheon. Static analysis with set-closure in secrecy. In Sandrine Blazy and Thomas Jensen, editors, Static Analysis, volume 9291 of Lecture Notes in Computer Science, pages 18–35. Springer Berlin Heidelberg, 2015.
  • Woosuk Lee, Hakjoo Oh, and Kwangkeun Yi. A progress bar for static analyzers. In Markus M uller-Olm and Helmut Seidl, editors, Static Analysis, volume 8723 of Lecture Notes in Computer Science, pages 184–200. Springer International Publishing, 2014.
  • Wei Le and Mary Lou Soffa. Path-based fault correlations. In Proceedings of the Eighteenth ACM SIGSOFT International Symposium on Foundations of Software Engineering, FSE ’10, pages 307–316, New York, NY, USA, 2010. ACM.
  • Vijay D’Silva, Leopold Haller, Daniel Kroening, and Michael Tautschnig. Numeric bounds analysis with conflict-driven learning. In Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS’12, pages 48–63, Berlin, Heidelberg, 2012. Springer-Verlag.
  • Ted Kremenek, Ken Ashcraft, Junfeng Yang, and Dawson Engler. Correlation exploitation in error ranking. In Proceedings of the 12th ACM SIGSOFT Twelfth International Symposium on Foundations of Software Engineering, SIGSOFT ’04/FSE-12, pages 83–93, New York, NY, USA, 2004. ACM.
  • Ted Kremenek and Dawson Engler. Z-ranking: Using statistical analysis to counter the impact of static analysis approximations. In Proceedings of the 10th International Conference on Static Analysis, SAS’03, pages 295–315, Berlin, Heidelberg, 2003. Springer-Verlag.
  • Surajit Chaudhuri, Vivek Narasayya, and Ravishankar Ramamurthy. Estimating progress of execution for sql queries. In Proceedings of the 2004 ACM SIGMOD international conference on Management of data, SIGMOD ’04, pages 803–814, New York, NY, USA, 2004. ACM.
  • Sparrow analyzer. http://ropas.snu.ac.kr/sparrow.
  • Shai Halevi and Victor Shoup. Algorithms in HElib. Cryptology ePrint Archive, Report 2014/106, 2014. http://eprint.iacr.org/.
  • Percy Liang, Omer Tripp, and Mayur Naik. Learning minimal abstractions. In Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL ’11, pages 31–42, New York, NY, USA, 2011. ACM.
  • 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, POPL ’77, pages 238–252, New York, NY, USA, 1977. ACM.
  • Patrick Cousot and Radhia Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4):511–547, 1992.
  • P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Min e, and X. Rival. Why does astr ee scale up? Formal Methods in System Design, 35(3):229–264, December 2009.
  • Nigel P. Smart and Frederik Vercauteren. Fully Homomorphic SIMD Operations. IACR Cryptology ePrint Archive, 2011:133.
  • Nick Howgrave-Graham. Approximate integer common divisors. In JosephH. Silverman, editor, Cryptography and Lattices, volume 2146 of Lecture Notes in Computer Science, pages 51–66. Springer Berlin Heidelberg, 2001.
  • Nevin Heintze and Olivier Tardieu. Ultra-fast aliasing analysis using cla: A million lines of c code in a second. In Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, PLDI ’01, pages 254–263, New York, NY, USA, 2001. ACM.
  • N.P. Smart and F. Vercauteren. Fully homomorphic encryption with relatively small key and ciphertext sizes. In PhongQ. Nguyen and David Pointcheval, editors, Public Key Cryptography – PKC 2010, volume 6056 of Lecture Notes in Computer Science, pages 420–443. Springer Berlin Heidelberg, 2010.
  • N.P. Smart and F. Vercauteren. Fully homomorphic SIMD operations. Designs, Codes and Cryptography, 71(1):57–81, 2014.
  • Microsoft. Code contracts, 2015. http://msdn.microsoft.com/en-us/ devlabs/dd491992.aspx.
  • MathWorks. Polyspace embedded software verification. http://www. mathworks.com/products/polyspace/index.html.
  • Marten van Dijk, Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan. Fully homomorphic encryption over the integers. In Henri Gilbert, editor, Advances in Cryptology – EUROCRYPT 2010, volume 6110 of Lecture Notes in Computer Science, pages 24–43. Springer Berlin Heidelberg, 2010.
  • Manuel F ahndrich, Jeffrey S. Foster, Zhendong Su, and Alexander Aiken. Partial online cycle elimination in inclusion constraint graphs. In Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, PLDI ’98, pages 85–96, New York, NY, USA, 1998. ACM.
  • Kristi Morton, Magdalena Balazinska, and Dan Grossman. Paratimer: a progress indicator for mapreduce dags. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, SIGMOD ’10, pages 507–518, New York, NY, USA, 2010. ACM.
  • K. Morton, A. Friesen, M. Balazinska, and D. Grossman. Estimating the progress of MapReduce pipelines. In Proc. of ICDE, pages 681–684. IEEE, 2010.
  • JungHee Cheon, Jean-S ebastien Coron, Jinsu Kim, MoonSung Lee, Tancr`ede Lepoint, Mehdi Tibouchi, and Aaram Yun. Batch fully homomorphic encryption over the integers. In Thomas Johansson and PhongQ. Nguyen, editors, Advances in Cryptology – EUROCRYPT 2013, volume 7881 of Lecture Notes in Computer Science, pages 315–335. Springer Berlin Heidelberg, 2013.
  • JungHee Cheon and Damien Stehl e. Fully homomophic encryption over the integers revisited. In Elisabeth Oswald and Marc Fischlin, editors, Advances in Cryptology – EUROCRYPT 2015, volume 9056 of Lecture Notes in Computer Science, pages 513–536. Springer Berlin Heidelberg, 2015.
  • Jung Hee Cheon, Miran Kim, and Kristin Lauter. Homomorphic Computation of Edit Distance. IACR Cryptology ePrint Archive, 2015:132, 2015. To appear in WAHC 2015.
  • Jean-S ebastien Coron, David Naccache, and Mehdi Tibouchi. Public key compression and modulus switching for fully homomorphic encryption over the integers. In Proceedings of the 31st Annual International Conference on Theory and Applications of Cryptographic Techniques, EUROCRYPT’12, pages 446– 464, Berlin, Heidelberg, 2012. Springer-Verlag.
  • Heejung Kim, Yungbum Jung, Sunghun Kim, and Kwankeun Yi. Mecc: Memory comparison-based clone detector. In Proceedings of the 33rd International Conference on Software Engineering, ICSE ’11, pages 301–310, New York, NY, USA, 2011. ACM.
  • Hakjoo Oh, Kihong Heo, Wonchan Lee, Woosuk Lee, and Kwangkeun Yi. Design and implementation of sparse global analyses for c-like languages. In Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI ’12, pages 229–238, New York, NY, USA, 2012. ACM.
  • Hakjoo Oh and Kwangkeun Yi. An algorithmic mitigation of large spurious interprocedural cycles in static analysis. Softw. Pract. Exper., 40(8):585–603, July 2010.
  • Hakjoo Oh and Kwangkeun Yi. Access-based localization with bypassing. In Proceedings of the 9th Asian Conference on Programming Languages and Systems, APLAS’11, pages 50–65, Berlin, Heidelberg, 2011. Springer-Verlag.
  • Hakjoo Oh and Kwangkeun Yi. Access-based abstract memory localization in static analysis. Science of Computer Programming, 78(9):1701–1727, 2013.
  • Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, and Michael W. Watzke. Toward a progress indicator for database queries. In Proceedings of the 2004 ACM SIGMOD international conference on Management of data, SIGMOD ’04, pages 791–802, New York, NY, USA, 2004. ACM.
  • Frank Hutter, Lin Xu, Holger H. Hoos, and Kevin Leyton-Brown. Algorithm runtime prediction: The state of the art. CoRR, abs/1211.0906, 2012.
  • Francois Bourdoncle. Efficient chaotic iteration strategies with widenings. In Proceedings of the International Conference on Formal Methods in Programming and their Applications, pages 128–141, 1993.
  • F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay. Scikit-learn: Machine learning in Python. Journal of Machine Learning Research, 12:2825– 2830, 2011.
  • Dan Boneh, Craig Gentry, Shai Halevi, Frank Wang, and David J. Wu. Private database queries using somewhat homomorphic encryption. In Proceedings of the 11th International Conference on Applied Cryptography and Network Security, ACNS’13, pages 102–118, Berlin, Heidelberg, 2013. Springer- Verlag.
  • D.J. Pearce, P.H.J. Kelly, and C. Hankin. Online cycle detection and difference propagation for pointer analysis. In SCAM, 2003.
  • Cristina Cifuentes, Christian Hoermann, Nathan Keynes, Lian Li, Simon Long, Erica Mealy, Michael Mounteney, and Bernhard Scholz. Begbunch: Benchmarking for c bug detection tools. In Proceedings of the 2Nd International Workshop on Defects in Large Software Systems: Held in Conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2009), DEFECTS ’09, pages 16–20, New York, NY, USA, 2009. ACM.
  • Craig Gentry. A fully homomorphic encryption scheme. PhD thesis, Stanford University, 2009. http://crypto.stanford.edu/craig.
  • Craig Gentry, Shai Halevi, and NigelP. Smart. Homomorphic evaluation of the aes circuit. In Reihaneh Safavi-Naini and Ran Canetti, editors, Advances in Cryptology – CRYPTO 2012, volume 7417 of Lecture Notes in Computer Science, pages 850–867. Springer Berlin Heidelberg, 2012.
  • Christian Fecht and Helmut Seidl. Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems. Nord. J. Comput., 5(4):304–329, 1998.
  • Bruno Blanchet, Patrick Cousot, Radhia Cousot, J erome Feret, Laurent Mauborgne, Antoine Min e, David Monniaux, and Xavier Rival. A static analyzer for large safety-critical software. In Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation, PLDI ’03, pages 196–207, New York, NY, USA, 2003. ACM.
  • Brad A. Myers. The importance of percent-done progress indicators for computer-human interfaces. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI ’85, pages 11–17, New York, NY, USA, 1985. ACM.
  • BhargavS. Gulavani and SriramK. Rajamani. Counterexample driven refinement for abstract interpretation. In Holger Hermanns and Jens Palsberg, editors, Tools and Algorithms for the Construction and Analysis of Systems, volume 3920 of Lecture Notes in Computer Science, pages 474–488. Springer Berlin Heidelberg, 2006.
  • Bhargav S. Gulavani, Supratik Chakraborty, Aditya V. Nori, and Sriram K. Rajamani. Automatically refining abstract interpretations. In Proceedings of the Theory and Practice of Software, 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS’08/ETAPS’08, pages 443–458, Berlin, Heidelberg, 2008. Springer- Verlag.
  • Ben Hardekopf and Calvin Lin. The ant and the grasshopper: Fast and accurate pointer analysis for millions of lines of code. In Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI ’07, pages 290–299, New York, NY, USA, 2007. ACM.
  • Ayantika Chatterjee, Manish Kaushal, and Indranil Sengupta. Accelerating sorting of fully homomorphic encrypted data. In Goutam Paul and Serge Vaudenay, editors, Progress in Cryptology – INDOCRYPT 2013, volume 8250 of Lecture Notes in Computer Science, pages 262–273. Springer International Publishing, 2013.
  • Arnd Christian K onig, Bolin Ding, Surajit Chaudhuri, and Vivek Narasayya. A statistical approach towards robust progress estimation. Proc. VLDB Endow., 5(4):382–393, December 2011.
  • A. Min e. The Octagon Abstract Domain. Higher-Order and Symbolic Computation, 19(1):31–100, 2006.