Automated discovery of state transitions and their functions in source code

Software Testing Verification and Reliability

Volumn 18, Issue 2, 2008, Pages 99-121

  Walkinshaw, Neil ^a   Bogdanov, Kirill ^a   Ali, Shaukat ^b   Holcombe, Mike ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

Finite state machines; Model checking; Reverse engineering; Symbolic execution

Indexed keywords

CODES (STANDARDS); COMPUTER SOFTWARE; SOFTWARE PROTOTYPING; SPECIFICATIONS; TESTING;

(MIN ,MAX ,+) FUNCTIONS; AUTOMATED DISCOVERY; FINITE STATE MACHINE (FSM); REAL SOFTWARE (CO); SOFTWARE DEVELOPMENT; SOURCE CODING; STATE TRANSITIONS; STATE-BASED; SYMBOLIC EXECUTION; TESTING TECHNIQUES; TRANSITION (JEL CLASSIFICATIONS:E52 ,E41 ,E31);

CODES (SYMBOLS);

EID: 45849135203     PISSN: 09600833     EISSN: 10991689     Source Type: Journal    
DOI: 10.1002/stvr.380     Document Type: Conference Paper

References (41)

1. Lee D, Yannakakis M. Principles and methods of testing finite state machines - A survey. Proceedings of the IEEE, vol. 84, 1996; 1090-1126.
2. Holcombe M, Ipate F. Correct Systems - Building a Business Process Solution (Applied Computing Series). Springer: Berlin, 1998.
3. Börger E. Abstract state machines and high-level system design and analysis. Theoretical Computer Science 2005; 336(2-3):205-207.
4. Krishnakumar AS. Reachability and Recurrence in Extended Finite State Machines: Modular Vector Addition Systems. Computer-Aided Verification (Lecture Notes in Computer Science, vol. 697), Courcoubetis C (ed.). Springer: Berlin, 1993; 110-122.
5. Chen F, Tillmann N, Schulte W. Discovering specifications. Technical Report MSR-TR-2005-146, Microsoft Research, Redmond, October 2005.
6. Kung D, Lu Y, Venugopalan N, Hsia P, Toyoshima Y, Chen C, Gao J. Object state testing and fault analysis for reliable software systems. Proceedings of the 7th International Symposium on Software Reliability Engineering (ISSRE'96), New York, U.S.A., 1996.
7. Yuan H, Xie T. Automatic extraction of abstract-object-state machines based on branch coverage. Proceedings of the Ist International Workshop on Reverse Engineering to Requirements at WCRE 2005 (RETR 2005), Pittsburgh, U.S.A., November 2005; 5-11.
8. Ernst M, Cockrell J, Griswold W, Notkin D. Dynamically discovering likely program invariants to support program evolution. Transactions on Software Engineering 2001; 27(2):1-25.
9. Gotel O, Finkelstein A. An analysis of the requirements traceability problem. Proceedings of the First International Conference on Requirements Engineering, Colorado, U.S.A., 1994.
10. Aho A, Sethi R, Ullman J. Compilers: Principles, Techniques, and Tools. Addison-Wesley: Reading, MA, 1986.
11. Canfora G, Climitile A, De Lucia A. Conditioned program slicing. Information and Software Technology 1998; 40(11 /12):595-607.
12. Danicic S, Daoudi M, Fox C, Harman M, Hierons R, Howroyd J, Ouarbya L, Ward M. ConSUS: A light-weight program conditioner. Journal of Systems and Software 2005; 77(3):241-262.
13. Fox C, Danicic S, Harman M, Hierons R. CONSIT. A fully automated conditioned program slicer. Software - Practice and Experience 2004; 34(1):15-46.
14. Coward PD. Symbolic execution and testing. Information and Software Technology 1991; 33:53-64.
15. King J. Symbolic execution and program testing. Communications of the ACM 1976; 19(7):385-394.
16. Lembeck C, Caballero R, Mueller R, Kuchen H. Constraint solving for generating glass-box test cases. Proceedings of the International Workshop on Functional and (Constraint) Logic Programming (WFLP'04), Aachen, Germany, 2004.
17. Prenninger W, Pretschner A. Abstractions for Model-based Testing (Electronic Notes on Theoretical Computer Science, vol. 116). Springer: Berlin, 2005; 59-71.
18. Java pathfinder. Available at: http://javapathfinder.sourceforge.net/ [10 October 2006].
19. Khurshid S, Pasareanu C, Visser W. Generalized symbolic execution for model checking and testing. Ninth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'03), Warsaw, Poland, 2003.
20. Vallee R, Co P, Gagnon E, Hendren L, Lam P, Sundaresan V. Soot - A Java bytecode optimisation framework. Proceedings of Cascon '99, Mississauga, Canada, 1999; 125-135.
21. Visser W, Pasareanu C, Khurshid S. Test input generation with Java PathFinder. Proceedings of the International Symposium on Software Testing and Analysis (ISSTA'04), Boston, U.S.A., 2004.
22. Walkinshaw N, Ali S, Bogdanov K, Holcombe M, Salahuddin S. Modelling and testing software with x-machines: A case study. Technical Report, Department of Computer Science, The University of Sheffield, 2007.
23. Fagan M. Design and code inspections to reduce errors in program development. IBM Systems Journal 1976; 15(3): 182-211.
24. Chow T. Testing software design modelled by finite state machines. IEEE Transactions on Sojhvare Engineering 1978; 4(3):178-187.
25. Dallmeier V, Lindig C, Wasylkowski A, Zeller A. Mining object behaviour with adabu. Proceedings of the International Workshop on Dynamic Analysis (WODA'06), Shanghai, China, 2006.
26. Henkel J, Diwan A. Discovering Algebraic Specifications from Java Classes (Lecture Notes in Computer Science, vol. 2743). Springer: Berlin, 2003; 431-456.
27. Tillmann N, Chen F, Schulte W. Discovering likely method specifications. International Conference on Formal Engineering Methods (Lecture Notes in Computer Science, vol. 4260). Springer: Berlin, 2006; 717-736.
28. Biermann AW, Feldman J. On the synthesis of finite-state machines from samples of their behavior. IEEE Transactions on Computers 1972; 21:592-597.
29. Lorenzoli D, Mariani L, Pezze M. Inferring state-based behavior models. Proceedings of the International Workshop on Dynamic Analysis (WODA'06), Shanghai, China, 2006.
30. Whaley J, Martin M, Lam M. Automatic extraction of object-oriented component interfaces. Proceedings of the International Symposium on Software Testing and Analysis, Rome, Italy, July 2002.
31. Xie T, Notkin D. Automatic extraction of object-oriented observer abstractions from unit-test executions. International Conference on Formal Engineering Methods (Lecture Notes in Computer Science, vol. 3308), Davies J, Schulte W, Barnett M (eds.). Springer: Berlin, 2004; 290-305.
32. Xie T, Marinov D, Schulte W, Notkin D. Symstra: A framework for generating object-oriented unit tests using symbolic execution. Proceedings of the 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 05), Edinburgh (Lecture Notes in Computer Science, vol. 3440), Halbwachs N, Zuck LD (eds.). Springer: Berlin, April 2005; 365-381.
33. Gurevich Y. Sequential abstract-state machines capture sequential algorithms. ACM Transactions on Computational Logic 2000; 1(1):77-111.
34. Deng X, Lee J, Robby. Bogor/Kiasan: A k-bounded symbolic execution for checking strong heap properties of open systems. Automated Software Engineering. IEEE Computer Society Press: Silver Spring, MD, 2006; 157-166.
35. Grieskamp W, Tillmann N, Schulte W. XRT - exploring runtime for NET architecture and applications. Workshop on Software Model Checking (SoftMC'2005), Edinburgh, U.K. (Electronic Notes on Theoretical Computer Science, vol. 144), Cook B, Stoller S, Visser W (eds.). Springer: Berlin, 2006; 3-26.
36. Fox C, Harman M, Hierons R, Danicic S. Backward conditioning: A new program specialisation technique and its application to program comprehension. Proceedings of the International Workshop an Program Comprehension (IWPC'01), Toronto, Canada, 2001; 89-97.
37. Pasareanu C, Visser W. Verification of Java Programs Using Symbolic Execution and Invariant Generation (Lecture Notes in Computer Science, vol. 2989). Springer: Berlin, 2004; 164-181.
38. Hu L, Harman M, Hierons R, Binkley D. Loop squashing transformations for amorphous slicing. Working Conference on Reverse Engineering (WCRE'04). IEEE Computer Society Press: Silver Spring, MD, 2004; 152-160.
39. Dwyer M, Hatcliff J, Hoosier M, Ranganath V, Robby, Wallentine T. Evaluating the effectiveness of slicing for model reduction of concurrent object-oriented programs. Proceedings of the Twelfth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06), Vienna, Austria, 2006.
40. Sen K, Marinov D, Agha G. CUTE: A concolic unit testing engine for C. Joint meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/ SIGSOFT FSE'05), Lisbon, Portugal, 2005; 263-272.
41. Bogdanov K, Holcombe M, lpate F, Seed L, Vanak S. Testing methods for X-Machines: A review. Formal Aspects of Computer Science 2006; 18:3-30.