pith. sign in

arxiv: 1009.3713 · v1 · pith:KG6V5HYRnew · submitted 2010-09-20 · 💻 cs.SE · cs.DB

Relational Constraint Driven Test Case Synthesis for Web Applications

classification 💻 cs.SE cs.DB
keywords applicationsrelationalalgorithmconstraintdrivensynthesistechniquetest
0
0 comments X
read the original abstract

This paper proposes a relational constraint driven technique that synthesizes test cases automatically for web applications. Using a static analysis, servlets can be modeled as relational transducers, which manipulate backend databases. We present a synthesis algorithm that generates a sequence of HTTP requests for simulating a user session. The algorithm relies on backward symbolic image computation for reaching a certain database state, given a code coverage objective. With a slight adaptation, the technique can be used for discovering workflow attacks on web applications.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.