Cookies
O website necessita de alguns cookies e outros recursos semelhantes para funcionar. Caso o permita, o INESC TEC irá utilizar cookies para recolher dados sobre as suas visitas, contribuindo, assim, para estatísticas agregadas que permitem melhorar o nosso serviço. Ver mais
Aceitar Rejeitar
  • Menu
Publicações

Publicações por HASLab

2018

GENERATING THE ALGEBRAIC THEORY OF C(X): THE CASE OF PARTIALLY ORDERED COMPACT SPACES

Autores
Hofmann, D; Neves, R; Nora, P;

Publicação
THEORY AND APPLICATIONS OF CATEGORIES

Abstract
It is known since the late 1960's that the dual of the category of compact Hausdoroff spaces and continuous maps is a variety - not finitary, but bounded by aleph(1). In this note we show that the dual of the category of partially ordered compact spaces and monotone continuous maps is an aleph(1)-ary quasivariety, and describe partially its algebraic theory. Based on this description, we extend these results to categories of Vietoris coalgebras and homomorphisms on ordered compact spaces. We also characterise the aleph(1)-copresentable partially ordered compact spaces.

2018

A Semantics for Hybrid Iteration

Autores
Goncharov, S; Jakob, J; Neves, R;

Publicação
29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China

Abstract
The recently introduced notions of guarded traced (monoidal) category and guarded (pre-)iterative monad aim at unifying di erent instances of partial iteration whilst keeping in touch with the established theory of total iteration and preserving its merits. In this paper we use these notions and the corresponding stock of results to examine di erent types of iteration for hybrid computations. As a starting point we use an available notion of hybrid monad restricted to the category of sets, and modify it in order to obtain a suitable notion of guarded iteration with guardedness interpreted as progressiveness in time – we motivate this modification by our intention to capture Zeno behaviour in an arguably general and feasible way. We illustrate our results with a simple programming language for hybrid computations and interpret it over the developed semantic foundations. © Sergey Goncharov, Julian Jakob, and Renato Neves.

2018

A Semantics for Hybrid Iteration

Autores
Goncharov, S; Jakob, J; Neves, R;

Publicação
CoRR

Abstract

2018

Compositional semantics for new paradigms: probabilistic, hybrid and beyond

Autores
Dahlqvist, F; Neves, R;

Publicação
CoRR

Abstract

2018

BISEN: Efficient Boolean Searchable Symmetric Encryption with Verifiability and Minimal Leakage

Autores
Borges, G; Domingos, H; Ferreira, B; Leitão, J; Oliveira, T; Portela, B;

Publicação
IACR Cryptology ePrint Archive

Abstract

2018

A Provable Security Treatment of Isolated Execution Environments and Applications to Secure Computation

Autores
Portela, B;

Publicação

Abstract

  • 101
  • 262