ACM Home Page
Please provide us with feedback. Feedback
Software assurance by bounded exhaustive testing
Full text PdfPdf (203 KB)
Source International Symposium on Software Testing and Analysis archive
Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis table of contents
Boston, Massachusetts, USA
SESSION: Testing II table of contents
Pages: 133 - 142  
Year of Publication: 2004
ISBN:1-58113-820-2
Also published in ...
Authors
Kevin Sullivan  University of Virginia
Jinlin Yang  University of Virginia
David Coppit  The College of William & Mary
Sarfraz Khurshid  MIT
Daniel Jackson  MIT
Sponsors
SIGSOFT: ACM Special Interest Group on Software Engineering
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 155,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1007512.1007531
What is a DOI?

ABSTRACT

The contribution of this paper is an experiment that shows the potential value of a combination of selective reverse engineering to formal specifications and bounded exhaustive testing to improve the assurance levels of complex software. A key problem is to scale up test input generation so that meaningful results can be obtained. We present an approach, using Alloy and TestEra for test input generation, which we evaluate by experimental application to the Galileo dynamic fault tree analysis tool.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Bayardo, R. J. Jr. and Schrag, R. C. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference (AAAI-97/IAAI-97), pages 203--208, Menlo Park, July 27-31 1997. AAAI Press.
 
2
3
 
4
5
 
6
Chilenski, J. J., and Miller, S. P. Applicability of modified condition/decision coverage to software testing. Software Engineering Journal, 9(5):191--200.
 
7
8
 
9
 
10
 
11
 
12
 
13
 
14
Dugan, J. B., Bavuso, S., and Boyd, M. Dynamic fault-tree models for fault-tolerant computer systems. IEEE Transactions on Reliability, 41(3):363--77, Sept. 1992.
 
15
Dugan, J. B., Sullivan, K. J., and Coppit, D. Developing a low-cost high-quality software tool for dynamic fault tree analysis. In IEEE Transactions on Reliability, December 1999.
 
16
Dugan, J. B., Venkataraman, B., and Gulati, R. DIFTree: A software package for the analysis of dynamic fault tree models. In Annual Reliability and Maintainability Symposium 1997 Proceedings, Philadelphia, PA, January 1997.
17
18
19
 
20
Havelund, K. and Pressburger, T. Model checking Java programs using Java PathFinder. International Journal on Software Tools for Technology Transfer, 1999.
 
21
 
22
 
23
Jackson, D. Micromodels of software: Modelling and analysis with Alloy. 2001. http://sdg.lcs.mit.edu/alloy/reference-man-ual. pdf
24
 
25
Khurshid, S., Marinov, D., Shlyakhter, I., Jackson, D. A Case for Efficient Solution Enumeration. Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), S. Margherita Ligure - Portofino (Italy), May 2003.
 
26
Khurshid, S., and Marinov, D. "Checking a Java implementation of a naming architecture using TestEra," In Post-CAV Workshop on Software Model Checking, volume 55(3) of Electronic Notes in Theoretical Computer Science (ENTCS), Paris, France, July 2001. Elsevier Science.
 
27
Khurshid, S., and Pasareanu, C., "Generalized symbolic execution for model checking and testing, " 9th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS), Warsaw, Poland, April, 2003.
28
 
29
 
30
Lions, J.L., Ariane 5: Flight 501 Failure, Report by the Inquiry Board, Paris, 1996.
 
31
MacColl, I., Carrington, D., and Stocks, P. An Experiment in Specification-based Testing. Technical Report No. 96-05, Software Verification Research Centre, Department of Computer Science, The University of Queensland. May 1996.
 
32
 
33
Marinov, D., A. Andoni, D. Daniliuc, S. Khurshid, and M. Rinard, "An evaluation of exhaustive testing for data structures," MIT Computer Science and Artificial Intelligence Laboratory Report MIT -LCS-TR-921, September, 2003.
34
 
35
Offutt, J., and Abdurazik, A. Generating Test from UML Specifications. In UML conference proceedings, Fort Collins, CO, October 1999.
 
36
 
37
 
38
Schwartz, E. Design and implementation of intentional names. Master's thesis, MIT Laboratory for Computer Science, Cambridge, MA, June 1999.
 
39
Shlyakhter, L. Generating effective symmetry-breaking predicates for search problems. In Proc. Workshop on Theory and Applications of Satisfiability Testing. June 2001.
 
40
 
41
 
42
 
43
Sun Microsystems. Java 2 Platform, Standard Edition, v1.3.1 API Specification. http://java.sun.com/j2se/1.3/docs/api/
 
44
Vesely, W. E., Goldberg, F. F., Roberts, N. H., and Haasl, D. F. Fault Tree Handbook. U. S. Nuclear Regulatory Commission, NUREG-0492, Washington DC, 1981.
 
45
Weyuker, E. J., and Ostrand, T. J. Theories of program testing and the the application of revealing subdomains. IEEE Transactions on Software Engineering, 6(3):236--246, May 1980.

CITED BY  7

Collaborative Colleagues:
Kevin Sullivan: colleagues
Jinlin Yang: colleagues
David Coppit: colleagues
Sarfraz Khurshid: colleagues
Daniel Jackson: colleagues