kirancodes.me
To Proof Maintenance & Beyond!
FSE 2000

Automated systematic testing for constraint-based interactive services

Patrice Godefroid, Lalita Jategaonkar Jagadeesan, Radha Jagadeesan, Konstantin Läufer

PDFDOI 10.1145/355045.355051dblp

Abstract

Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must support multiple types of interfaces for accessing the same data. These include automatic speech-recognition interfaces where inputs may be provided in any order by users of the service. We study in this paper how to systematically test event-driven applications developed using such languages. We show how such applications can be tested automatically, without the need for any manually-written test cases, and efficiently, by taking advantage of their capability of taking unordered sets of events as inputs.

BibTeX
@inproceedings{Godefroid-al:FSE00,
  author    = {Patrice Godefroid and
               Lalita Jategaonkar Jagadeesan and
               Radha Jagadeesan and
               Konstantin L{\"{a}}ufer},
  title     = {Automated systematic testing for constraint-based interactive services},
  booktitle = {FSE},
  pages     = {40--49},
  publisher = {{ACM}},
  year      = {2000},
}

Related papers