1. VERIFICATION IN CHUNK-BASED SOFTWARE EVOLUTION
Mehrnaz Najafi, Rick Salay and Marsha Chechik
NECSIS/ORF Workshop 2014

2. The Verification Problem
Why don’t we consider rest of the system as environment!

3. The Verification Problem
Why don’t we consider rest of the system as environment!
|= P1∧P2 ?

4. First Step: Componentization
Goal: Parallel Composed Components
Desirable properties:
Preserve structure
Minimal changes
Why don’t we consider rest of the system as environment!

5. Second Step: Plant Synthesis
Problem: The parallel composition is too large to verify!
Why don’t we consider rest of the system as environment!
Plant

6. Second Step: Plant Synthesis
Method: Learning algorithm [1]
(LTSA Tool [2])
Steps:
Convert to LTS
Apply learning using LTSA
Plant
[1] C. S. Pasareanu et al., Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning, FMSD, Vol. 32, Issue 3, 2008.
[2] J. Magee and J. Kramer, Concurrency: state models & Java programs, John Wiley & Sons, 1999.

7. Pros and Cons of Learning
Automated Synthesis Conversion of behavioral models to LTSs increases the size of behavioral models Currently, the learning technique only supports safety properties

8. Third Step: Model Checking
Modified chunk P1 P2
Plant
Model Checking LTSA Tool
We want to reuse the plant to no to synthesize environment each time we modify the chunk (multiple modifications) No
Yes

9. Future Work Reuse existing plants Support for liveness properties
Using other techniques to synthesize plants

10. Please See Our Poster !

11. Thank You
Questions?