Automated Systematic Testing for Constraint-Based Interactive Services

Patrice Godefroid; Lalita Jategaonkar Jagadeesan; Radha Jagadeesan; Konstantin Laufer; Konstantin Läufer

doi:10.1145/355045.355051

Automated Systematic Testing for Constraint-Based Interactive Services

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

Research output: Contribution to journal › Article › peer-review

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.

Original language	American English
Journal	Computer Science: Faculty Publications and Other Works
Volume	25
Issue number	6
DOIs	https://doi.org/10.1145/355045.355051
State	Published - Nov 1 2000

Keywords

Constraint-Based Languages
Verification
Testing
Model Checking
Interactive Services
State Explosion
State-Space Reduction

Disciplines

Computer Sciences

Access to Document

10.1145/355045.355051License: Unspecified

Automated Systematic Testing for Constraint-Based Interactive SerFinal published version, 199 KBLicense: Unspecified

Cite this

@article{80a4ecce52dc4f3d97664de4a464aa47,

title = "Automated Systematic Testing for Constraint-Based Interactive Services",

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.",

keywords = "Constraint-Based Languages, Verification, Testing, Model Checking, Interactive Services, State Explosion, State-Space Reduction",

author = "Patrice Godefroid and \{Jategaonkar Jagadeesan\}, Lalita and Radha Jagadeesan and Konstantin Laufer and Konstantin L{\"a}ufer",

note = "P. Godefroid, L. J. Jagadeesan, R. Jagadeesan, and K. L{\"a}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.",

year = "2000",

month = nov,

day = "1",

doi = "10.1145/355045.355051",

language = "American English",

volume = "25",

journal = "Computer Science: Faculty Publications and Other Works",

number = "6",

}

TY - JOUR

T1 - Automated Systematic Testing for Constraint-Based Interactive Services

AU - Godefroid, Patrice

AU - Jategaonkar Jagadeesan, Lalita

AU - Jagadeesan, Radha

AU - Laufer, Konstantin

AU - Läufer, Konstantin

N1 - 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.

PY - 2000/11/1

Y1 - 2000/11/1

N2 - 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.

AB - 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.

KW - Constraint-Based Languages

KW - Verification

KW - Testing

KW - Model Checking

KW - Interactive Services

KW - State Explosion

KW - State-Space Reduction

UR - https://ecommons.luc.edu/cs_facpubs/59

U2 - 10.1145/355045.355051

DO - 10.1145/355045.355051

M3 - Article

VL - 25

JO - Computer Science: Faculty Publications and Other Works

JF - Computer Science: Faculty Publications and Other Works

IS - 6

ER -

Automated Systematic Testing for Constraint-Based Interactive Services

Abstract

Keywords

Disciplines

Access to Document

Other files and links

Cite this