In this paper, we describe the contributions to the workshop on domain specific approaches to software test automation. The workshop consists of six accepted papers and a keynote speech. The papers tackle a wide range of topics related to the testing of applications within specific domains including event driven software, synchronous safety critical software, web applications, wireless sensor networks, and mobile phone applications. Each of the papers describes the influence of the domain on the testing process.

We describe the tools and interfaces created by the AGEDIS project, a European Commission sponsored project for the creation of a methodology and tools for automated model driven test generation and execution for distributed systems. The project includes an integrated environment for modeling, test generation, test execution, and other test related activities. The tools support a model based testing methodology that features a large degree of automation and also includes a feedback loop integrating coverage and defect analysis tools with the test generator and execution framework. Prototypes of the tools have been tried in industrial settings providing important feedback for the creation of the next generation of tools in this area.

No abstract available.

One possible solution to the verification crisis is to bridge the gap between formal verification and simulation by using hybrid techniques.This paper presents a study of such a functional verification methodology that uses coverage of formal models to specify tests.This was applied to a modern superscalar microprocessor and the resulting tests were compared to tests generated using existing methods.The results showed some 50% improvement in transition coverage with less than a third the number of test instructions, demonstrating that hybrid techniques can significantly improve functional verification.1.

Let $D( v )$ be the number of pairwise disjoint Steiner quadruple systems. A simple counting argument shows that $D( v )\leqq v - 3$. In this paper it is proved that $D( 2^k n )\geqq ( 2^k - 1 ) n,k\geqq 2$, if there exists a set of $3n$ pairwise disjoint Steiner quadruple systems of order $4n$ with a certain structure. This implies that $D( v )\geqq v - o( v )$ for infinitely many values of v. New lower bounds on $D( v )$ for many values of v that are not divisible by 4 are also given, and it is proved that $D( v )\geqq 2$ for all $v \equiv 2$ or $4(\bmod 6 ),v\geqq 8$.