Model checking Z specifications using SAL

The Symbolic Analysis Laboratory (SAL) is a suite of tools for analysis of state transition systems. Tools supported include a simulator and four temporal logic model checkers. The common input language to these tools was originally developed with translation from other languages, both programming and specification languages, in mind. It is, therefore, a rich language supporting a range of type definitions and expressions. In this paper, we investigate the translation of Z specifications into the SAL language as a means of providing model checking support for Z. This is facilitated by a library of SAL definitions encoding the Z mathematical toolkit.

Designing for Location-Dependence

This paper proposes a methodological framework for use in designing location-dependent games or experiences. An increasing interest in this genre has given rise to a number of common issues surrounding the design and development of these types of experience. Specifically, the treatment of and approach to the use of location gives rise to particular design considerations. The framework proposed here aims to highlight these and provide designers with tools for use in addressing these.

Model-Driven safety evaluation with state-event-based component failure annotations

Over the past years, the paradigm of component-based software engineering has been established in the construction of complex mission-critical systems. Due to this trend, there is a practical need for techniques that evaluate critical properties (such as safety, reliability, availability or performance) of these systems. In this paper, we review several high-level techniques for the evaluation of safety properties for component-based systems and we propose a new evaluation model (State Event Fault Trees) that extends safety analysis towards a lower abstraction level. This model possesses a state-event semantics and strong encapsulation, which is especially useful for the evaluation of component-based software systems. Finally, we compare the techniques and give suggestions for their combined usage

A graphical specification of model transformations with triple graph grammars

Models and model transformations are the core concepts of OMG's MDA (TM) approach. Within this approach, most models are derived from the MOF and have a graph-based nature. In contrast, most of the current model transformations are specified textually. To enable a graphical specification of model transformation rules, this paper proposes to use triple graph grammars as declarative specification formalism. These triple graph grammars can be specified within the FUJABA tool and we argue that these rules can be more easily specified and they become more understandable and maintainable. To show the practicability of our approach, we present how to generate Tefkat rules from triple graph grammar rules, which helps to integrate triple graph grammars with a state of a art model transformation tool and shows the expressiveness of the concept.

An evaluation of steels subjected to rock bolt SCC conditions

In order to understand the metallurgical influences on Rock Bolt SCC, an evaluation has been carried out on carbon, carbon + manganese, alloy and microalloyed steels subjected to the conditions previously identified as producing laboratory SCC similar to that observed for rock bolts in service. The approach has been to use the LIST test (Linearly increasing stress test) for samples exposed to a dilute pH 2.1-sulphate solution, as per our prior studies. SCC was evaluated from the decrease in tensile strength, ductility and fractography as revealed by SEM observation. A range of SCC susceptibilities was observed. Ten of these steels showed SCC, however there was no SCC for one carbon, two carbon + manganese and two alloy steels.

Refinement laws for verifying library subroutine adaptation

In component-based software engineering programs are constructed from pre-defined software library modules. However, if the library's subroutines do not exactly match the programmer's requirements, the subroutines' code must be adapted accordingly. For this process to be acceptable in safety or mission-critical applications, where all code must be proven correct, it must be possible to verify the correctness of the adaptations themselves. In this paper we show how refinement theory can be used to model typical adaptation steps and to define the conditions that must be proven to verify that a library subroutine has been adapted correctly.