ACM Home Page
Please provide us with feedback. Feedback
Testing web database applications
Full text PdfPdf (111 KB)
Source ACM SIGSOFT Software Engineering Notes archive
Volume 29 ,  Issue 5  (September 2004) table of contents
SECTION: Workshop on testing, analysis and verification of web services (TAV-WEB) papers table of contents
Pages: 1 - 10  
Year of Publication: 2004
ISSN:0163-5948
Authors
Yuetang Deng  Polytechnic University, Six Metrotech Center, Brooklyn NY
Phyllis Frankl  Polytechnic University, Six Metrotech Center, Brooklyn NY
Jiong Wang  Donghua University, Shanghai, P. R. China
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 28,   Downloads (12 Months): 251,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Commercial, scientific, and social activities are increasingly becoming dependent on Web database applications. New testing techniques that handle the unique features of these systems are needed. To that end, we have extended AGENDA, a tool set for testing relational database applications, to test web database applications. Application source code is analyzed to extract relevant information about the URLs and their parameters. This information is used to construct and simplify a graph in which nodes represent URLs and edges represent links between URLs. A set of paths through the graph is selected and test cases are generated for each path. The extracted information about the parameters to each URL (e.g., values that an application user would enter into a form), is used to guide AGENDA to generate inputs for the URLs. The URLs on a path and their inputs are stored in an XML file, which is then automatically executed. The current implementation is targeted toward web applications written as Java Servlets and uses an algorithm based on cyclomatic complexity to generate paths. Preliminary empirically evaluation based on the TPC-W benchmark is presented.


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
M. Benedikt, J. Freire, and P. Godefroid. Veriweb: Automatically testing dynamic web sites. In 11th International World Wide Web Conference. ACM Press, 2002.
 
2
BIGSF. Government Web Application Integrity. The Business Internet Group of San Francisco, 2003.
 
3
4
 
5
 
6
 
7
 
8
9
 
10
Jakarta Commons HttpClient. http://jakarta.apache.org/commons/httpclient/. 2003.
 
11
 
12
T. McCabe. A complexity measure. IEEE Transactions on Software Engineering, Dec. 1976.
 
13
M. Morrison and J. Morrison. Database-Driven Web Sites. Course Technology, 2003.
14
 
15
16
 
17
Transaction Processing Performance Council. TPC-Benchmark W. www.tpc.org, 2002.
 
18
 
19
Y. Wu and J. Offutt. Modeling and testing web-based applications. In CS Technical Report. George Mason University, 2002.

CITED BY  6

Collaborative Colleagues:
Yuetang Deng: colleagues
Phyllis Frankl: colleagues
Jiong Wang: colleagues