Sciweavers

97 search results - page 2 / 20
» Test input generation for red-black trees using abstraction
Sort
View
ISSTA
2006
ACM
14 years 1 months ago
Test input generation for java containers using state matching
The popularity of object-oriented programming has led to the wide use of container libraries. It is important for the reliability of these containers that they are tested adequate...
Willem Visser, Corina S. Pasareanu, Radek Pel&aacu...
CI
2005
99views more  CI 2005»
13 years 7 months ago
Automatically Generating Tree Adjoining Grammars from Abstract Specifications
TRACT SPECIFICATIONS FEI XIA AND MARTHA PALMER Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104 K. VIJAY-SHANKER Department of Com...
Fei Xia, Martha Palmer, K. Vijay-Shanker
TACAS
2009
Springer
122views Algorithms» more  TACAS 2009»
14 years 2 months ago
Test Input Generation for Programs with Pointers
Software testing is an essential process to improve software quality in practice. Researchers have proposed several techniques to automate parts of this process. In particular, sym...
Dries Vanoverberghe, Nikolai Tillmann, Frank Piess...
MODELS
2007
Springer
14 years 1 months ago
Deriving Input Partitions from UML Models for Automatic Test Generation
Abstract. In this paper, we deal with model-based automatic test generation. We show how to use UML state machines, UML class diagrams, and OCL expressions to automatically derive ...
Stephan Weißleder, Bernd-Holger Schlingloff
IANDC
1998
70views more  IANDC 1998»
13 years 7 months ago
The Generating Power of Total Deterministic Tree Transducers
ed tree transducers are abstract models used to study properties bute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that...
Sebastian Maneth