04371 Abstracts Collection -- Perspectives of Model-Based Testing

From 05.09.04 to 10.09.04, the Dagstuhl Seminar 04371 ``Perspectives of Model-Based Testing\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

10421 Abstracts Collection -- Model-Based Testing in Practice

From 17.10. to 22.10.2010, the Dagstuhl Seminar 10421 ``Model-Based Testing in Practice \u27\u27 was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

Model-Based Testing for the Cloud

Software in the cloud is characterised by the need to be highly adaptive and continuously available. Incremental changes are applied to the deployed system and need to be tested in the field. Different configurations need to be tested. Higher quality standards regarding both functional and non-functional properties are put on those systems, as they often face large and diverse customer bases and/or are used as services from different peer service implementations. The properties of interest include interoperability, privacy, security, reliability, performance, resource use, timing constraints, service dependencies, availability, and so on. This paper discusses the state of the art in model-based testing of cloud systems. It focuses on two central aspects of the problem domain: (a) dealing with the adaptive and dynamic character of cloud software when tested with model-based testing, by developing new online and offline test strategies, and (b) dealing with the variety of modeling concerns for functional and non-functional properties, by devising a unified framework for them where this is possible. Having discussed the state of the art we identify challenges and future directions

Applying SMT Solvers to the Test Template Framework

The Test Template Framework (TTF) is a model-based testing method for the Z notation. In the TTF, test cases are generated from test specifications, which are predicates written in Z. In turn, the Z notation is based on first-order logic with equality and Zermelo-Fraenkel set theory. In this way, a test case is a witness satisfying a formula in that theory. Satisfiability Modulo Theory (SMT) solvers are software tools that decide the satisfiability of arbitrary formulas in a large number of built-in logical theories and their combination. In this paper, we present the first results of applying two SMT solvers, Yices and CVC3, as the engines to find test cases from TTF's test specifications. In doing so, shallow embeddings of a significant portion of the Z notation into the input languages of Yices and CVC3 are provided, given that they do not directly support Zermelo-Fraenkel set theory as defined in Z. Finally, the results of applying these embeddings to a number of test specifications of eight cases studies are analysed.Comment: In Proceedings MBT 2012, arXiv:1202.582

Benchmarking implementations of functional languages with ‘Pseudoknot', a float-intensive benchmark

Over 25 implementations of different functional languages are benchmarked using the same program, a floating-point intensive application taken from molecular biology. The principal aspects studied are compile time and execution time for the various implementations that were benchmarked. An important consideration is how the program can be modified and tuned to obtain maximal performance on each language implementation. With few exceptions, the compilers take a significant amount of time to compile this program, though most compilers were faster than the then current GNU C compiler (GCC version 2.5.8). Compilers that generate C or Lisp are often slower than those that generate native code directly: the cost of compiling the intermediate form is normally a large fraction of the total compilation time. There is no clear distinction between the runtime performance of eager and lazy implementations when appropriate annotations are used: lazy implementations have clearly come of age when it comes to implementing largely strict applications, such as the Pseudoknot program. The speed of C can be approached by some implementations, but to achieve this performance, special measures such as strictness annotations are required by non-strict implementations. The benchmark results have to be interpreted with care. Firstly, a benchmark based on a single program cannot cover a wide spectrum of ‘typical' applications. Secondly, the compilers vary in the kind and level of optimisations offered, so the effort required to obtain an optimal version of the program is similarly varie

Ein mengenbasierter Kalkül und seine Implementierung

Diese Arbeit untersucht die Fundierung und Implementierung von Berechnungsmodellen für mengenbasierte Computersprachen. Es wird der micro-Z-Kalkül eingeführt, eine minimale mengenbasierte Sprache, welcher Anwendungssprachen wie die Spezifikationssprache Z oder funktional-logische Programmiersprachen komplett und natürlich einbetten kann. Syntax, Semantik und Gleichungstheorie von MZ werden definiert. Mehrere Berechnungsmodelle werden entwickelt. Das Referenzberechnungsmodell, mit der Technik der natürlicher Semantik definiert, kombiniert funktionale Reduktion und nebenläufige Resolution, und bereitet die Implementierung durch eine abstrakte Maschine vor, welche auf nebenläufigen Resolutionsagenten basiert. Die Resultate der Arbeit sind eingebettet im Kontext des BMBF Forschungsprojekts ESPRESS, und wurden z.B. für die Automatisierung von Softwaretests eingesetzt. Die formalen Anteile dieser Arbeit sind vollständig in syntax- und typgeprüften Z gegeben, so dass die Arbeit auch eine Fallstudie der Anwendbarkeit von Z für anspruchsvolle Probleme der Metamodellierung darstellt.This thesis is concerned with the foundation and implementation of a computation models for set-based computer languages. It introduces the micro-Z calculus, a small set-based expression language, which is able to embed languages such as the specification language Z and functional logic programming languages in a complete and natural way. Syntax, semantics and equational theory of micro-Z are defined. Several computation models are developed. The reference computation model, which is based on natural semantics, combines functional reduction and constraint resolution, and leads to an implementation by an abstract machine, which is based on concurrent resolution threads. The results are embedded in the context of the BMBF research project ESPRESS, and have been e.g. applied to the automatization of software tests. All formal material of the thesis is given in type-checked Z, which makes this work also a case study on the usage of Z for problems of meta modeling

ABSTRACT Behavioral Composition in Symbolic Domains

We report preliminary results toward a framework for composing behavioral models. In our framework, models arise from a variety of description techniques such as state machines or scenarios given by textual and diagrammatic notations. Such models may describe full system behavior or aspects of system behavior representing a given concern. Our models may be composed with each other and transformed by various operators, yielding models that are themselves composable and transformable. We can use the models, either individually or in composition, in a variety of analysis processes such as model checking, refinement checking and model-based testing. What enables the flexibility of composition is the symbolic representation of values and state. Our approach is currently being incorporated into an advanced model-based specification and testing environment at Microsoft Research. 1