Semantic Reduction of Thread Interleavings in Concurrent Programs

Kahlon, Vineet; Sankaranarayanan, Sriram; Gupta, Aarti

doi:10.1007/978-3-642-00768-2_12

Cited by 26 publications

(29 citation statements)

References 26 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Category 3. The verification framework proposed by Kahlon et al [11] uses static analysis together with abstract interpretation to eliminate redundant thread interleavings. As the first step, the framework creates a transaction graph for a given program using a simple approach to partial order reduction.…”

Section: Related Workmentioning

confidence: 99%

Approximating happens-before order: interplay between static analysis and state space traversal

Parízek

Jančík

2014

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

View full text Add to dashboard Cite

Techniques and tools for verification of multi-threaded programs must cope with the huge number of possible thread interleavings. Tools based on systematic exploration of a program state space employ partial order reduction to avoid redundant thread interleavings. The key idea is to make non-deterministic thread scheduling choices only at statements that read or modify the global state shared by multiple threads. We focus on the approach to partial order reduction used in tools such as Java Pathfinder (JPF), which construct the program state space on-the-fly, and therefore can use only information available in the current program state and execution history to identify statements that may be globally-relevant.In our previous work, we developed a field access analysis that provides information about fields that may be accessed during program execution, and used it in JPF for more precise identification of globally-relevant statements. We build upon that and propose a may-happen-before analysis that computes a sound approximation of the happens-before ordering. Partial order reduction techniques can use the happens-before ordering to detect pairs of globallyrelevant field access statements that cannot be interleaved arbitrarily (due to thread synchronization), and based on that avoid making unnecessary thread scheduling choices. The may-happen-before analysis combines static analysis with knowledge of information available from the dynamic program state. Results of experiments with several Java programs show that usage of the may-happenbefore analysis further improves the performance of JPF.

show abstract

Section: Related Workmentioning

confidence: 99%

Approximating happens-before order: interplay between static analysis and state space traversal

Parízek

Jančík

2014

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

View full text Add to dashboard Cite

show abstract

“…Likewise, Kahlon et al present a framework for the abstract interpretation of multi-threaded programs with finitely-many threads. Therein, a melding operator is used to model the effect of an interfering thread on the abstract state of the current thread [24].…”

Section: Related Workmentioning

confidence: 99%

“…These constructs can be handled using the framework of transaction delineation presented by Kahlon et al [24]. Here, a singlethreaded sequential analysis pass is first carried out to identify sections of the program which can be executed "atomically" while safely ignoring the interferences by the remaining threads.…”

Section: Related Workmentioning

confidence: 99%

Invariant Generation for Parametrized Systems Using Self-reflection

et al. 2012

Self Cite

View full text Add to dashboard Cite

Abstract. We examine the problem of inferring invariants for parametrized systems. Parametrized systems are concurrent systems consisting of an a priori unbounded number of process instances running the same program. Such systems are commonly encountered in many situations including device drivers, distributed systems, and robotic swarms. In this paper we describe a technique that enables leveraging off-the-shelf invariant generators designed for sequential programs to infer invariants of parametrized systems. The central challenge in invariant inference for parametrized systems is that naïvely exploding the transition system with all interleavings is not just impractical but impossible. In our approach, the key enabler is the notion of a reflective abstraction that we prove has an important correspondence with inductive invariants. This correspondence naturally gives rise to an iterative invariant generation procedure that alternates between computing candidate invariants and creating reflective abstractions.

show abstract

“…The proposed data race detection technique has been implemented in the CoBE framework [12] for analysis of concurrent C programs being developed at NEC. All the experiments were performed on an Intel Core Duo 1.86Ghz machine with 1GB memory, running Linux.…”

Section: Algorithm 2 Thread Order Analysismentioning

confidence: 99%

“…Our approach has been implemented in the CoBE framework [12] for analyzing multi-threaded C programs. Section 2 presents a motivating example program which combines thread and indirect asynchronous call models.…”

Section: Introductionmentioning

confidence: 99%

Static data race detection for concurrent programs with asynchronous calls

Kahlon

Sinha

Kruus

et al. 2009

Proceedings of the 7th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Found

Self Cite

View full text Add to dashboard Cite

A large number of industrial concurrent programs are being designed based on a model which combines threads with event-based communication. These programs consist of several threads which perform computation by dispatching tasks to other threads via asynchronous function calls. These asynchronous function calls are implemented using function objects, which are essentially wrappers containing a pointer to the function that should be executed on a particular thread with the corresponding arguments. In many cases, the arguments, in turn, contain function objects which serve as callbacks. Verifying such programs which involves reasoning about complex concurrency constructs comprising function pointers and callback functions is extremely tricky especially in the presence of recursion. In this paper, we present a fast and accurate static data race detection technique for multi-threaded C programs with asynchronous function calls and demonstrate its application to real-life software.

show abstract

Semantic Reduction of Thread Interleavings in Concurrent Programs

Cited by 26 publications

References 26 publications

Approximating happens-before order: interplay between static analysis and state space traversal

Approximating happens-before order: interplay between static analysis and state space traversal

Invariant Generation for Parametrized Systems Using Self-reflection

Static data race detection for concurrent programs with asynchronous calls

Contact Info

Product

Resources

About