Reusing Test-Cases on Different Levels of Abstraction in a Model Based Development Tool

Seamless model based development aims to use models during all phases of the development process of a system. During the development process in a component-based approach, components of a system are described at qualitatively differing abstraction levels: during requirements engineering component models are rather abstract high-level and underspecified, while during implementation the component models are rather concrete and fully specified in order to enable code generation. An important issue that arises is assuring that the concrete models correspond to abstract models. In this paper, we propose a method to assure that concrete models for system components refine more abstract models for the same components. In particular we advocate a framework for reusing testcases at different abstraction levels. Our approach, even if it cannot completely prove the refinement, can be used to ensure confidence in the development process. In particular we are targeting the refinement of requirements which are represented as very abstract models. Besides a formal model of our approach, we discuss our experiences with the development of an Adaptive Cruise Control (ACC) system in a model driven development process. This uses extensions which we implemented for our model-based development tool and which are briefly presented in this paper.Comment: In Proceedings MBT 2012, arXiv:1202.582

Rule-based Test Generation with Mind Maps

This paper introduces basic concepts of rule based test generation with mind maps, and reports experiences learned from industrial application of this technique in the domain of smart card testing by Giesecke & Devrient GmbH over the last years. It describes the formalization of test selection criteria used by our test generator, our test generation architecture and test generation framework.Comment: In Proceedings MBT 2012, arXiv:1202.582

Do 15-month-old infants prefer helpers? A replication of Hamlin et al. (2007)

Hamlin et al. found in 2007 that preverbal infants displayed a preference for helpers over hinderers. The robustness of this finding and the conditions under which infant sociomoral evaluation can be elicited has since been debated. Here, we conducted a replication of the original study, in which we tested 14- to 16-month-olds using a familiarization procedure with three-dimensional animated video stimuli. Unlike previous replication attempts, ours uniquely benefited from detailed procedural advice by Hamlin. In contrast with the original results, only 16 out of 32 infants (50%) in our study reached for the helper; thus, we were not able to replicate the findings. A possible reason for this failure is that infants’ preference for prosocial agents may not be reliably elicited with the procedure and stimuli adopted. Alternatively, the effect size of infants’ preference may be smaller than originally estimated. The study addresses ongoing methodological debates on the replicability of influential findings in infant cognition

08351 Abstracts Collection -- Evolutionary Test Generation

From September 24th to September 29th 2008 the Dagstuhl Seminar 08351 ``Evolutionary Test Generation \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

Reasoning about XML with temporal logics and automata

We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of programs. Many properties of interest in the XML context are related to navigation, and can be formulated in temporal logics for trees. We choose a logic that admits a simple single-exponential translation into unranked tree automata, in the spirit of the classical LTL-to-Büchi automata translation. Automata arising from this translation have a number of additional properties; in particular, they are convenient for reasoning about unary node-selecting queries, which are important in the XML context. We give two applications of such reasoning: one deals with a classical XML problem of reasoning about navigation in the presence of schemas, and the other relates to verifying security properties of XML views

Development of interactive and real-time educational software for mechanical principles

Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2001.Includes bibliographical references (p. 97).by Jochen Schlingloff.M.Eng

Formal verification of coupling properties for an automotive software integration across XilL

Virtualization and desktop testing of an integrated system without inclusion of a physical hardware is a well-established concept due to today’s abundant computing power availability. However, only few aspects of reality are introduced in steps into these virtual environments. The aspects of reality like hard-real time deadlines, timing events, coupling frequency and data synchronization between two subsystems in a system offer complexity without fair estimation of its consequence on the system behavior. In this paper, we describe the abovementioned complexity as the coupling properties detailed for a combustion engine example along with its controller. We formally verify the timing, safety, liveness and deadlock properties of the coupling by modeling them as timed transition systems. The example is verified for the idle speed control, smooth mode switching and for injection cutoff control where the interaction between the subsystems is very critical. The paper highlights a very important perspective of strong and weak subsystem coupling while transiting from Model-in-the-loop (MiL) to Software-in-the-Loop (SiL) and finally to Hardware-in-the-Loop (HiL). In conclusion, the input-output behavior of the coupled subsystems is also presented for a realistic observation of the control loop

Mechanisms of sharp wave initiation and ripple generation

Replay of neuronal activity during hippocampal sharp wave-ripples (SWRs) is essential in memory formation. To understand the mechanisms underlying the initiation of irregularly occurring SWRs and the generation of periodic ripples, we selectively manipulated different components of the CA3 network in mouse hippocampal slices. We recorded EPSCs and IPSCs to examine the buildup of neuronal activity preceding SWRs and analyzed the distribution of time intervals between subsequent SWR events. Our results suggest that SWRs are initiated through a combined refractory and stochastic mechanism. SWRs initiate when firing in a set of spontaneously active pyramidal cells triggers a gradual, exponential buildup of activity in the recurrent CA3 network. We showed that this tonic excitatory envelope drives reciprocally connected parvalbumin-positive basket cells, which start ripple-frequency spiking that is phase-locked through reciprocal inhibition. The synchronized GABAA receptor-mediated currents give rise to a major component of the ripple-frequency oscillation in the local field potential and organize the phase-locked spiking of pyramidal cells. Optogenetic stimulation of parvalbumin-positive cells evoked full SWRs and EPSC sequences in pyramidal cells. Even with excitation blocked, tonic driving of parvalbumin-positive cells evoked ripple oscillations. Conversely, optogenetic silencing of parvalbumin-positive cells interrupted the SWRs or inhibited their occurrence. Local drug applications and modeling experiments confirmed that the activity of parvalbumin-positive perisomatic inhibitory neurons is both necessary and sufficient for ripple-frequency current and rhythm generation. These interneurons are thus essential in organizing pyramidal cell activity not only during gamma oscillation, but, in a different configuration, during SWRs