DMCA
TestEra: A Novel Framework for Automated Testing of Java Programs (2001)
Cached
Download Links
- [www.mit.edu]
- [www.ece.utexas.edu]
- [ase.informatik.uni-essen.de]
- [ase.cs.uni-essen.de]
- [www.ase-conferences.org]
- [sdg.lcs.mit.edu]
- [sdg.csail.mit.edu]
- [users.ece.utexas.edu]
- [ase-conferences.org]
- [www.cybertester.com]
- [ase.cs.uni-essen.de]
- [users.ece.utexas.edu]
- [www.mit.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 115 - 32 self |
BibTeX
@MISC{Marinov01testera:a,
author = {Darko Marinov and Sarfraz Khurshid},
title = {TestEra: A Novel Framework for Automated Testing of Java Programs},
year = {2001}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present TestEra, a novel framework for automated testing of Java programs. TestEra automatically generates all non-isomorphic test cases, within a given input size, and evaluates correctness criteria. As an enabling technology, TestEra uses Alloy, a first-order relational language, and the Alloy Analyzer. Checking a program with TestEra involves modeling the correctness criteria for the program in Alloy and specifying abstraction and concretization translations between instances of Alloy models and Java data structures. TestEra produces concrete Java inputs as counterexamples to violated correctness criteria. This paper discusses TestEra's analyses of several case studies: methods that manipulate singly linked lists and red-black trees, a naming architecture, and a part of the Alloy Analyzer.
Keyphrases
novel framework java program automated testing correctness criterion alloy analyzer non-isomorphic test case concretization translation present testera input size several case study concrete java input first-order relational language red-black tree alloy model naming architecture java data structure
