Symbolic Execution and Model Checking for Testing - NASA

More documents

Recommendations

Info

Lazy Initialization (illustration) consider executing next = t.next; E0 next E1 next t Precondition: acyclic list E0 next E1 next t null E0 next E1 next ? next t E0 next E1 t next next E0 next E1 t next E0 E1 next t null next E0 E1 next ? next t
State Matching: Subsumption Checking • Performing symbolic execution on looping programs – May result in an infinite execution tree • Perform search with limited depth • State matching – subsumption checking [SPIN’06, J. STTT to appear] – Obtained through DFS traversal of “rooted” heap configurations • Roots are program variables pointing to the heap – Unique labeling for “matched” nodes – Check logical implication between numeric constraints
Page 1 and 2: Symbolic Execution and Model Checki
Page 3 and 4: JPF - SE • Explicit state model c
Page 5 and 6: Example - Explicit Execution Code t
Page 7 and 8: Generalized Symbolic Execution •
Page 9: Implementation via Instrumentation
Page 13 and 14: Abstract Subsumption • Symbolic e
Page 15 and 16: Abstraction for Lists Symbolic stat
Page 17 and 18: Testing Java Containers • Contain
Page 19 and 20: More Information • Predicate Abst
Page 21 and 22: State Matching: Subsumption Checkin
Page 23 and 24: Communication Methods • JPF and t
Page 25 and 26: Results TCAS 35 30 25 20 15 10 5 om
Page 27: Applications • Test input generat

Symbolic Execution and Model Checking for Testing - NASA

Create successful ePaper yourself

Delete template?

Save as template?