All-du-path coverage for parallel programs

Yang, Cheer-Sun; Souter, Amie L.; Pollock, Lori

doi:10.1145/271775.271804

Cited by 35 publications

(28 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Yang al. [8] describe a Parallel Program Flow Graph (PPFG) to represent flows of concurrent programs. Chen et al [9] propose a hybrid approach to deal with atomicity violations by recording the data flow at runtime and using an intraprocedural static analysis to gather data from a source code.…”

Section: Related Workmentioning

confidence: 99%

Extracting static and dynamic structural information from java concurrent programs for coverage testing

Prado

Souza

Dourado

et al. 2015

2015 Latin American Computing Conference (CLEI)

View full text Add to dashboard Cite

This paper proposes novel techniques for the extraction of structural information from the source code of Java concurrent programs for their coverage testing. Such techniques differ from others because they consider synchronization flow among processes/threads, distinct paradigms of communication/synchronization, method calls and pointer manipulation. The structural information gathered from the source code is kept in a test model based on a Parallel Control Flow Graph (PCFG) and helps the generation of an instrumented source code, used for a future generation of trace files and to replay the concurrent execution. The results show the techniques can generate both an instrumented code and a PCFG for Java concurrent programs effectively, extracting static and runtime information required for structural testing.

show abstract

Section: Related Workmentioning

confidence: 99%

Extracting static and dynamic structural information from java concurrent programs for coverage testing

Prado

Souza

Dourado

et al. 2015

2015 Latin American Computing Conference (CLEI)

View full text Add to dashboard Cite

show abstract

“…Efforts to adequately test the basic unit of OO software, the class (or class cluster), have resulted in an abundance of IBTTs [1,3,15,16,20,21,28,31,32,39]. Each IBTT focuses on testing one or more of the properties associated with the features in the CUT and/or the dependencies between the CUT and other classes in the software system (Class Characteristics).…”

Section: Class Characteristicsmentioning

confidence: 99%

“…Test tuple generation techniques usually obtain test information during program analysis represented as tuples. These tuples represent either ordered pairs or ordered triples that represent line numbers associated with entities in the program that should be exercised during program testing [1,16,20,28,31,32,39]. Message sequence generation techniques usually involve some combination of program analysis, automatic deduction, and symbolic execution resulting in sequences of message calls to an object under test [3,21].…”

Section: Testing Techniquesmentioning

confidence: 99%

“…The low testability score for OO software is due mainly to the composition of OO systems exhibiting the features of abstraction, encapsulation, genericity, inheritance, and polymorphism [2,25,26,40]. To address the low testability of OO systems a plethora of OO testing techniques have been developed [1,3,15,16,20,21,28,31,32,39]. We would like to stress that although the number of testing techniques continues to grow, none of the current OO testing techniques attempt to unify existing techniques to produce a superior technique.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Tool to Automatically Map Implementation-Based Testing Techniques to Classes

Clarke

Ding

Babich

et al. 2006

Int. J. Soft. Eng. Knowl. Eng.

View full text Add to dashboard Cite

The object-oriented (OO) paradigm provides several benefits during analysis and design of large-scale software systems, but scores lower in terms of testability. The low testability score for OO software is due mainly to the composition of OO systems exhibiting the characteristics of abstraction, encapsulation, genericity, inheritance, polymorphism, concurrency and exception handling. To address the difficulty of testing the features of a class, a plethora of implementation-based testing techniques (IBTTs) have been developed. However, no one IBTT has emerged as the preferred technique to test the implementation of a class. In this paper we present a technique that automatically identify those IBTTs that are most suitable for testing a class based on the characteristics of that class. Our approach uses a taxonomy of OO classes that is used to succinctly abstract the characteristics of a class under test (CUT). We have implemented a tool that automates the process of mapping IBTTs to a class. In addition to identifying the IBTTs that would be best suited for testing a class, our tool provides feedback to the tester facilitating the identification of the characteristics of the class that are not suitably tested by any of the IBTTs in the list. We provide results of a study supporting the notion that using more than on IBTT during testing improves test coverage of a CUT.

show abstract

“…However, testing only provides a small degree of behavioral coverage of a system, especially for concurrent systems, where testing has limited control over thread scheduling [43,70]. Static analysis has better success dealing with concurrency, but it can be challenging to obtain accurate results [49].…”

Section: Introductionmentioning

confidence: 99%

Verifying Time Partitioning in the DEOS Scheduling Kernel

Penix

Visser

Park

et al. 2005

Form Method Syst Des

View full text Add to dashboard Cite

This paper describes an experiment to use the Spin model checking system to support automated verification of time partitioning in the Honeywell DEOS real-time scheduling kernel. The goal of the experiment was to investigate whether model checking with minimal abstraction could be used to find a subtle implementation error that was originally discovered and fixed during the standard formal review process. The experiment involved translating a core slice of the DEOS scheduling kernel from C++ into Promela, constructing an abstract "test-driver" environment and carefully introducing several abstractions into the system to support verification. Attempted verification of several properties related to time-partitioning led to the rediscovery of the known error in the implementation. The case study indicated several limitations in existing tools to support model checking of software. The most difficult task in the original DEOS experiment was constructing an adequate environment to close the system for verification. The fidelity of the environment was of crucial importance for achieving meaningful results during model checking. In this paper, we describe the initial environment modeling effort and a follow-on experiment with using semi-automated environment generation methods. Program abstraction techniques were also critical for enabling verification of DEOS. We describe an implementation scheme for predicate abstraction, an approach based on abstract interpretation, which was developed to support DEOS verification.

show abstract

All-du-path coverage for parallel programs

Cited by 35 publications

References 18 publications

Extracting static and dynamic structural information from java concurrent programs for coverage testing

Extracting static and dynamic structural information from java concurrent programs for coverage testing

A Tool to Automatically Map Implementation-Based Testing Techniques to Classes

Verifying Time Partitioning in the DEOS Scheduling Kernel

Contact Info

Product

Resources

About