Thread-Modular Counterexample-Guided Abstraction Refinement

Malkis, Alexander; Podelski, Andreas; Rybalchenko, Andrey

doi:10.1007/978-3-642-15769-1_22

Cited by 12 publications

(9 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For each example, the number of states in its local state graphs are shown. phil peterson.3 syzmanski.4 Mono (9,9,9,9) (2627, 2421, 2745) (4311, 4415, 4383, 4352) TMMC (16,16,16,16) (2997, 2952, 2952) (5875, 6125, 6250, 6375) LS3 (9,9,9,9) (2627, 2421, 2745) (5201, 5453, 5598, 5755) 2. Numbers without being labeled with * indicate either the local properties hold in the local SGs for the corresponding processes or no local properties are defined.…”

Section: Resultsmentioning

confidence: 99%

“…A similar approach to asynchronous circuit verification is presented in [19]. Lately, [16] presents an abstraction refinement extension to make the thread modular approach complete. On the other hand, the completeness of our framework is achieved by searching the global state space with partial order reduction helped with the information extracted from the local state transitions models.…”

Section: Related Workmentioning

confidence: 98%

See 1 more Smart Citation

Local state space construction for compositional verification of concurrent systems

Zheng

2014

Proceedings of the 2014 International SPIN Symposium on Model Checking of Software

View full text Add to dashboard Cite

Local state space construction is crucial for efficient compositional verification of local and global properties of concurrent systems. This paper presents such an approach where local state transition models are built by iteratively searching the joint state space of communicating processes. The resulting local models contain less unreachable states, which would reduce false counter-examples for verifying local safety properties. Alternatively, more precise transition dependence relations can be extracted from these local models for more effective partial order reduction when the global state space is searched. The prototype of this approach has been implemented in an explicit model checker, and experimented on several concurrent examples. The initial results are encouraging.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 98%

Local state space construction for compositional verification of concurrent systems

Zheng

2014

Proceedings of the 2014 International SPIN Symposium on Model Checking of Software

View full text Add to dashboard Cite

show abstract

“…Addressing the control state explosion resulting from concurrency poses a signi cant challenge to concurrent program veri cation. Several techniques have recently been studied to overcome this problem, including stateless model checking [1,4,9,24], compositional reasoning [14,22,29,32], bounded model checking [3,10,20,25,38,43], and abstraction re nement [11,12,21,29,35], etc. e general idea of stateless model checking is to employ partial order reduction (POR) or dynamic partial order reduction (DPOR) [1,4,9,41] to explore only non-redundant interleavings.…”

Section: Related Workmentioning

confidence: 99%

On Scheduling Constraint Abstraction for Multi-Threaded Program Verification

Yin

Dong

Liu

et al. 2020

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Bounded model checking is among the most e cient techniques for the automatic veri cation of concurrent programs. However, encoding all possible interleavings o en requires a huge and complex formula, which signi cantly limits the salability. is paper proposes a novel and e cient abstraction re nement method for multi-threaded program veri cation. Observing that the huge formula is usually dominated by the exact encoding of the scheduling constraint, this paper proposes a scheduling constraint based abstraction re nement method, which avoids the huge and complex encoding of BMC. In addition, to obtain an e ective re nement, we have devised two graph-based algorithms over event order graph for counterexample validation and re nement generation, which can always obtain a small yet e ective re nement constraint. Enhanced by two constraint-based algorithms for counterexample validation and re nement generation, we have proved that our method is sound and complete w.r.t. the given loop unwinding depth. Experimental results on SV-COMP 2017 benchmarks indicate that our method is promising and signi cantly outperforms the existing state-of-the-art tools.CCS Concepts: •So ware and its engineering → So ware veri cation and validation;

show abstract

“…Thread modular analyses [8,9,10] can analyze each thread separately, but either require user-defined annotations denoting some invariants or try to infer them automatically, limiting their scalability and precision. Recently, Malkis et al [19] proposed a threadmodular abstraction refinement technique where the set of reachable "global states" is computed as the cartesian abstraction of sets of reachable "local" states. If a global state is infeasible, an abstraction refinement step excludes it from the cartesian abstraction.…”

Section: Related Workmentioning

confidence: 99%

Dataflow Analysis for Datarace-Free Programs

D’Souza

Nasre

2011

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Memory models for shared-memory concurrent programming languages typically guarantee sequential consistency (SC) semantics for datarace-free (DRF) programs, while providing very weak or no guarantees for non-DRF programs. In effect programmers are expected to write only DRF programs, which are then executed with SC semantics. With this in mind, we propose a novel scalable solution for dataflow analysis of concurrent programs, which is proved to be sound for DRF programs with SC semantics. We use the synchronization structure of the program to propagate dataflow information among threads without requiring to consider all interleavings explicitly. Given a dataflow analysis that is sound for sequential programs and meets certain criteria, our technique automatically converts it to an analysis for concurrent programs.

show abstract

Thread-Modular Counterexample-Guided Abstraction Refinement

Cited by 12 publications

References 24 publications

Local state space construction for compositional verification of concurrent systems

Local state space construction for compositional verification of concurrent systems

On Scheduling Constraint Abstraction for Multi-Threaded Program Verification

Dataflow Analysis for Datarace-Free Programs

Contact Info

Product

Resources

About