Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
    About

    About

    Please see http://www.alexandrasilva.org/#/aboutme.html

    Interest
    Topics
    Explore Interest Topics
    Details

    Details

    • Name

      Alexandra Silva

    • Cluster

      Computer Science

    • Role

      External Research Collaborator

    • Since

      01st November 2011
    Publications
    View all Publications

    2017

    Learning nominal automata

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

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

    Abstract

    2017

    Cantor meets scott: semantic foundations for probabilistic networks

    Authors
    Smolka, Steffen; Kumar, Praveen; Foster, Nate; Kozen, Dexter; Silva, Alexandra;

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

    Abstract

    2017

    CoCaml: Functional Programming with Regular Coinductive Types

    Authors
    Jeannin, JeanBaptiste; Kozen, Dexter; Silva, Alexandra;

    Publication
    Fundam. Inform.

    Abstract

    2016

    A coalgebraic view on decorated traces

    Authors
    Bonchi, F; Bonsangue, M; Caltais, G; Rutten, J; Silva, A;

    Publication
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE

    Abstract
    In the concurrency theory, various semantic equivalences on transition systems are based on traces decorated with some additional observations, generally referred to as decorated traces. Using the generalized powerset construction, recently introduced by a subset of the authors (Silva et al. 2010 FSTTCS. LIPIcs 8 272-283), we give a coalgebraic presentation of decorated trace semantics. The latter include ready, failure, (complete) trace, possible futures, ready trace and failure trace semantics for labelled transition systems, and ready, (maximal) failure and (maximal) trace semantics for generative probabilistic systems. This yields a uniform notion of minimal representatives for the various decorated trace equivalences, in terms of final Moore automata. As a consequence, proofs of decorated trace equivalence can be given by coinduction, using different types of (Moore-) bisimulation (up-to context).

    CloseRead Abstract

    2016

    Quien sabe por Algebra, sabe scientificamente: A tribute to José Nuno Oliveira

    Authors
    Barbosa, LS; Cunha, A; Silva, A;

    Publication
    J. Log. Algebr. Meth. Program.

    Abstract

    Read Full Publication