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: | Antonino, P, Gibson-Robinson, T, Roscoe, A |
---|---|
格式: | Journal article |
出版: |
Springer
2019
|
相似书籍
-
Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
由: Antonino, P, et al.
出版: (2019) -
Efficient deadlock freedom checking using local analysis and SAT checking
由: Antonio, P, et al.
出版: (2016) -
The automatic detection of token structures and invariants using SAT checking
由: Antonino, P, et al.
出版: (2017) -
SAT solving in CSP trace refinement
由: Palikareva, H, et al.
出版: (2012) -
SAT−solving in CSP trace refinement
由: Palikareva, H, et al.
出版: (2011)