A preliminary dictionary of Maori gainwords compiled on historical principles

This thesis is a preliminary dictionary of Maori gainwords compiled on historical principles. It will serve as the starting point for a fully fledged historical dictionary of Maori gainwords. The sources are a selection of all those Maori language publications printed between the dates 1815 and 1899. A large number of source items were photocopied from other institutions, and the binding and subsequent availability of these was not always in the order wished for. The research therefore has its limitations (clearly indicated by the use of the word 'preliminary' in the thesis title). Full coverage of all printed Maori publications between 1815 and 1899 has not been possible. Despite this, this preliminary dictionary offers a good indication of the extent of new gainword vocabulary introduced within the time frame. This thesis suggests that the terms loanword and borrowing should be replaced by the new term gainword or gain, and that the process by which new items of vocabulary enter a language should be known as gaining .. 'Gaining' is a positive process, and the word 'gainword' is normally devoid of any negative connotations or implications of cultural imperialism. This thesis is the first extended scholarly research into Maori gainword lexicography. Although 'preliminary', the dictionary is the first devoted solely to Maori gainwords - previous dictionaries of Maori have had gainwords as appendices, or have listed small numbers of gainwords in their general corpus. This dictionary builds on those earlier dictionaries by giving gainwords their own dictionary. This thesis will indicate that nearly all new items of vocabulary introduced into Maori language during the period researched were introduced by English-speaking Pakeha. English-speaking (and some few French-speaking) Pakeha controlled the printed word for some considerable time - up until the first Maori-controlled publication, Te Hokioi in 1861, in fact most gainwords were therefore imposed. The frequency count for Maori-driven gains done for this thesis will give only some slight indication of Maori use and acceptance of gains between 1815 and 1899

Automatic Methods for Analyzing Non-repudiation Protocole with an Active Intruder

International audienceNon-repudiation protocols have an important role in many areas where secured transactions with proofs of participation are necessary. Formal methods are clever and without error, therefore using them for verifying such protocols is crucial. In this purpose, we show how to partially represent non-repudiation as a combination of authentications on the Fair Zhou-Gollmann protocol. After discussing the limitations of this method, we define a new one based on the handling of the knowledge of protocol participants. This second method is general and of natural use, as it consists in adding simple annotations in the protocol specification. It is very easy to implement in tools able to handle participants knowledge. We have implemented it in the AVISPA Tool and analyzed the optimistic Cederquist-Corin-Dashti protocol, discovering two attacks. This extension of the AVISPA Tool for handling non-repudiation opens a highway to the specification of many other properties, without any more change in the tool itself

Approximately Satisfied Properties of Systems and Simple Language Homomorphisms

We define a new satisfaction relation for properties of a system's behaviour, approximate satisfaction. We show, for approximately satisfied properties, that they can be partitioned into a safety and a liveness property similar to linear properties. We will see that approximate satisfaction and linear satisfaction are equivalentfor safety but different for liveness properties. For practical and complexity reasons, we show that an abstraction of the behaviour of a system will preserve approximately satisfied properties, if and only if the abstraction is defined by a simple homomorphism on the behaviour. Keywords: Verification, Approximate Satisfaction, Safety,Liveness, Abstraction, Simple Homomorphisms, Formal Languages, !-Languages, Cantor Topology. 1 Introduction According to [2], a property P of a system is a subset of \Sigma ! . Here, \Sigma is a finite set of actions or events. The satisfaction of P is defined by !-language- inclusion: if L ! ` \Sigma ! represents the beh..

Security Requirements for Uniformly Parameterised Cooperations

The specification of security requirements is an important step when specifying new systems and systems of systems or analysing existing systems with regard to security issues. A common way to formally specify security requirements is by means of safety and liveness properties. The systems in the focus of this paper are uniformly parameterised cooperations. Such systems are characterised by the composition of a set of identical components. These components interact in a uniform manner described by the schedules of the partners. Such a kind of interaction is typical for scalable complex systems with a cloud or grid structure. As a main result, a formalism to specify uniformly parameterised behaviour properties of cooperations is given. To capture possibilistic aspects of especially liveness properties, a modified satisfaction relation is used. For safety properties, this relation, which is called approximate satisfaction, is equivalent to the usual one