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.
P. Godefroid, L. J. Jagadeesan, R. Jagadeesan, and K. Läufer, Automated systematic testing for constraint-based interactive services, in Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications, ser. SIGSOFT '00/FSE-8. New York, NY, USA: ACM, 2000, pp. 40-49.
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.
Copyright © 2000 Patrice Godefroid, Lalita J. Jagadeesan, Radha Jagadeesan, and Konstantin Läufer