On the cloud deployment of a session abstraction for service/data aggregation

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Renewable energy systems the theme for the PACITA summer school on TA, Liège, Belgium, 25 28 June 2012

The summer school “Renewable Energy Systems: Role and Use of Parliamentary Technology Assessment” was the first European Summer School with a pure focus on technology assessment. The aim of the three-day long summer school of the European project Parliaments and Civil Society in Technology Assessment (PACITA) was to create awareness of the potential of technology groups in Europe. Therefore, the summer school involved keynotes, practical exercises, mutual reflection, cutting edge training and networking to deal with the theme of renewable energy systems out of the perspective of Technology Assessment (TA), to meet transition objectives or to critically assess energy technologies.

Evaluation and optimization of a session-based middleware for data management

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

A logical foundation for session-based concurrent computation

Linear logic has long been heralded for its potential of providing a logical basis for concurrency. While over the years many research attempts were made in this regard, a Curry-Howard correspondence between linear logic and concurrent computation was only found recently, bridging the proof theory of linear logic and session-typed process calculus. Building upon this work, we have developed a theory of intuitionistic linear logic as a logical foundation for session-based concurrent computation, exploring several concurrency related phenomena such as value-dependent session types and polymorphic sessions within our logical framework in an arguably clean and elegant way, establishing with relative ease strong typing guarantees due to the logical basis, which ensure the fundamental properties of type preservation and global progress, entailing the absence of deadlocks in communication. We develop a general purpose concurrent programming language based on the logical interpretation, combining functional programming with a concurrent, session-based process layer through the form of a contextual monad, preserving our strong typing guarantees of type preservation and deadlock-freedom in the presence of general recursion and higher-order process communication. We introduce a notion of linear logical relations for session typed concurrent processes, developing an arguably uniform technique for reasoning about sophisticated properties of session-based concurrent computation such as termination or equivalence based on our logical approach, further supporting our goal of establishing intuitionistic linear logic as a logical foundation for sessionbased concurrency.