SYN-sequence selection strategy for testing concurrent programs based on little strong happened-before-Reference-Cited by-同舟云学术

SYN-sequence selection strategy for testing concurrent programs based on little strong happened-before

Published:2009-07-12 Issue:4 Volume:14 Page:317-320
ISSN:1007-1202
Container-title:Wuhan University Journal of Natural Sciences
language:en
Short-container-title:Wuhan Univ. J. Nat. Sci.

Author:

Pu Fangli,Lu Yansheng

Publisher

Springer Science and Business Media LLC

Subject

Multidisciplinary

Link

http://link.springer.com/content/pdf/10.1007/s11859-009-0407-2.pdf

Reference11 articles.

1. Lamport L. Time, Clocks, and the Ordering of Events in a Distributed System[J]. Communications of ACM, 1978, 1(1): 558–565.

2. Garg V K, Waldecker B. Detection of Strong Unstable Predicates in Distributed Programs[J]. IEEE Transaction on Parallel and Distributed Systems, 1996, 17(12): 1323–1333.

3. Bechini A, Tai K C. Timestamps for Programs Using Messages and Shared Variables[C]//Proc of the 18th International Conference on Distributed Computing System. Amsterdam: Netherlands Press, 1998: 266–273.

4. Hwang G H, Tai K C, Huang T L. Reachability Testing: An Approach to Testing Concurrent Software[J]. International Journal of Software Engineering and Knowledge Engineering, 1995, 5(4): 493–510.

5. Iyer S, Ramesh S. A Technique for Efficient Reachability Analysis of Concurrent Object-Oriented Programs[J]. IEEE Transactions on Software Engineering, 2001, 27(11): 1037–1056.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A systematic review of approaches for testing concurrent programs;Concurrency and Computation: Practice and Experience;2015-12-10