Communicating sequential processes
Communicating sequential processes
Communication and concurrency
Proceedings of the Fourth Annual Symposium on Logic in computer science
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Debugging Concurrent Ada Programs by Deterministic Execution
IEEE Transactions on Software Engineering
Compositional reachability analysis using process algebra
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Structural Testing of Concurrent Programs
IEEE Transactions on Software Engineering
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Enhancing compositional reachability analysis with context constraints
SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
Using partial orders for the efficient verification of deadlock freedom and safety properties
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
An efficient transitive closure algorithm for cyclic digraphs
Information Processing Letters
A concurrency analysis tool suite for Ada programs: rationale, design, and preliminary experience
ACM Transactions on Software Engineering and Methodology (TOSEM)
Graph models for reachability analysis of concurrent programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
An incremental approach to structural testing of concurrent software
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Testing abstract distributed programs and their implementations: a constraint-based approach
Journal of Systems and Software - Special issue on software engineering for distributed computing
Incremental analysis and testing of distributed software systems
Incremental analysis and testing of distributed software systems
Test sequence generation and timed testing
Computer Networks and ISDN Systems - Special issue on protocol testing
Essential transitions to bisimulation equivalences
Theoretical Computer Science
Constructing compact models of concurrent Java programs
Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Use of Sequencing Constraints for Specification-Based Testing of Concurrent Programs
IEEE Transactions on Software Engineering
Bandera: extracting finite-state models from Java source code
Proceedings of the 22nd international conference on Software engineering
Communicating sequential processes
Communications of the ACM
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
Coverage Preserving Reduction Strategies for Reachability Analysis
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Model Checking Based on Simultaneous Reachability Analysis
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Compositional Minimization of Finite State Systems
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Specification-based testing of concurrent programs
ACM SIGSOFT Software Engineering Notes
Reachability Testing of Concurrent Programs
IEEE Transactions on Software Engineering
Evaluating test adequacy coverage of high level petri nets using spin
Proceedings of the 3rd international workshop on Automation of software test
Code based analysis for object-oriented systems
Journal of Computer Science and Technology
A methodology for evaluating test coverage criteria of high levelPetri nets
Information and Software Technology
Research in concurrent software testing: a systematic review
Proceedings of the Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging
Protocol system integration, interface and interoperability
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
An enhanced flow analysis technique for detecting unreachability faults in concurrent systems
Information Sciences: an International Journal
| Hi-index | 0.00 |
We present a method for selecting test sequences for concurrent programs from labeled transitions systems (LTS). A common approach to selecting test sequences from a set of LTSs is to derive a global LTS, called the reachability graph, and then force deterministic program executions according to paths selected from the graph. However, using a reachability graph for test path selection introduces a state explosion problem. To overcome this problem, a reduced graph can be generated using incremental reachability analysis, which consists of repeatedly generating a reachability graph for a subset of LTSs, reducing this graph, and using the reduced graph in place of the original LTSs. Unfortunately, existing incremental reachability analysis techniques generate reduced graphs with insufficient information for deterministic testing. In this paper, we present an incremental approach to testing concurrent programs. Incremental testing consists of incremental reachability analysis for test path selection and deterministic testing for test execution. We define a new type of reachability graph for incremental analysis, called an annotated labeled transition system (ALTS). An ALTS is an LTS annotated with information necessary for deterministic testing. We propose practical coverage criteria for selecting tests paths from an ALTS and present an ALTS reduction algorithm. The results of several case studies are reported.