Automated Formal Static Analysis and Retrieval of Source Code - JKU

More documents

Recommendations

Info

Bibliography [***] ***. Mindbreeze Enterprise Search 3.0.1 SDK. Mindbreeze Software GmbH, Honauerstrasse 4, 4020 Linz, Austria. [ABH + 07] [ADL + 79] [B. 06a] [B. 06b] [BCJ + 06] W. Ahrendt, B. Beckert, R. Hähnle, P. Rümmer, and P. Schmitt. Verifying objectoriented programs with KeY: A tutorial. In 5th International Symposium on Formal Methods for Components and Objects, Amsterdam, The Netherlands, volume 4709 of LNCS, pages 70–101. Springer, 2007. P. Asirelli, P. Degano, G. Levi, A. Martèlli, U. Montanari, G. Pacini, F. Sirovich, and F. Turini. A flexible environment for program development based on a symbolic interpreter. In ICSE ’79: Proceedings of the 4th international conference on Software engineering, pages 251–263, Piscataway, NJ, USA, 1979. IEEE Press. B. Cook and A. Podelski and A. Rybalchenko. Termination proofs for systems code. SIGPLAN Not., 41(6):415–426, 2006. B. Gulavani and T. Henzinger and Y. Kannan and A. Nori and S. Rajamani. Synergy: A new algorithm for property checking. In SIGSOFT ’06/FSE-14: Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering, pages 117–127, New York, NY, USA, 2006. ACM. B. Buchberger, A. Craciun, T. Jebelean, L. Kovacs, T. Kutsia, K. Nakagawa, F. Piroi, N. Popov, J. Robu, M. Rosenkranz, and W. Windsteiger. Theorema: Towards Computer-Aided Mathematical Theory Exploration. Journal of Applied Logic, 4(4):470–504, 2006. [BEL75] R. Boyer, B. Elspas, and K. Levitt. SELECT - a formal system for testing and debugging programs by symbolic execution. In Proceedings of the international conference on Reliable software, pages 234–245, New York, NY, USA, 1975. ACM. [BKM02] [BPS00] C. Boyapati, S. Khurshid, and D. Marinov. Korat: automated testing based on Java predicates. In ISSTA ’02: Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis, pages 123–133, New York, NY, USA, 2002. ACM. W. Bush, J. Pincus, and D. Sielaff. A static analyzer for finding dynamic programming errors. Software - Practice and Experience, 30(7):775–802, 2000. 57
58 BIBLIOGRAPHY [Cla76] L. Clarke. A System to Generate Test Data and Symbolically Execute Programs. Software Engineering, IEEE Transactions on, SE–2(3):215–222, 1976. [Cow88] D. Coward. Symbolic execution systems – a review. Softw. Eng. J., 3(6):229–239, 1988. [CPDGP01] A. Coen-Porisini, G. Denaro, C. Ghezzi, and M. Pezzé. Using symbolic execution for verifying safety-critical systems. In ESEC/FSE-9: Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering, pages 142–151, New York, NY, USA, 2001. ACM. [CS02] [dB03] M. Colón and H. Sipma. Practical Methods for Proving Program Termination. In CAV ’02: Proceedings of the 14th International Conference on Computer Aided Verification, pages 442–454, London, UK, 2002. Springer-Verlag. J. de Bruijn. Using ontologies – enabling knowledge sharing and reuse on the semantic web. Technical Report DERI-2003-10-29, DERI, 2003. [Deu73] L. Deutsch. An interactive program verifier. PhD thesis, University of California - Berkley, USA, 1973. [Dro90] [GAL + 06] [God97] [Hat95] [Hen94] [Hen97] [HJMS] [HK76] G. Dromey. Program derivation: the development of programs from specifications. Addison-Wesley Longman Publishing Co., Inc., 1990. V. Garcia, E. Almeida, L. Lisboa, A. Martins, S. Meira, D. Lucredio, and R. Fortes. Toward a code search engine based on the state-of-art and practice. In APSEC ’06: Proceedings of the XIII Asia Pacific Software Engineering Conference, pages 61–70, Washington, DC, USA, 2006. IEEE Computer Society. P. Godefroid. Model checking for programming languages using VeriSoft. In POPL ’97: Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 174–186, New York, NY, USA, 1997. ACM. L. Hatton. Safer C: Developing Software for in High-Integrity and Safety-Critical Systems. McGraw-Hill, Inc., New York, NY, USA, 1995. S. Henninger. Using Iterative Refinement to Find Reusable Software. IEEE Software, 11(5):48–59, 1994. S. Henninger. An Evolutionary Approach to Constructing Effective Software Reuse Repositories. ACM Trans. Softw. Eng. Methodol., 6(2):111–140, 1997. T. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. S. Hantler and J. King. An Introduction to Proving the Correctness of Programs. ACM Comput. Surv., 8(3):331–353, 1976.
Page 1:
J O H A N N E S K E P L E R U N I V
Page 5:
Abstract In this thesis two approac
Page 8 and 9:
viii
Page 10 and 11:
Chapter 1 Introduction From the han
Page 12 and 13:
3 Contributions of the Thesis The s
Page 14 and 15:
Next section starts by describing t
Page 16 and 17: Chapter 2 Program Verification by S
Page 18 and 19: 2.1. BACKGROUND 9 From the practica
Page 20 and 21: 2.1. BACKGROUND 11 A program is see
Page 22 and 23: 2.2. FORWARD SYMBOLIC EXECUTION IN
Page 28 and 29: 2.3. THE SIMPLIFICATION OF THE VERI
Page 30 and 31: 2.4. IMPLEMENTATION AND EXAMPLES 21
Page 36 and 37: Chapter 3 Code Search Integration F
Page 38 and 39: 3.1. BACKGROUND 29 Figure 3.1: Sour
Page 40 and 41: 3.1. BACKGROUND 31 The programming
Page 42 and 43: 3.2. INTEGRATION OF MINDBREEZE CODE
Page 62 and 63: Chapter 4 Conclusions In this thesi
Page 64 and 65: 55 How the database is used. For ea
Page 68 and 69: BIBLIOGRAPHY 59 [Hoa69] [How73] [KF
Page 70 and 71: BIBLIOGRAPHY 61 [VHBP00] [Wil94] W.
Page 72: Eidesstattliche Erklärung Ich erkl
show all

Automated Formal Static Analysis and Retrieval of Source Code - JKU

Create successful ePaper yourself

Delete template?

Save as template?