This paper presents an automated transition from OMT* (a formal variant of OMT) towards SDL. This work is a partial result from a larger research eeort proposing an integrated methodology and toolset based on the combination of Object-Orientation and Formal-Description Techniques. In this project OMT is used as the systems requirements analysis technique and OMT* for for System Design, while SD...

In 2003, Augot et al. introduced the Fast Syndrome-Based hash family (in short FSB), which follows the generic construction of Merkle-Damg̊ard and is based on the syndrome decoding problem. In 2007, Finiasz et al. proposed an improved version of FSB. In this work, we propose a new efficient hash function, which incorporates the ideas of FSB and the sponge construction introduced by Bertoni et al...

Formal description techniques allow to formally reason about the functional aspects of systems under development. This allows to detect and remedy functional errors in early stages of the development cycle. In order to also support performance engineering activities in the early development stages, a study of the integration of performance aspects into the standardized formal description techni...

BACKGROUND Understanding contraception from the perspective of the user may help to improve compliance. The aim of this project was to determine the factors that influence the noncompliance in young women that use combined hormonal contraceptives (pill, patch or vaginal ring). METHODS A nationwide cross-sectional multicenter epidemiology study. Physicians [obstetricians/gynecologists]) record...

The spi-calculus is a formal model for the design and analysis of cryptographic protocols: many security properties, such as authentication and strong confidentiality, can be reduced to the verification of behavioural equivalences between spi processes. In this paper we provide an algorithm for deciding hedged bisimilarity on finite processes, which is equivalent to barbed equivalence (and coar...

We discuss a mortar-type P 1 /P0 element method for the incompressible Stokes problem. We prove the inf-sup condition and obtain the optimal error estimate. Meanwhile, we propose a W-cycle multigrid for solving this discrete problem and prove the optimal convergence of the multigrid method, that is, the convergence rate is independent of the mesh size and mesh level. Finally, numerical experime...

A large set of criteria to evaluate formal methods for reactive systems is presented. To make this set more comprehensible, it is structured according to a Concept-Model of formal methods. It is made clear that it is necessary to make the catalogue more speciic before applying it. Some of the steps needed to do so are explained. As an example the catalogue is applied within the context of the a...

We present simple techniques for deciding the satissability of lexicographic path ordering constraints under two diierent semantics: solutions built over the given signature and solutions in extended signatures. For both cases we give the rst NP algorithms, which is optimal as we prove the problems to be NP-complete. We discuss the eecient applicability of the techniques in practice, where, as ...

For information retrieval, it is useful to classify documents using a hierarchy of terms from a domain. One problem is that, for many domains, hierarchies of terms are not available. The task 17 of SemEval 2015 addresses the problem of structuring a set of terms from a given domain into a taxonomy without manual intervention. Here we present some simple taxonomy structuring techniques, such as ...