TAILIEUCHUNG - Lecture Software testing and analysis: Chapter 6 - Mauro Pezzè, Michal Young

Models of data flow and dependence in software have many applications in software engineering, from testing to refactoring to reverse engineering,. Moreover, the basic algorithms used to construct data flow models have even wider application and are of particular interest because they can often be quite efficient in time and space. | Dependence and Data Flow Models (c) 2007 Mauro Pezzè & Michal Young Ch 6, slide 1 Why Data Flow Models? • Models from Chapter 5 emphasized control • Control flow graph, call graph, finite state machines • We also need to reason about dependence • Where does this value of x come from? • What would be affected by changing this? • . • Many program analyses and test design techniques use data flow information – Often in combination with control flow • Example: “Taint” analysis to prevent SQL injection attacks • Example: Dataflow test criteria () (c) 2007 Mauro Pezzè & Michal Young Ch 6, slide 2 Learning objectives • Understand basics of data-flow models and the related concepts (def-use pairs, dominators ) • Understand some analyses that can be performed with the data-flow model of a program – The data flow analyses to build models – Analyses that use the data flow models • Understand basic trade-offs in modeling data flow – variations and limitations of data-flow models and analyses, differing in precision and cost (c) 2007 Mauro Pezzè & Michal Young Ch 6, slide 3 Def-Use Pairs (1) • A def-use (du) pair associates a point in a program where a value is produced with a point where it is used • Definition: where a variable gets a value – – – – Variable declaration (often the special value “uninitialized”) Variable initialization Assignment Values received by a parameter • Use: extraction of a value from a variable – – – – Expressions Conditional statements Parameter passing Returns (c) 2007 Mauro Pezzè & Michal Young Ch 6, slide 4 Def-Use Pairs . if (.) { x = . ; . } y = . + x + . ; Def-Use path . if (.) { Definition: x gets a value x = . . Use: the value of x is extracted y = . + x + . . (c) 2007 Mauro Pezzè & Michal Young Ch 6, slide .

• Sáng kiến kinh nghiệm
• Software testing
• Software analysis
• Software testing and analysis
• Software product
• Software processes
• Data flow models
• Software process
• Testing object oriented software
• Component based software testing
• Lecture Software testing and quality assurance
• Lecture Software testing
• Quality assurance
• Web Base application testing
• Performance testing
• Coverage testing
• Functional testing
• Combinatorial testing
• Structural testing
• Data flow testing
• Model based testing
• Fault based testing
• System testing
• A testing workbench
• Kiểm thử beta
• Software qualities
• Software reliability engineering testing
• Assessing program qualities
• Phân hoạch tương đương
• Software Engineering
• Defect testing
• Testing process goals
• Assertion based Testing
• Model of program testing
• Quality process
• A Software Testing Primer
• Software Testing Primer
• Concepts of testing
• Non functional testing
• Test planning