# Alexandra Silva

#56,559

Most Influential Person Now

Portuguese computer scientist

## Alexandra Silva's AcademicInfluence.com Rankings

Alexandra Silvacomputer-science Degrees

Computer Science

#2430

World Rank

#2537

Historical Rank

Theoretical Computer Science

#40

World Rank

#40

Historical Rank

Database

#9294

World Rank

#9784

Historical Rank

## Download Badge

Computer Science

## Alexandra Silva's Degrees

- PhD Computer Science University of Lisbon
- Masters Computer Science University of Lisbon
- Bachelors Computer Science University of Lisbon

## Similar Degrees You Can Earn

## Why Is Alexandra Silva Influential?

(Suggest an Edit or Addition)According to Wikipedia, Alexandra Silva is a Portuguese computer scientist and Professor at Cornell University. She was previously Professor of Algebra, Semantics, and Computation at University College London. Awards and honours Silva won a Philip Leverhulme Prize in engineering in 2016. She won the Presburger Award, awarded each year to "a young scientist for outstanding contributions in theoretical computer science, documented by a published paper or a series of published papers", in 2017, and the Roger Needham Award in 2018.

## Alexandra Silva's Published Works

### Published Works

- Generalizing determinization from automata to coalgebras (2013) (129)
- Trace semantics via determinization (2012) (100)
- A Coalgebraic Decision Procedure for NetKAT (2015) (96)
- Probabilistic NetKAT (2016) (76)
- Sound and Complete Axiomatizations of Coalgebraic Language Equivalence (2011) (72)
- Generalizing the powerset construction, coalgebraically (2010) (71)
- Non-Deterministic Kleene Coalgebras (2010) (61)
- Practical coinduction (2016) (60)
- A coalgebraic perspective on linear weighted automata (2011) (58)
- A Coalgebraic Perspective on Minimization and Determinization (2012) (54)
- Algebra-coalgebra duality in brzozowski's minimization algorithm (2014) (51)
- Learning nominal automata (2016) (46)
- Automata for Context-Dependent Connectors (2009) (42)
- Cantor meets Scott: semantic foundations for probabilistic networks (2016) (37)
- The Power of Convex Algebras (2017) (33)
- Concurrent Kleene Algebra: Free Model and Completeness (2017) (31)
- Enhanced coalgebraic bisimulation (2015) (31)
- Quantitative Kleene coalgebras (2011) (30)
- Nominal Kleene Coalgebra (2015) (30)
- An Algebra for Kripke Polynomial Coalgebras (2009) (29)
- A Kleene Theorem for Polynomial Coalgebras (2009) (28)
- Brzozowski's Algorithm (Co)Algebraically (2011) (28)
- Coalgebraic Logic and Synthesis of Mealy Machines (2008) (27)
- A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (2015) (25)
- Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time (2019) (24)
- CoCaml: Functional Programming with Regular Coinductive Types (2017) (23)
- CALF: Categorical Automata Learning Framework (2017) (22)
- Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems (2011) (22)
- Language Constructs for Non-Well-Founded Computation (2012) (19)
- A model of context-dependent component connectors (2009) (19)
- Deriving Syntax and Axioms for Quantitative Regular Behaviours (2009) (18)
- A Compositional Semantics for Stochastic Reo Connectors (2010) (18)
- Completeness and incompleteness in nominal Kleene algebra (2015) (18)
- Automata Learning: A Categorical Perspective (2014) (16)
- Calculating Invariants as Coreflexive Bisimulations (2008) (16)
- Scalable verification of probabilistic networks (2019) (16)
- Strong types for relational databases (2006) (15)
- A Coalgebraic View of ε-Transitions (2013) (14)
- Concurrent Kleene Algebra with Observations: From Hypotheses to Completeness (2020) (13)
- SDN-Actors: Modeling and Verification of SDN Programs (2018) (13)
- A compositional model to reason about end-to-end QoS in Stochastic Reo connectors (2014) (13)
- Left-Handed Completeness (2012) (13)
- Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure (2014) (13)
- A Coinductive Treatment of Infinitary Rewriting (2013) (12)
- CoCaml: Programming with Coinductive Types (2012) (12)
- Kleene Algebra with Observations (2018) (12)
- Layer by layer - Combining Monads (2017) (11)
- A coinductive calculus of binary trees (2010) (11)
- Logic and Program Semantics (2012) (11)
- Behavioural Differential Equations and Coinduction for Binary Trees (2007) (11)
- Final Semantics for Decorated Traces (2012) (11)
- Prognosis: closed-box analysis of network protocol implementations (2021) (11)
- Learning Automata with Side-Effects (2017) (10)
- Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness (2021) (10)
- On Series-Parallel Pomset Languages: Rationality, Context-Freeness and Automata (2018) (10)
- Convex Language Semantics for Nondeterministic Probabilistic Automata (2018) (10)
- Learning Weighted Automata over Principal Ideal Domains (2019) (10)
- Semantics of Probabilistic Programming: A Gentle Introduction (2020) (10)
- On Moessner's Theorem (2011) (9)
- Position Automata for Kleene Algebra with Tests (2012) (9)
- Symbolic Register Automata (2018) (9)
- A Decision Procedure for Bisimilarity of Generalized Regular Expressions (2010) (9)
- Towards a Coalgebraic Chomsky Hierarchy - (Extended Abstract) (2014) (9)
- Logic and Program Semantics: essays dedicated to Dexter Kozen on the occasion of his 60th birthday (2012) (9)
- A coalgebraic view on decorated traces (2014) (8)
- Conditional transition systems with upgrades (2017) (8)
- Towards a Coalgebraic Chomsky Hierarchy (2014) (8)
- IMCReo: interactive Markov chains for Stochastic Reo (2015) (8)
- Stochastic Reo: a case study (2011) (8)
- How to Kill Epsilons with a Dagger - A Coalgebraic Take on Systems with Algebraic Label Structure (2014) (7)
- A Bunched Logic for Conditional Independence (2020) (7)
- Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages (2017) (7)
- Brzozowski's and Up-To Algorithms for Must Testing (2013) (7)
- A short introduction to the coalgebraic method (2015) (6)
- Borel Kernels and their Approximation, Categorically (2018) (6)
- On Star Expressions and Coalgebraic Completeness Theorems (2021) (5)
- Quantitative analysis of Reo-based service coordination (2014) (5)
- Well-founded coalgebras, revisited (2013) (5)
- Minimisation in Logical Form (2020) (4)
- Deciding Probabilistic Program Equivalence in NetKAT (2017) (4)
- Canonical automata via distributive law homomorphisms (2021) (4)
- Cantor meets Scott: Domain-Theoretic Foundations for Probabilistic Network Programming (2016) (4)
- Processes Parametrised by an Algebraic Theory (2022) (4)
- Regular expressions for polynomial coalgebras (2007) (4)
- Toward a Uniform Theory of Effectful State Machines (2014) (3)
- Moessner's Theorem: An Exercise in Coinductive Reasoning in Coq (2016) (3)
- Completeness and Incompleteness of Synchronous Kleene Algebra (2019) (3)
- A coalgebraic treatment of conditional transition systems with upgrades (2016) (3)
- Tree Automata as Algebras: Minimisation and Determinisation (2019) (3)
- Partially Observable Concurrent Kleene Algebra (2020) (3)
- Preservation of Equations by Monoidal Monads (2020) (3)
- A (co)algebraic theory of succinct automata (2019) (2)
- Formalizing Moessner's theorem and generalizations in Nuprl (2021) (2)
- Learning Pomset Automata (2021) (2)
- ProbNV: probabilistic verification of network control planes (2021) (2)
- Optimizing Automata Learning via Monads. (2017) (2)
- Concurrent NetKAT: Modeling and analyzing stateful, concurrent networks (2022) (2)
- Initial Algebras of Terms with Binding and Algebraic Structure (2014) (2)
- Kleene Coalgebras (2010) (2)
- Automatic equivalence proofs for non-deterministic coalgebras (2013) (2)
- Equivalence checking for weak bi-Kleene algebra (2018) (2)
- Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning (2023) (2)
- Algebraic Enriched Coalgebras (2010) (1)
- On Star Expressions and Completeness Theorems (2021) (1)
- A Categorical Framework for Learning Generalised Tree Automata (2020) (1)
- A Kleene Theorem for Pomset Languages (2017) (1)
- Proceedings Fourth Interaction and Concurrency Experience (2011) (1)
- Actor-based model checking for Software-Defined Networks (2021) (1)
- Guarded Kleene Algebra with Tests: Automata Learning (2022) (1)
- Distribution Bisimilarity via the Power of Convex Algebras (2017) (1)
- A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests (2023) (1)
- Bases for algebras over a monad (2020) (1)
- CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper) (2020) (1)
- Formalizing Moessner ’ s Theorem in N UPRL (2011) (1)
- A coalgebraic perspective on minimization, determinization and behavioural metrics (2011) (1)
- Models of Concurrent Kleene Algebra (2020) (1)
- Formal Techniques for Distributed Objects, Components, and Systems (2017) (1)
- Coalgebraic Learning (2016) (0)
- Foundations of Probabilistic Programming ( tentative title ) (2019) (0)
- 4th Interaction and Concurrency Experience, ICE 2011, Reykjavik, Iceland, June 9, 2011 (2011) (0)
- Report on the POPL mentoring workshop (PLMW 2016) (2016) (0)
- Generators and bases for algebras over a monad (2021) (0)
- L O ] 1 6 N ov 2 01 8 Kleene Algebra with Observations ⋆ (2018) (0)
- An Algebraic Framework to Reason About Concurrency (Invited Talk) (2019) (0)
- A Specification Language for Reo Connectors (2011) (0)
- A Logic to Reason about Dependence and Independence (2020) (0)
- Multisets and Distributions (2023) (0)
- Strong types for relational databases : functional pearl (2006) (0)
- Automatic equivalence proofs for non-deterministic coalgebras (revised and extended) (2011) (0)
- Terms of use : Click here Enhanced coalgebraic bisimulation (2016) (0)
- Towards a Coalgebraic Chomsky Hierarchy : 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings (2014) (0)
- Towards a Coalgebraic Chomsky Hierarchy ( Short paper ) (2014) (0)
- Probabilistic NetKAT: Invited Presentation at the 9th Interaction and Concurrency Experience (2016) (0)
- Proceedings of the 3rd Interaction and Concurrency Experience. (2010) (0)
- Actor-Based Model Checking for SDN Networks (2020) (0)
- Proceedings Third Interaction and Concurrency Experience: Guaranteed Interaction, ICE 2010, Amsterdam, The Netherlands, 10th of June 2010 (2010) (0)
- 3rd Interaction and Concurrency Experience, ICE 2010, Amsterdam, The Netherlands, June 10, 2010 (2010) (0)
- Learning to Coordinate (2018) (0)
- Concurrency and Interaction in Complex Systems (2011) (0)
- Towards Interaction Reliability in Concurrent Applications (2012) (0)
- Proceedings Third Interaction and Concurrency Experience: Guaranteed Interaction: Preface (2010) (0)
- Generators and Bases for Monadic Closures (2020) (0)
- Explorer Borel Kernels and their Approximation , Categorically (2018) (0)
- Probabilistic Program Equivalence for NetKAT (2017) (0)
- Report on CALCO 2013 (2013) (0)
- Preface for the special issue on Interaction and Concurrency Experience 2012 (2015) (0)
- Kleene Coalgebra – an overview (2011) (0)
- Almost Sure Productivity (2018) (0)
- Monoidal Hoare Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning (2022) (0)
- 25 : 2 Brzozowski Goes Concurrent – A Kleene Theorem for Pomset Languages In KA (2017) (0)
- Deterministic stream-sampling for probabilistic programming: semantics and verification (2023) (0)
- Applications of Automata and Concurrency Theory in Networks (Invited Paper) (2015) (0)
- A Coalgebraic Approach to Reducing Finitary Automata (2023) (0)
- L O ] 5 O ct 2 01 8 Layer by Layer – Combining Monads (2018) (0)
- Proceedings ICE 2010 (2010) (0)
- Hennessy-Milner Results for Probabilistic PDL (2020) (0)
- A Kleene Theorem for Nominal Automata (2019) (0)

This paper list is powered by the following services:

## Other Resources About Alexandra Silva

## What Schools Are Affiliated With Alexandra Silva?

Alexandra Silva is affiliated with the following schools: