Document Type

Conference Proceeding

Publication Date

11-2000

Publication Title

Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications

Volume

25

Issue

6

Pages

40-49

Publisher Name

ACM

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 effi- ciently, by taking advantage of their capability of taking unordered sets of events as inputs.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.

Share

COinS