I am an Assistant Professor at the Department of Informatics of the Faculty of Sciences, University of Lisbon, and an integrated researcher at LASIGE. I was a visiting researcher at Carnegie Mellon University in Fall 2019, where I worked at the PoP group.

I received my Ph.D. degree in Information Security in 2017 and my M.Sc. degree in Mathematics and Applications in 2011, both from Instituto Superior Técnico, University of Lisbon, and my B.Sc. in Mathematics from Faculty of Sciences and Technology, New University of Lisbon, in 2009.


​Andreia Mordido​

My research work focuses on programming languages and type systems for the specification and verification of communication protocols and programs. In the past, I worked on probabilistic and equational logics for the formalization of security properties on cryptographic protocols. I have also worked on satisfiability problems and implemented solvers for probabilistic satisfiability problems, used for validating security properties on protocols.

Research interests: Programming Languages, Type Systems, Logic, Satisfiability Problems, Probabilistic and Equational Reasoning.

Publications

  • Parametric Subtyping for Structural Parametric Polymorphism

    • Henry DeYoung, Andreia Mordido, Frank Pfenning, and Ankush Das.

    POPL 2024. Distinguished Paper Award

  • Subtyping Context-free Session Types

    • Gil Silva, Andreia Mordido, and Vasco T. Vasconcelos.

    CONCUR 2023.

  • Parameterized Algebraic Protocols

    • Andreia Mordido, Janek Spaderna, Peter Thiemann, and Vasco T. Vasconcelos.

    PLDI 2023.

  • System F-mu-omega with Context-free Session Types

    • Diogo Poças, Diana Costa, Andreia Mordido, and Vasco T. Vasconcelos.

    ESOP 2023. Lecture Notes in Computer Science. 2023.

  • Nested Session Types

    • Ankush Das, Henry DeYoung, Andreia Mordido, and Frank Pfenning.

    TOPLAS, Special issue on ESOP 2021. 2022.

  • Polymorphic Lambda Calculus with Context-free Session Types

    • Bernardo Almeida, Andreia Mordido, Peter Thiemann, and Vasco T. Vasconcelos.

    Information and Computation. 2022.

  • Polarized Subtyping

    • Zeeshan Lakhani, Ankush Das, Henry DeYoung, Andreia Mordido, and Frank Pfenning.

    ESOP 2022. Lecture Notes in Computer Science. 2022.

  • Mixed Sessions

    • Filipe Casal, Andreia Mordido, and Vasco T. Vasconcelos.

    Theoretical Computer Science. 2022.

  • Higher-order Context-free Session Types in System F

    • Diana Costa, Andreia Mordido, Diogo Poças, and Vasco T. Vasconcelos.

    PLACES 2022.

  • Protocol-based Smart Contract Generation

    • Afonso Falcão, Andreia Mordido, and Vasco T. Vasconcelos.

    Workshop on Trusted Smart Contracts 2022.

  • Subtyping on Nested Session Types

    • Ankush Das, Henry DeYoung, Andreia Mordido, and Frank Pfenning.

    Technical report, available at arXiv. 2021.

  • Nested Session Types

    • Ankush Das, Henry DeYoung, Andreia Mordido, and Frank Pfenning.

    ESOP 2021. Lecture Notes in Computer Science. 2021.

  • Mixed Sessions

    • Vasco T. Vasconcelos, Filipe Casal, Bernardo Almeida, and Andreia Mordido.

    ESOP 2020. Lecture Notes in Computer Science. 2020.

  • Deciding the bisimilarity of context-free session types

    • Bernardo Almeida, Andreia Mordido, and Vasco T. Vasconcelos.

    TACAS 2020. Lecture Notes in Computer Science. 2020.

  • Mixed Sessions: the Other Side of the Tape

    • Filipe Casal, Andreia Mordido, and Vasco T. Vasconcelos.

    PLACES 2020. Electronic Proceedings in Theoretical Computer Science. 2020.

  • FreeST: context-free session types in a functional language

    • Bernardo Almeida, Andreia Mordido, and Vasco T. Vasconcelos.

    PLACES 2019 | TryIt

  • Generalized Probabilistic Satisfiability and Applications to Modelling Attackers with Side-Channel Capabilities

    • Carlos Caleiro, Filipe Casal, and Andreia Mordido.

    Theoretical Computer Science. 2019.

  • Probabilistic logic over equations and domain restrictions

    • Andreia Mordido and Carlos Caleiro.

    Mathematical Structures in Computer Science. 2019.

  • Classical Generalized Probabilistic Satisfiability

    • Carlos Caleiro, Filipe Casal, and Andreia Mordido.

    IJCAI 2017 | Github

  • A probabilistic logic over equations and domain restrictions

    • Andreia Mordido. PhD thesis. 2017.

  • Generalized Probabilistic Satisfiability

    • Carlos Caleiro, Filipe Casal, and Andreia Mordido.

    Electronic Notes in Theoretical Computer Science | Github

  • An Equation-Based Classical Logic

    • Andreia Mordido and Carlos Caleiro.

    WoLLIC 2015. Lecture Notes in Computer Science. 2015.


    Teaching

    Faculdade de Ciências, Universidade de Lisboa

    Instituto Superior Técnico, Universidade de Lisboa

    Projects

    Contact

    Departamento de Informática
    Faculdade de Ciências da Universidade de Lisboa
    Campo Grande, 1749-016 Lisboa
    Portugal

    Email: afmordido (at) ciencias.ulisboa.pt
    Phone: (+351) 217 800 087