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...
Principais autores: | Antonino, P, Gibson-Robinson, T, Roscoe, A |
---|---|
Formato: | Journal article |
Publicado em: |
Springer
2019
|
Registros relacionados
-
Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
por: Antonino, P, et al.
Publicado em: (2019) -
Efficient deadlock freedom checking using local analysis and SAT checking
por: Antonio, P, et al.
Publicado em: (2016) -
The automatic detection of token structures and invariants using SAT checking
por: Antonino, P, et al.
Publicado em: (2017) -
SAT solving in CSP trace refinement
por: Palikareva, H, et al.
Publicado em: (2012) -
SAT−solving in CSP trace refinement
por: Palikareva, H, et al.
Publicado em: (2011)