Toward automatic generation of novice user test scripts
Published 1 January 1996Open access
David J. Kasik, Harry G. George
Citations68
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper considers a subset of GUI-based application testing: how to exercise an application like a novice user, and discusses different solutions and a specific implementation that uses genetic algorithms to automatically generate user events in an unpredictable yet controlled manner to produce novice-like test scripts.
Abstract
Graphical user interfaces (GUI's) make applications easier to learn and use. At the same time, they make application design, construction, and especially test more difficult because user-directed dialogs increase the number of potential execution paths. This paper considers a subset of GUI-based application testing: how to exercise an application like a novice user. We discuss different solutions and a specific implementation that uses genetic algorithms to automatically generate user events in an unpredictable yet controlled manner to produce novice-like test scripts.
Keywords
Computer Science
Artificial intelligenceGenetic Algorithms + Data Structures = Evolution Programs
11,598 Citations1992Zbigniew Michalewicz
Genetic Algorithms + Data Structures = Evolution Programs
2,151 Citations1994Zbigniew Michalewicz
Springer eBooksGenetic algorithms + data structures = evolution programs (2nd, extended ed.)
666 Citations1994Zbigniew Michalewicz
Art of Software Testing
566 Citations1979Glenford J. Myers
Lecture notes in computer scienceColoured petri nets: A high level language for system design and analysis
454 Citations1991Kurt Jensen
This paper describes how Coloured Petri Nets have been developed — from being a promising theoretical model to being a full-fledged language for the design, specification, simulation, validation and implementation of large software systems.
Survey on user interface programming
441 Citations1992Brad A. Myers, Mary Beth Rosson
The most common problems people reported when developing a user interface included getting users' requirements, writing help text, achieving consistency, learning how to use the tools, getting acceptable performance, and communicating among various parts of the program.
Comparison of empirical testing and walkthrough methods in user interface evaluation
303 Citations1992Claire-Marie Karat, R.I. Campbell +1 more
The findings were replicated across the two systems and show that the empirical testing condition identified the largest number of problems, and identified a significant number of relatively severe problems that were missed by the walkthrough conditions.
Elsevier eBooksTowards a Practical GOMS Model Methodology for User Interface Design
291 Citations1988David E. Kieras
This chapter presents a practical GOMS model methodology for user interface design with the basic approach to user-interface design using the cognitive complexity approach, but with the evaluation of a proposed design being done with simulation techniques rather than actual human user testing.
ACM Computing SurveysHuman-computer interface development: concepts and systems for its management
288 Citations1989H. Rex Hartson, Deborah Hix
This survey presents important concepts of interface management: dialogue independence, structural modeling, representation, interactive tools, rapid prototyping, development methodologies, and control structures.
A user interface management system
161 Citations1982David J. Kasik
A user interface management system that allows a designer/developer to focus on the logical functionality of an application without the usual bookkeeping associated with a conventional programming language is described.
Sequential circuit test generation in a genetic algorithm framework
145 Citations1994E.M. Rudnick, J.H. Patel +2 more
A genetic algorithm (GA) framework for sequential circuit test generation that evolves candidate test vectors and sequences, using a fault simulator to compute the fitness of each candidate test.
Coloured Petri Nets: A High Level Language for System Design and Analysis
113 Citations1991Kjeld Jensen
Morgan Kaufmann Publishers Inc. eBooksUser Interface Management Systems: Models and Algorithms
94 Citations1992Dan R. Olsen
All major approaches to User Interface Management Systems development from a programmer's algorithmic perspective are brought together for the first time.
Test data generation and feasible path analysis
59 Citations1994Robert Jasper, Mike Brennan +3 more
Techniques based on new representations combined with automated theorem proving can be used to determine the feasibility of expressions containing references to Ada arrays, and these techniques can be applied to a broad enough section of Ada code to make them cost effective.
International Journal of Man-Machine StudiesExtending Petri nets for specifying man–machine dialogues
50 Citations1988Willem R. van Biljon
Petri nets are identified as possible candidates for a modelling technique for dialogues on the basis of their applicability to concurrent, asynchronous systems and extended to nested Petri nets, allowing transitions to invoke subnets.
Notes on numerical fluid mechanics and multidisciplinary designDesign of user-driven interfaces using Petri nets and objects
40 Citations1993Philippe Palanque, Rémi Bastide +2 more
An overview of the benefits that can be expected from the use of the PNO formalism in dialogue modelling is presented, and a detailed example illustrates the application of this method.
ACM Transactions on Software Engineering and MethodologyA reduced test suite for protocol conformance testing
29 Citations1994Philip J. Bernhard
Three new versions of the W-method are described, one of which makes use of a heuristic for minimizing the number of strings in a characterization set, and the performance ratio for this heuristic has an upper bound of O(log n).
Services and business process reengineeringAutomated Software Testing
10 Citations2020Ajay Kumar Jena, Himansu Das +1 more