A class library for implementing, testing, and debugging concurrent programs

Carver, Richard H.; Lei, Yu

doi:10.1007/s10009-009-0102-9

Cited by 8 publications

(4 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Carver e Lei [Carver and Lei 2010] created a library called Modern Multithreading (MM) to develop, test and debug concurrent programs in C++ (using Pthreads) and Java. MM provides classes to create threads and synchronize objects, using both semaphores/monitors and synchronous/asynchronous message passing through channels.…”

Section: Related Studiesmentioning

confidence: 99%

“…In this same direction, other studies propose the deterministic execution in multithreaded systems without using trace files at all [Bergan et al 2010] [Liu et al 2011. Some studies addressing both the synchronization paradigms need the programmer to change the source code [Carver and Lei 2010] or a specific JVM [Konuru et al 2000]. Indeed, there are various proposals specific to a language, depending on the API of the operating system or changing the JVM.…”

Section: Related Studiesmentioning

confidence: 99%

See 1 more Smart Citation

Trace Generation and Deterministic Execution for Concurrent Programs

Souza¹,

Batista²,

Souza³

et al. 2016

Anais Do XVII Simpósio Em Sistemas Computacionais De Alto Desempenho (SSCAD 2016)

View full text Add to dashboard Cite

This paper proposes new algorithms for generation of trace ﬁles and deterministic execution of concurrent programs under test. The proposed algorithms are essential to automate the coverage testing of concurrent programs and allow to execute new synchronizations automatically, increasing the source code coverage with focus on non-determinism, and edges of communication and synchronization. Our algorithms consider programs with multiple paradigms of communication and synchronization (collective, blocking and non-blocking point-to-point message passing, and shared memory). We validate our algorithms by means of experiments based on nine representative benchmarks, which exercise non-trivial aspects of synchronization found in real applications. Our algorithms have a robust behaviour and meet their objectives. We also highlight the overhead generated with the algorithms.

show abstract

Section: Related Studiesmentioning

confidence: 99%

Section: Related Studiesmentioning

confidence: 99%

Trace Generation and Deterministic Execution for Concurrent Programs

Souza¹,

Batista²,

Souza³

et al. 2016

Anais Do XVII Simpósio Em Sistemas Computacionais De Alto Desempenho (SSCAD 2016)

View full text Add to dashboard Cite

show abstract

“…A vector timestamp has been used to determine the happen‐before relations between race receive events of SYN pair. A class library named Modern Multithreading was described in the literature for Java and C++ constituting thread and SYN classes to support testing and debugging of a concurrent program with shared variables, semaphore, asynchronous message passing, synchronous message passing, and monitors. For nondeterministic concurrent programs with an infinite number of possible interleavings, Che‐Sheng Lin et al proposed an approach that performed state‐cover testing and included the generation of partial order graph and event compression.…”

Section: Overview Of Studiesmentioning

confidence: 99%

A systematic review of approaches for testing concurrent programs

Arora

Bhatia

Singh

2015

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYConcurrent programs are replacing the sequential programs as they utilize the true capabilities of multicore architecture. The extensive use of multicore systems and multithreaded paradigms warrants more attention to the testing of the concurrent programs. The testing concurrent program is not a new field as it has been more than 40 years because the first problem related to the testing concurrent program was addressed by the researchers. The field covers various domains, which include concurrency problems, testing approaches, techniques, graphical representations, tools, and subject systems. This paper aims at providing an overview of research in the domain of testing concurrent programs by classifying it into eight categories: (a) reachability testing, (b) structural testing, (c) model-based testing, (d) mutation-based testing, (e) slicing-based testing, (f) formal methods, (g) random testing, and (h) search-based testing. The survey is focused on the techniques applied, methodologies followed, and tools used in these aforementioned approaches. Furthermore, the gaps are also identified in different approaches. The paper concludes with the consolidation of various testing parameters along with the future directions.

show abstract

“…The controller grants permission to a requesting thread only if that thread is supposed to perform the next event in the SR-sequence; otherwise, the thread is delayed. A complete description of controlled executions can be found in [3,9].…”

Section: Sr-sequences Of Message-passing Programsmentioning

confidence: 99%

Distributed reachability testing of concurrent programs

Carver

Lei

2010

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

SUMMARYReachability testing is an approach to verifying concurrent programs. During reachability testing, every partially ordered synchronization sequence of a program with a given input is exercised exactly once. In this paper, we present the design and implementation of a distributed reachability testing algorithm for a cluster of workstations. This algorithm allows different test sequences to be exercised concurrently by different workstations without any synchronization, and without any duplication of sequences among workstations. Dynamic load balancing is performed using a work-stealing scheme. A novel aspect of this scheme is that work-stealing requests progress in rounds. This round-based structure identifies overloaded workstations to target for work stealing. Empirical studies show good speedup for four benchmark Java programs and one Lotos specification.

show abstract

A class library for implementing, testing, and debugging concurrent programs

Cited by 8 publications

References 35 publications

Trace Generation and Deterministic Execution for Concurrent Programs

Trace Generation and Deterministic Execution for Concurrent Programs

A systematic review of approaches for testing concurrent programs

Distributed reachability testing of concurrent programs

Contact Info

Product

Resources

About