Publicacoes - INESC TEC

Publicações

Publicações por Alexandra Silva

2009

Automata for Context-Dependent Connectors

Autores
Bonsangue, MM; Clarke, D; Silva, A;

Publicação
Coordination Models and Languages, 11th International Conference, COORDINATION 2009, Lisboa, Portugal, June 9-12, 2009. Proceedings

Abstract

2009

A Kleene Theorem for Polynomial Coalgebras

Autores
Bonsangue, MM; Rutten, JJMM; Silva, A;

Publicação
Foundations of Software Science and Computational Structures, 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings

Abstract

2008

Coalgebraic Logic and Synthesis of Mealy Machines

Autores
Bonsangue, MM; Rutten, JJMM; Silva, A;

Publicação
Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings

Abstract

2007

Behavioural Differential Equations and Coinduction for Binary Trees

Autores
Silva, A; Rutten, JJMM;

Publicação
Logic, Language, Information and Computation, 14th International Workshop, WoLLIC 2007, Rio de Janeiro, Brazil, July 2-5, 2007, Proceedings

Abstract

2008

Calculating invariants as coreflexive bisimulations

Autores
Barbosa, LS; Oliveira, JN; Silva, A;

Publicação
ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY, PROCEEDINGS

Abstract
Invariants, bisimulations and assertions are the main ingredients of coalgebra theory applied to software systems. In this paper we reduce the first to a particular case of the second and show how both together pave the way to a theory of coalgebras which regards invariant predicates as types. An outcome of such a theory is a calculus of invariants' proof obligation discharge, a fragment of which is presented in the paper. The approach has two main ingredients: one is that of adopting relations as "first class citizens" in a pointfree reasoning style; the other lies on a synergy found between a relational construct, Reynolds' relation on functions involved in the abstraction theorem on parametric polymorphism and the coalgebraic account of bisimulations and invariants. This leads to an elegant proof of the equivalence between two different definitions of bisimulation found in coalgebra literature (due to B. Jacobs and Aczel & Mendler, respectively) and to their instantiation to the classical Park-Milner definition popular in process algebra.

FecharLer Abstract

2016

A coalgebraic treatment of conditional transition systems with upgrades

Autores
Beohar, Harsh; König, Barbara; Küpper, Sebastian; Silva, Alexandra;

Publicação
CoRR

Abstract