Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Software testing and evaluation
Software testing and evaluation
A linear algorithm for finding dominators in flow graphs and related problems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Optimally profiling and tracing programs
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Generalized dominators and post-dominators
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Debugging with dynamic slicing and backtracking
Software—Practice & Experience
An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
Journal of the ACM (JACM)
A fast algorithm for finding dominators in a flowgraph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Immediate predominators in a directed graph [H]
Communications of the ACM
Art of Software Testing
Data Structures and Algorithms
Data Structures and Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Reducing and estimating the cost of test coverage criteria
Proceedings of the 18th international conference on Software engineering
Residual test coverage monitoring
Proceedings of the 21st international conference on Software engineering
Efficient coverage testing using global dominator graphs
Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Cryptographic Verification of Test Coverage Claims
IEEE Transactions on Software Engineering
Efficient instrumentation for code coverage testing
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
χSuds-SDL: A Tool for Testing Software Architecture Specifications
Software Quality Control
A static measure of a subset of intra-procedural data flow testing coverage based on node coverage
CASCON '99 Proceedings of the 1999 conference of the Centre for Advanced Studies on Collaborative research
?SUDS-SDL: A Tool for Diagnosis and Understanding Software Specifications
APSEC '99 Proceedings of the Sixth Asia Pacific Software Engineering Conference
Coverage testing software architectural design in SDL
Computer Networks: The International Journal of Computer and Telecommunications Networking - ITU-T system design languages (SDL)
Using Spanning Sets for Coverage Testing
IEEE Transactions on Software Engineering
Structural Testing Based on Minimum Kernels
Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Aspect language features for concern coverage profiling
Proceedings of the 4th international conference on Aspect-oriented software development
Coverage testing of Java programs and components
Science of Computer Programming - Special issue on new software composition concepts
A concept analysis inspired greedy algorithm for test suite minimization
PASTE '05 Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Faster WCET flow analysis by program slicing
Proceedings of the 2006 ACM SIGPLAN/SIGBED conference on Language, compilers, and tool support for embedded systems
A survey of coverage based testing tools
Proceedings of the 2006 international workshop on Automation of software test
Establishing structural testing criteria for Java bytecode
Software—Practice & Experience
Subsumption of program entities for efficient coverage and monitoring
Proceedings of the 3rd international workshop on Software quality assurance
An EFSM-based test generation for validation of SDL specifications
Proceedings of the 3rd international workshop on Automation of software test
An automatically-generated run-time instrumenter to reduce coverage testing overhead
Proceedings of the 3rd international workshop on Automation of software test
Model-based performance analysis using block coverage measurements
Journal of Systems and Software
Software Fault Localization Using N-gram Analysis
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Validation of SDL specifications using EFSM-based test generation
Information and Software Technology
ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
Identifying irreducible loops in the Instrumentation Point Graph
Journal of Systems Architecture: the EUROMICRO Journal
Jazz2: a flexible and extensible framework for structural testing in a Java VM
Proceedings of the 9th International Conference on Principles and Practice of Programming in Java
Using model checking for reducing the cost of test generation
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Dependence testing: extending data flow testing with control dependence
TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems
A scalable tool for efficient protocol validation and testing
Computer Communications
Validation of SDL-based architectural design models using communication-based coverage criteria
Information and Software Technology
Using static analysis for coverage extraction fromemulation/prototyping platforms
Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Static profiling of the worst-case in real-time programs
Proceedings of the 20th International Conference on Real-Time and Network Systems
Code coverage using intelligent water drop (IWD)
International Journal of Bio-Inspired Computation
Proceedings of the 2013 International Conference on Principles and Practices of Programming on the Java Platform: Virtual Machines, Languages, and Tools
| Hi-index | 0.00 |
In this paper we present techniques to find subsets of nodes of a flowgraph that satisfy the following property: A test set that exercises all nodes in a subset exercises all nodes in the flowgraph. Analogous techniques to find subsets of edges are also proposed. These techniques may be used to significantly reduce the cost of coverage testing of programs. A notion of a super block consisting of one or more basic blocks in that super block must be exercised by the same input. Dominator relationships among super blocks are used to identify a subset of the super blocks whose coverage implies that of all super blocks and, in turn, that of all basic blocks. Experiments with eight systems in the range of 1-75K lines of code show that, on the average, test cases targeted to cover just 29% of the basic blocks and 32% of the branches ensure 100% block and branch coverage, respectively.