Formal security analysis of the DNP3-secure authentication protocol

This thesis evaluates the security of Supervisory Control and Data Acquisition (SCADA) systems, which are one of the key foundations of many critical infrastructures. Specifically, it examines one of the standardised SCADA protocols called the Distributed Network Protocol Version 3, which attempts to provide a security mechanism to ensure that messages transmitted between devices, are adequately secured from rogue applications. To achieve this, the thesis applies formal methods from theoretical computer science to formally analyse the correctness of the protocol.

Stereoselective Formal Total Synthesis of (-)-Didemniserinolipid B

A formal total synthesis of (-)-didemniserinolipid B from L-(+)-tartaric acid is presented. Key features of the synthesis include construction of the bicyclic acetal core from bisdimethyl amide of tartaric acid and further elaboration by cross metathesis.

Formal Verification of Full-Wave Rectifier: A Case Study

We present a case study of formal verification of full-wave rectifier for analog and mixed signal designs. We have used the Checkmate tool from CMU [1], which is a public domain formal verification tool for hybrid systems. Due to the restriction imposed by Checkmate it necessitates to make the changes in the Checkmate implementation to implement the complex and non-linear system. Full-wave rectifier has been implemented by using the Checkmate custom blocks and the Simulink blocks from MATLAB from Math works. After establishing the required changes in the Checkmate implementation we are able to efficiently verify, the safety properties of the full-wave rectifier.

Toward a widely usable finite-state morphology workbench for less studied languages, 1: Desiderata

Most of the world’s languages lack electronic word form dictionaries. The linguists who gather such dictionaries could be helped with an efficient morphology workbench that adapts to different environments and uses. A widely usable workbench could be characterized, ideally, as generally applicable, extensible, and freely available (GEA). It seems that such a solution could be implemented in the framework of finite-state methods. The current work defines the GEA desiderata and starts a series of articles concerning these desiderata in finite- state morphology. Subsequent parts will review the state of the art and present an action plan toward creating a widely usable finite-state morphology workbench.

Enantioselective formal total syntheses of Clavukerin A and isoclavukerin A via a ring-closing metathesis reaction

Enantioselective formal total syntheses of the marine trisnorsesquiterpenes clavukerin A and isoclavukerin A, starting from (R)-limonene employing an RCM reaction as the key step, are described.

PROMIDS: A PROtotype multi-rIng data flow system for functional programming languages

This paper presents a detailed description of the hardware design and implementation of PROMIDS: a PROtotype Multi-rIng Data flow System for functional programming languages. The hardware constraints and the design trade-offs are discussed. The design of the functional units is described in detail. Finally, we report our experience with PROMIDS.

A formal synthesis of the perhydrogephyrotoxin

A short but uneventful formal synthesis of perhydrogephyrotoxin 3 from readily available tricyclo[5.2.1.0(2,6)]decane derivative 8 via the intermediacy of the cis-hydroindanone 13 is reported. This work constitutes further demonstration of the carbocycle-heterocycle equivalency theme in the synthesis of alkaloids.

A denotational semantics for the generalized ER model and a simple ER algebra

The recent spurt of research activities in Entity-Relationship Approach to databases calls for a close scrutiny of the semantics of the underlying Entity-Relationship models, data manipulation languages, data definition languages, etc. For reasons well known, it is very desirable and sometimes imperative to give formal description of the semantics. In this paper, we consider a specific ER model, the generalized Entity-Relationship model (without attributes on relationships) and give denotational semantics for the model as well as a simple ER algebra based on the model. Our formalism is based on the Vienna Development Method—the meta language (VDM). We also discuss the salient features of the given semantics in detail and suggest directions for further work.

Public opinion on useful languages in Europe

This article analyses the results of five Eurobarometer surveys (of 1995, 1997, 1998, 2000 and 2005) designed to measure which languages Europeans consider most useful to know. Most Europeans are of the opinion that English is the most useful, followed by French and German. During the last decade the popularity of French and German as useful languages has been decreasing significantly, while English has remained universally favoured as the most useful language. French and German have lost their popularity especially among those who do not speak them as a foreign language. On the other hand, Spanish, Russian and other languages (often these include languages of neighbouring countries, minority languages or a second official language of the country in question) have kept and even increased their former level of popularity. Opinions about useful languages vary according to a respondent’s knowledge of languages, education and profession. This article analyses these differences and discusses their impact on the study of foreign languages and the future of the practice of foreign languages in Europe.

Enantiodivergent Formal Total Synthesis of Aspercyclide C from L-(+)-Tartaric Acid

The enantiodivergent formal syntheses of both enantiomers of aspercyclide C is accomplished. Starting from L-(+)-tartaric acid, the key protected allylic alcohol, (3R,4R)-4-(methoxy-methoxy) non-1-en-3-ol is prepared, and is then elaborated into both enantiomers of 3-(4-methoxybenzyl)oxy]non-1-en-4-ol via Mitsunobu inversion. Esterification with a known biaryl acid, followed by ring-closing metathesis and deprotection completes the syntheses.