Automated systematic testing for constraint-based interactive services

Authors:
Patrice Godefroid;Lalita J. Jagadeesan;Radha Jagadeesan;Konstantin Läufer
Affiliations:
Software Production Research Dept, Bell Laboratories, Lucent Technologies, Naperville, IL;Dept. of Mathematical and Computer Sciences, Loyola University Chicago, Chicago, IL;-;Dept. of Mathematical and Computer Sciences, Loyola University Chicago, Chicago, IL
Venue:
SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
Year:
2000

Citing 14
Cited 5

Communicating sequential processes

Communicating sequential processes
Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Communication and concurrency

Communication and concurrency
Concurrent constraint programming

Concurrent constraint programming
Model checking for programming languages using VeriSoft

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking without a model: an analysis of the heart-beat monitor of a telephone switch using VeriSoft

Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Automatically closing open reactive programs

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Filter-based model checking of partial systems

SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem

Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Program Flow Analysis: Theory and Application

Program Flow Analysis: Theory and Application
Better Verification Through Symmetry

CHDL '93 Proceedings of the 11th IFIP WG10.2 International Conference sponsored by IFIP WG10.2 and in cooperation with IEEE COMPSOC on Computer Hardware Description Languages and their Applications
Design and Implementation of Triveni: a Process-algebraic API for Threads + Events

ICCL '98 Proceedings of the 1998 International Conference on Computer Languages

A scalable formal method for design and automatic checking of user interfaces

ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
A Constraint-Based Framework for Prototyping Distributed Virtual Applications

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
A scalable formal method for design and automatic checking of user interfaces

ACM Transactions on Software Engineering and Methodology (TOSEM)
Software Model Checking: The VeriSoft Approach

Formal Methods in System Design
Model Testing Asynchronously Communicating Objects using Modulo AC Rewriting

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

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.