Your SlideShare is downloading. ×
Upcoming SlideShare
Loading in...5

Thanks for flagging this SlideShare!

Oops! An error has occurred.

Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply



Published on

  • Be the first to comment

  • Be the first to like this

No Downloads
Total Views
On Slideshare
From Embeds
Number of Embeds
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

No notes for slide


  • 1. Software engineering for real-time systems Section 11 Analysing and testing source code
  • 2. Introduction
    • Objectives
    • To:
        • Explain the underlying concepts of the testing of source code.
        • Describe the basics of static and dynamic analysis.
        • Introduce code complexity metrics.
        • Describe coverage analysis and its use as part of the dynamic analysis process.
        • Illustrate test issues specifically related to object-oriented programming constructs.
  • 3. Introduction to software testing Part 1 Overview
  • 4. Why test software?
  • 5. Approaches to code testing Preventing errors Detecting errors
  • 6. Software code test techniques
  • 7. Software testing steps Test units Integrate units then test functions Integrate functions then test sub-systems Integrate sub-systems then test the complete system Software system Software sub-system 1 Software sub-system 2 Major software function 1 Major software function 2 Major software function 3 Code unit 1 Code unit 3 Code unit 2 Code unit 5 Code unit 4 Integration of parts
  • 8. Introduction to static analysis Part 2 Static Analysis
  • 9. Static analysis techniques
  • 10. Automated static analysis tools
  • 11. Evaluating program structure - cyclomatic complexity measures McCabe’s cyclomatic complexity metric: a measure of the amount of decision logic in a code unit Cyclomatic complexity value: the number of independent paths through a control flow graph Control flow graph Graph complexity measured using Cyclomatic complexity techniques Output from module Source code decision logic Input to module Structure described using a
  • 12. Control flow graph - simple sequence structure
    • Cyclomatic complexity value v(G): the number of independent paths through a control flow graph.
    • Here v(G) = 1
    { Accel [0] = Xnew; Accel [1] = Xold; Accel [2] = Ynew; } Statement 1 Statement 2 Statement 3 Node 1 Node 2 Node 3 Edge (1-2) Edge (2-3) Code of 'module' Corresponding flow graph Statement 1 Statement 2 Statement 3 Flowchart
  • 13. Control flow graph - simple selection structure v(G) = 2 Statement Flowchart Statement Statement ?
  • 14. Control flow graph - simple iteration structure { while (DataValue < 10) { cout << &quot; Input data value&quot;; cin >> DataValue' cout << DataValue; } /* end while */ cout << &quot; End of test&quot;; } Construct 1 Construct 2 Construct 3 Construct 4 Code of 'module' Construct 5 Node 1 Edge (1-2) Edge (2-3) Edge (3-4) Edge (4-1) Node 5 Corresponding flow graph Node 3 Node 2 Node 4 Edge (1-5) v(G) = 2 Statement Flowchart Statement ? Statement Statement
  • 15. Example control flow graphs Control flow graph - highly complex structure Control flow graph - simplest structure achievable
  • 16. Introduction to dynamic analysis Part 3 Dynamic Analysis
  • 17. Black box and white box testing Two ways of testing code Overall function Internal workings ‘ Black box’ testing Performed at the interfaces ‘ White box’ testing Performed on the implementation
  • 18. Basis of dynamic testing
  • 19. The test harness
  • 20. Features of general-purpose dynamic testing tools
  • 21. Coverage analysis and white box testing
    • Coverage analysis
    • ‘ A measure of the effectiveness and completeness of code testing.’
  • 22. Basis of a practical dynamic testing tool
  • 23. Dynamic testing and coverage analysis tool
  • 24. Integration and testing Part 4 Integration and test strategies
  • 25. Combined unit and integration testing Unit A Unit A2 Unit A1 Test code for unit A Test 2 Integrate units A1 and A2 to form A Test code for unit A1 Unit A1 Test 1(a) Test code for unit A2 Unit A2 Test 1(b) Phase 1: test individual units. Phase 2: test the combined unit. This test must exercise all features of A1 and A2.
  • 26. Reduced integration testing v v Call node (a) Original graph - v(G) = 6 Full flow graph of the integrated unit A. Reduction steps: 1. Identify ALL control structures of units A1 and A2 not concerned with external units (A). 2. Remove these from the flow graph. Reduced flow graph of the integrated unit Call node (a) Reducedl graph - v(G) = 2
  • 27. Class and object testing Part 5 OO systems - Class and object testing
  • 28. Class and object testing
  • 29. OO metrics in general use
  • 30. Use of OO metrics Evaluation of completeness and self-containment Assessment of design complexity Prediction of required test effort Use of OO metrics (class and object) Estimation of coding errors Ÿ LOC Ÿ AD Ÿ MD Ÿ MHF Ÿ AHF Ÿ LCOM Ÿ DIT Ÿ NOC Ÿ LCOM Ÿ WMC Ÿ WMC Ÿ RFC Ÿ MHF Ÿ CBO
  • 31. Inheritance, polymorphism and testing issues
  • 32. Multiple clients using multiple servers having polymorphic methods THE question: How much testing is needed?
  • 33. Alternative test strategies with multiple clients/servers
  • 34. Review of ‘Analysing and testing source code’