Compositional model checking
E909019
Compositional model checking is a formal verification technique that proves system correctness by analyzing components separately and then combining the results, enabling scalable verification of complex systems.
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
formal verification technique
ⓘ
model checking method ⓘ |
| aimsTo |
enable reuse of verification results
ⓘ
improve scalability of model checking ⓘ localize reasoning to components ⓘ |
| analyzes | system components separately ⓘ |
| appliedIn |
embedded systems verification
ⓘ
hardware verification ⓘ protocol verification ⓘ software verification ⓘ |
| appliesTo |
concurrent systems
ⓘ
distributed systems ⓘ reactive systems ⓘ |
| basedOn |
assume-guarantee reasoning
ⓘ
compositional reasoning ⓘ modular verification ⓘ |
| canUse |
assume-guarantee rules
ⓘ
compositional abstraction ⓘ interface automata ⓘ |
| combines | verification results of components ⓘ |
| contrastsWith | monolithic model checking ⓘ |
| dependsOn |
compositionality of system semantics
ⓘ
well-defined component interfaces ⓘ |
| developedInContextOf | state-space explosion problem ⓘ |
| enables |
component-wise refinement checking
ⓘ
incremental verification ⓘ parallel verification of components ⓘ |
| field |
computer science
NERFINISHED
ⓘ
formal methods ⓘ |
| hasPart |
component analysis
ⓘ
result composition ⓘ |
| hasProperty |
modular
ⓘ
scalable ⓘ sound under suitable assumptions ⓘ |
| relatedTo |
abstraction techniques
ⓘ
assume-guarantee model checking ⓘ compositional temporal logic reasoning ⓘ interface theories ⓘ |
| requires |
component interfaces
ⓘ
specifications of components ⓘ system decomposition ⓘ |
| usedFor |
proving system correctness
ⓘ
reducing state-space explosion ⓘ scalable verification ⓘ verifying complex systems ⓘ |
| uses |
automata-based representations
ⓘ
temporal logic specifications ⓘ transition system models ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.