Efficient verification of comcurrent systems using local analysis based approximations and SAT solving
This work develops a type of local analysis that can prove concurrent systems deadlock free. As opposed to examining the overall behaviour of a system, local analysis consists of examining the behaviour of small parts of the system to yield a given property. We analyse pairs of interacting component...
| Main Authors: | , , |
|---|---|
| פורמט: | Journal article |
| יצא לאור: |
Springer
2019
|