Towards Domain Refinement for UML/OCL Bounded Verification Robert Clarisó Universitat Oberta de Catalunya - Spain Carlos A. González AtlanMod team - Inria, Mines Nantes, LINA - France Jordi Cabot ICREA - Spain 13th Int. Conf on SW Enginerering and Formal Methods 8-11 September 2015, York, UK
33
Embed
Towards Domain Refinement for UML/OCL Bounded Verification
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Towards Domain Refinement for UML/OCL Bounded Verification
Robert Clarisó Universitat Oberta de Catalunya - Spain
Carlos A. González AtlanMod team - Inria, Mines Nantes, LINA - France
Jordi Cabot ICREA - Spain
13th Int. Conf on SW Enginerering and Formal Methods8-11 September 2015, York, UK
Motivation
Who? The reader
What?
Where?
Find Wally
Inside the page
Motivation
Who? The reader
What?
Where?
Find Wally
Inside the page
Motivation
Who? A solver
What?
Where?
Find faults
In a bounded state space
1. Bounded verification
2. Related work
Outline
2. Related work
3. Solution: refinement
4. Experimental results
5. Conclusions
Model M
Model-Based Verification
A B
C
Consistent
No contradictionsA
1
2
Property P
UML
Class diagram
Non-redundant
Lack of duplicities
A B
C
context C inv:
self.a->
excludes(self)
OCL
Invariants
Does model M satisfy correctness property P?
VERIFICATION TOOL
Model-based verification: overview
?
Model
A B
C
Correctness
Formal Notation
SAT / CP
?Correctness
Property
FiniteBounds
Designer
Feedback
Example or ? Counterexample or ?
Reasoning Engine
Bound selection
Choose “suitable” verification bounds for the solver
Goal
CONFIDENCE
EFFICIENCY
BOUNDSSmall Large
Fast Slow
Less More
Bound selection: heuristics
Small bounds are sufficient to detect most faults
Small scope hypothesis
Repeat analysis progressively increasing bounds
Incremental scoping
Our approach: bound refinement
VERIFICATION TOOLModel
A B
C Formal Notation
SAT / CP
CorrectnessProperty
Finite Bounds
Reasoning Engine
Feedback
Example or ?Countexample or ?
Our approach: bound refinement
VERIFICATION TOOLModel
A B
C Formal Notation
SAT / CP
CorrectnessProperty
Finite Bounds
Reasoning Engine
TighterboundsBound
refinement
Feedback
Example or ?Countexample or ?
Related work
Abstract size-related info toreason about size properties
Size abstraction
Bound propagation
Yu et al (FSE’2007)
CP solvers e.g. Remove improductive values from verification bounds