An Estelle compiler

The increasing development and use of computer networks has necessitated international standards to be defined. Central to the standardization efforts is the concept of a Formal Description Technique (FDT) which is used to provide a definition medium for communication protocols and services. This document describes the design and implementation of one of the few existing compilers for the one such FDT, the language "Estelle" ([ISO85], [ISO86], [ISO87])

The application of message passing to concurrent programming

The development of concurrency in computer systems will be critically reviewed and an alternative strategy proposed. This is a programming language designed along semantic principles, and it is based upon the treatment of concurrent processes as values within that language's universe of discourse. An asynchronous polymorphic message system is provided to enable co-existent processes to communicate freely. This is presented as a fundamental language construct, and it is completely general purpose, as all values, however complex, can be passed as messages. Various operations are also built into the language so as to permit processes to discover and examine one another. These permit the development of robust systems, where localised failures can be detected, and action can be taken to recover. The orthogonality of the design is discussed and its implementation in terms of an incremental compiler and abstract machine interpreter is outlined in some detail. This thesis hopes to demonstrate that message-oriented communication in a highly parallel system of processes is not only a natural form of expression, but is eminently practical, so long as the entities performing the communication are values in the languag

Implementación eficiente de construcciones de alto nivel para la programación concurrente

Tesis (Doctor en Ciencias de la Computación)--Universidad Nacional de Córdoba, Facultad de Matemática, Astronomía y Física, 2011.El trabajo de tesis doctoral presenta métodos automáticos para mejorar implementaciones de regiones críticas condicionales y monitores con señalamiento automático, mediante el uso de probadores de teoremos del tipo SMT solver (CVC) y probadores de lógica de alto orden (Isabelle/Isar), utilizados dentros de técnicas de interpretación abstracta. En el caso de regiones críticas condicionales la propuesta se aplica a implementaciones automáticas producidas por la técnica de Semáforos Binarios Divididos desarrollada por E.W.Dijkstra. En el caso de monitores el método mejora implementaciones con señalamiento explícito. Los resultado brindan construcciones eficientes de alto nivel, que permiten desarrollar programas concurrentes de forma simple y correcta.Damián Barsotti

An Overview of Edison

Edison is a library of functional data structures implemented in Haskell. It supports three main families of abstractions: sequences, collections (e.g., sets and priority queues), and associative collections (e.g., nite maps). This paper summarizes the design of Edison, with particular attention to how that design is inuenced by details of Haskell. 1 Introduction There is a growing recognition that a useful set of libraries is at least as important to the acceptance of a programming language as the design of the language itself. A library of fundamental data structures such as queues, sets, and nite maps is particularly important in this regard. However, high-quality examples of such libraries, such as the STL [14] in C++ or the the collection classes [3] in Smalltalk, are rare. Edison is a library of ecient data structures suitable for implementation and use in functional programming languages. It is named after Thomas Alva Edison and for the mnemonic value of EDiSon (Ecient Data ..