臺灣博碩士論文加值系統

每當提到軟體測試時，手機應用程式的記憶體洩漏是個非常難以檢測的問題。然而現有的技術需依靠原始碼來產生測試案例，因此我們開發了一個能夠自動化檢測記憶體洩漏的黑箱測試架構。我們的測試流程首先是根據執行過紀錄的建構模型，具體來說，我們標記在模型中每個狀態的記憶體使用量，接著延伸最小平均權重環的演算法來達成k個最大權重環，然後使用該演算法來辨識出有大量記憶體使用量的環，藉以產生測試案例來重複執行這些環並觀察是否會造成問題，最後，我們展示我們實行的方法以及實驗。

When it comes to software testing in the industry, memory leak bugs of mobile applications (apps) are notorious to detect. Existing techniques usually rely on the availability of source code and instrumentation techniques to generate test cases. We have developed a framework to automate the black-box testing of app memory leaks. Our testing procedure first builds a finite-state model from the execution traces of the app under test (AUT). Specifically, we label each state in the model with memory usages and then extend Karp’s min-cycle algorithm to a k-max cycle algorithm. Then we use the algorithm to identify those cycles in the model with large memory usage and generate test cases to execute the AUT through those cycles for several times to observe whether the memory usage will blow up the AUT. Finally, we report our implementation and experiment with some apps.

口試委員會審定書 #
中文摘要 I
ABSTRACT II
CONTENT III
LIST OF FIGURES V
LIST OF TABLES VI
Chapter 1 Introduction 1
Chapter 2 Related Work 4
2.1 Memory management 4
2.2 Plumbr 6
2.3 Visual VM 6
2.4 Eclipse Memory Analyzer 7
2.5 Tools analysis 8
Chapter 3 Methodology 9
3.1 Karp’s max/min mean-weight cycle algorithm 9
3.2 Extension to find k max cycles 11
Chapter 4 Our Test Procedure 17
4.1 High-level procedure 17
4.2 Building model 19
4.3 Suspicious trace identification 20
4.4 Lasso generation 20
4.5 Test case execution 21
Chapter 5 Experiment 23
5.1 Experiment platform 23
5.2 Benchmark 24
5.3 Experiment result 26
5.4 Experiment analysis 28
Chapter 6 Conclusion 30
Reference 31

[1] Pritt Potter. “Plumbr.” https://plumbr.eu/
[2] Oracle. “Visual VM.” http://www.captaincasa.com/pdf/techdoc_memprofiling.pdf
[3] Simon Leppert, “Android memory dump analyze.” Department of Computer Science
[4] Open source. “Eclipse memory analyzer.” https://www.eclipse.org/mat/
[5] Karp, Richard M, “A characterization of the minimum cycle mean in a digraph“, Discrete mathematics 23.3, pages 309-311, 1978.
[6] Dasdan, Ali, and Rajesh K. Gupta, “Faster maximum and minimum mean cycle algorithms for system-performance analysis”, Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on 17.10, pages 889-899, 1998.
[7] Android developers, “Investigate your RAM usage.” https://developer.android.com/tools/debugging/debugging-memory.html
[8] Zorn, Benjamin, “Comparing mark-and-sweep and stop-and-copy garbage collection”, Proceedings of the 1990 ACM conference on LISP and functional programming. ACM, 1990.
[9] Schoren, Rob, “Correspondence between Kripke Structures and Labeled Transition Systems for Model Minimization”, Seminar project, Technische Universiteit Eindhoven, Department of Computer Science. 2011.
[10] Vaibhavi Patel, Chitra Baggar, “A Survey Paper of Bellman-Ford Algorithm and Dijkstra Algorithm for Finding Shortest Path in GIS Application”, International Journal of P2P Network Trends and Technology (IJPTT), Volume 5, 2014.
[11] Dan Grossman, “The transactional memory / garbage collection analogy”, Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications, 695-706, 2007.
[12] Guoqing Xu, Atanas Rountev, “Precise memory leak detection for java software using container profiling”, Proceedings of the 30th international conference on Software engineering, pages 151-160, 2008.