Checking Static Properties Using Conservative SAT Approximations for Reachability

Antonino, Pedro; Gibson−Robinson, Thomas; Roscoe, A. W.

doi:10.1007/978-3-319-70848-5_15

Cited by 4 publications

(6 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We measure in seconds the time taken to check (local-)deadlock freedom for each system The symbol * means that the method took longer than 300 s, or an error, such as running out of memory, occurred The symbol -means that the method is unable to prove deadlock freedom This strategy should be applied when these subsystems are small and easy to identify. Some works have proposed the techniques to find global reachability invariants [Mar96,CK94,DCCN04,AGRR16b,AGRR17b]. In [AGRR16b, AGRR17b, Ant18], we propose some techniques to estimate global reachability and a framework that integrates local analysis (in the form of 2-reachability) and these global-analysis techniques to verify systems.…”

Section: Resultsmentioning

confidence: 99%

“…The use of conditions that are specific to a property makes these frameworks difficult to adapt for further properties. Conversely, we show in [AGRR17b] how approaches based on replacing exact reachability by approximations, such the one presented here, can be easily adapted to verify properties other than deadlock.…”

Section: Related Workmentioning

confidence: 99%

“…2. We point out that we have studied a number of ways to effectively combine the sort of local-analysis-based approximations presented in this work with techniques deriving global invariants [AGRR16b,AGRR17a,AGRR17b] and intend to cover these in sequels to this paper.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving

2019

Self Cite

View full text Add to dashboard Cite

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 components to approximate system reachability and propose a new sound but incomplete/approximate framework that checks deadlock and local-deadlock freedom. By replacing exact reachability by this approximation, it looks for deadlock (or local-deadlock) candidates, namely, blocked (locally-blocked) system states that lie within our approximation. This characterisation improves on the precision of current approximate techniques. In particular, it can tackle non-hereditary deadlock-free systems, namely, deadlock-free systems that have a deadlocking subsystem. These are neglected by most approximate techniques. Furthermore, we demonstrate how SAT checkers can be used to efficiently implement our framework, which, typically, scales better than current techniques for deadlock-freedom analysis. This is demonstrated by a series of practical experiments.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving

2019

Self Cite

View full text Add to dashboard Cite

show abstract

“…We point out, however, that synchronisation analysis, and the approximations they capture, can be easily fitted into a framework to check more general properties. In [5], we propose a framework that relies on (some of) the reachability approximations presented here to check static properties, namely, properties that can be naturally formulated as "a system cannot reach a state in which it can perform a given combination of events". Many other frameworks rely instead on necessary conditions that are inherent to the properties they check [42,63,64].…”

Section: Related Workmentioning

confidence: 99%

Efficient Verification of Concurrent Systems Using Synchronisation Analysis and SAT/SMT Solving

Antonino

Gibson−Robinson

Roscoe

2019

ACM Trans. Softw. Eng. Methodol.

Self Cite

View full text Add to dashboard Cite

This paper investigates how the use of approximations can make the formal verification of concurrent system scalable. We propose the idea of synchronisation analysis to automatically capture global invariants and approximate reachability. We calculate invariants on how components participate on global system synchronisations and use a notion of consistency between these invariants to establish whether components can effectively communicate to reach some system state. Our synchronisationanalysis techniques try to show either that a system state is unreachable by demonstrating that components cannot agree on the order they participate in system rules, or that a system state is unreachable by demonstrating components cannot agree on the number of times they participate on system rules. These fully automatic techniques are applied to check deadlock and local-deadlock freedom in the PairStatic framework. It extends Pair (a recent framework where we use pure pairwise analysis of components and SAT checkers to check deadlock and local-deadlock freedom) with techniques to carry out synchronisation analysis. So, not only can it compute the same local invariants that Pair does, it can leverage global invariants found by synchronisation analysis, thereby improving the reachability approximation and tightening our verifications. We implement PairStatic in our DeadlOx tool using SAT/SMT and demonstrate the improvements they create in checking (local-)deadlock freedom. CCS Concepts: • Theory of computation → Concurrency; Invariants; • Software and its engineering → Model checking; Automated static analysis;

show abstract

“…One common way to cope with the state space explosion problem is to use local analysis [5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20]. Instead of checking the entire state space of the concurrent system, the analysis of small combinations of components is carried out to determine whether a system is deadlock free.…”

Section: Introductionmentioning

confidence: 99%

A Pattern-based deadlock-freedom analysis strategy for concurrent systems

Antonino¹,

Sampaio²,

Woodcock³

2022

Preprint

Self Cite

View full text Add to dashboard Cite

Local analysis has long been recognised as an effective tool to combat the state-space explosion problem. In this work, we propose a method that systematises the use of local analysis in the verification of deadlock freedom for concurrent and distributed systems. It combines a strategy for system decomposition with the verification of the decomposed subsystems via adherence to behavioural patterns. At the core of our work, we have a number of CSP refinement expressions that allows the user of our method to automatically verify all the behavioural restrictions that we impose. We also propose a prototype tool to support our method. Finally, we demonstrate the practical impact our method can have by analysing how it fares when applied to some examples.

show abstract

Checking Static Properties Using Conservative SAT Approximations for Reachability

Cited by 4 publications

References 18 publications

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving

Efficient Verification of Concurrent Systems Using Synchronisation Analysis and SAT/SMT Solving

A Pattern-based deadlock-freedom analysis strategy for concurrent systems

Contact Info

Product

Resources

About