Verifying Class Invariants in Concurrent Programs

Zaharieva-Stojanovski, Marina; Huisman, Marieke

doi:10.1007/978-3-642-54804-8_16

Cited by 8 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, some dynamic invariants that are generated may not represent the concurrency related behavior. Marina et al, in [7] described class invariants as a condition on the shared memory. In this paper the validity of class invariants in a multi-threaded system is defined.…”

Section: Related Workmentioning

confidence: 99%

Concurrent Bug Detection Using Invariant Analysis

Sahoo¹,

Ray²

2018

IJET

View full text Add to dashboard Cite

In concurrent programs, bug detection is a tedious job due to non-determinism and multiple thread control. The bug detection is done by checking the interleaving of threads which is not available in operational phases. So, static analysis is one of the preferred approaches for detection of concurrent bug. Invariant based testing technique is one approach of static analysis used for detecting the concurrent bugs. In this paper, we discuss an invariant based testing approach using three steps: (i) the invariants of a given concurrent program are generated using Daikon tool. (ii) The bad invariants are removed by using the static call graph of the source code, where the static call graph is generated by the javacg tool. (iii) The reduced invariant set is obtained by eliminating the bad and redundant invariants which is used for testcase generation. Using the reduced invariant set, we generate the testcases that are used to find the various concurrent bugs such as Deadlock, Atomicity violation and Bad composition. We conducted an experiment on a well-known concurrent program called the Dining Philosopher Problem. The experimental results show that, the testcases obtained from the reduced invariant set is able to detect more types and no. of concurrent bugs than the existing approach on invariant based testing.

show abstract

Section: Related Workmentioning

confidence: 99%

Concurrent Bug Detection Using Invariant Analysis

Sahoo¹,

Ray²

2018

IJET

View full text Add to dashboard Cite

show abstract

“…Our uniform specifications of the different synchronisation mechanisms have appeared in PDP'14 [2]. The modular specification and verification technique for concurrent class invariants is published in FASE'14 [60]. Finally, the verification approach for OpenCL kernels is published in Bytecode'13 and in SCP [30,11].…”

Section: Introductionmentioning

confidence: 99%

Verification of Concurrent Systems with VerCors

Amighi

Blom

Darabi

et al. 2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

This paper presents the VerCors approach to verification of concurrent software. It first discusses why verification of concurrent software is important, but also challenging. Then it shows how within the VerCors project we use permission-based separation logic to reason about multithreaded Java programs. We discuss in particular how we use the logic to use different implementations of synchronisers in verification, and how we reason about class invariance properties in a concurrent setting. Further, we also show how the approach is suited to reason about programs using a different concurrency paradigm, namely kernel programs using the Single Instruction Multiple Data paradigm. Concretely, we illustrate how permission-based separation logic is suitable to verify functional correctness properties of OpenCL kernels. All verification techniques discussed in this paper are supported by the VerCors tool set.

show abstract