Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Testing by Narrowing Extended Abstract
 

Summary: Testing by Narrowing
Extended Abstract
Sergio Antoy and Dick Hamlet
Portland State University
Department of Computer Science
Portland, OR 97207
{antoy,hamlet}@cs.pdx.edu
1 Introduction
Testing and debugging a program P may require
computing an input I such that the execution of P
on input I goes through some given path T of P.
We describe how to compute such an input for pro-
grams coded in a simple imperative language with
generic expressions including user-defined abstract
data types.
For example, consider the following program
which computes iteratively a preorder traversal of a
tree. Stack and tree are user-defined types.
declare s : stack; t : tree;
begin

  

Source: Antoy, Sergio - Department of Computer Science, Portland State University

 

Collections: Computer Technologies and Information Sciences