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 Alexandra Silva

2017

Learning nominal automata

Autores
Moerman, Joshua; Sammartino, Matteo; Silva, Alexandra; Klin, Bartek; Szynwelski, Michal;

Publicação
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017

Abstract

2013

On Moessner's Theorem

Autores
Kozen, D; Silva, A;

Publicação
The American Mathematical Monthly

Abstract

2015

IMCReo: interactive Markov chains for Stochastic Reo

Autores
Oliveira, Nuno; Silva, Alexandra; Barbosa, LuisSoares;

Publicação
J. Internet Serv. Inf. Secur.

Abstract

2016

Coalgebraic Learning

Autores
Silva, A;

Publicação
25th EACSL Annual Conference on Computer Science Logic, CSL 2016, August 29 - September 1, 2016, Marseille, France

Abstract

2013

Sound and Complete Axiomatizations of Coalgebraic Language Equivalence

Autores
Bonsangue, MM; Milius, S; Silva, A;

Publicação
ACM Trans. Comput. Log.

Abstract

2013

Automatic equivalence proofs for non-deterministic coalgebras

Autores
Bonsangue, M; Caltais, G; Goriac, EI; Lucanu, D; Rutten, J; Silva, A;

Publicação
SCIENCE OF COMPUTER PROGRAMMING

Abstract
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analog of Kleene's theorem and Kleene algebra, were recently proposed by a subset of the authors of this paper. Examples of the systems covered include infinite streams, deterministic automata, Mealy machines and labeled transition systems. In this paper, we present a novel algorithm to decide whether two expressions are bisimilar or not. The procedure is implemented in the automatic theorem prover CIRC, by reducing coinduction to an entailment relation between an algebraic specification and an appropriate set of equations. We illustrate the generality of the tool with three examples: infinite streams of real numbers, Mealy machines and labeled transition systems.

  • 2
  • 13