Alexandra Silva

Orcid: 0000-0001-5014-9784

Affiliations:
  • Cornell University, Ithaca, NY, USA
  • University College London, UK
  • Radboud University Nijmegen, The Netherlands


According to our database1, Alexandra Silva authored at least 153 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Preface of the special issue on the conference on Computer-Aided Verification 2020 and 2021.
Formal Methods Syst. Des., October, 2024

Outcome Separation Logic: Local Reasoning for Correctness and Incorrectness with Computational Effects.
Proc. ACM Program. Lang., 2024

Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers.
Proc. ACM Program. Lang., 2024

KATch: A Fast Symbolic Verifier for NetKAT.
Proc. ACM Program. Lang., 2024

A Demonic Outcome Logic for Randomized Nondeterminism.
CoRR, 2024

A Complete Axiomatisation of Equivalence for Discrete Probabilistic Programming.
CoRR, 2024

A cyclic proof system for Guarded Kleene Algebra with Tests (full version).
CoRR, 2024

A Completeness Theorem for Probabilistic Regular Expressions.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

A Cyclic Proof System for Guarded Kleene Algebra with Tests.
Proceedings of the Automated Reasoning - 12th International Joint Conference, 2024

Correct and Complete Symbolic Execution for Free.
Proceedings of the Integrated Formal Methods - 19th International Conference, 2024

On Iteration in Discrete Probabilistic Programming.
Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction, 2024

A Categorical Approach to DIBI Models.
Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction, 2024

Multisets and Distributions.
Proceedings of the Logics and Type Systems in Theory and Practice, 2024

2023
Long-Term Mentoring for Computer Science Researchers.
Commun. ACM, May, 2023

Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning.
Proc. ACM Program. Lang., April, 2023

Automata Learning with an Incomplete Teacher (Artifact).
Dagstuhl Artifacts Ser., 2023

Conflict-Aware Active Automata Learning.
Proceedings of the Fourteenth International Symposium on Games, 2023

Joint Distributions in Probabilistic Semantics.
Proceedings of the 39th Conference on the Mathematical Foundations of Programming Semantics, 2023

Symbolic Semantics for Probabilistic Programs (extended version).
CoRR, 2023

A Coalgebraic Approach to Reducing Finitary Automata.
CoRR, 2023

Symbolic Semantics for Probabilistic Programs.
Proceedings of the Quantitative Evaluation of Systems - 20th International Conference, 2023

Deterministic stream-sampling for probabilistic programming: semantics and verification.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests.
Proceedings of the Programming Languages and Systems, 2023

Automata Learning with an Incomplete Teacher.
Proceedings of the 37th European Conference on Object-Oriented Programming, 2023

Generators and Bases for Monadic Closures.
Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 2023

2022
Formalizing Moessner's theorem and generalizations in Nuprl.
J. Log. Algebraic Methods Program., 2022

Guarded Kleene Algebra with Tests: Automata Learning.
Proceedings of the 38th Conference on the Mathematical Foundations of Programming Semantics, 2022

Processes Parametrised by an Algebraic Theory.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Concurrent NetKAT - Modeling and analyzing stateful, concurrent networks.
Proceedings of the Programming Languages and Systems, 2022

A Categorical Framework for Learning Generalised Tree Automata.
Proceedings of the Coalgebraic Methods in Computer Science, 2022

Tree-Based Adaptive Model Learning.
Proceedings of the A Journey from Process Algebra via Timed Automata to Model Learning, 2022

2021
ProbNV: probabilistic verification of network control planes.
Proc. ACM Program. Lang., 2021

Equivalence checking for weak bi-Kleene algebra.
Log. Methods Comput. Sci., 2021

Distribution Bisimilarity via the Power of Convex Algebras.
Log. Methods Comput. Sci., 2021

Actor-based model checking for Software-Defined Networks.
J. Log. Algebraic Methods Program., 2021

On Star Expressions and Coalgebraic Completeness Theorems.
Proceedings of the Proceedings 37th Conference on Mathematical Foundations of Programming Semantics, 2021

Canonical automata via distributive law homomorphisms.
Proceedings of the Proceedings 37th Conference on Mathematical Foundations of Programming Semantics, 2021

Prognosis: closed-box analysis of network protocol implementations.
Proceedings of the ACM SIGCOMM 2021 Conference, Virtual Event, USA, August 23-27, 2021., 2021

A Bunched Logic for Conditional Independence.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Learning Pomset Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

2020
Toward a Uniform Theory of Effectful State Machines.
ACM Trans. Comput. Log., 2020

Left-handed completeness.
Theor. Comput. Sci., 2020

Conditional transition systems with upgrades.
Sci. Comput. Program., 2020

Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time.
Proc. ACM Program. Lang., 2020

EATCS Distinguished Dissertation Award 2020 - Call for Nominations.
Bull. EATCS, 2020

Bases for algebras over a monad.
CoRR, 2020

A Logic to Reason about Dependence and Independence.
CoRR, 2020

Minimisation in Logical Form.
CoRR, 2020

Actor-Based Model Checking for SDN Networks.
CoRR, 2020

Hennessy-Milner Results for Probabilistic PDL.
Proceedings of the 36th Conference on the Mathematical Foundations of Programming Semantics, 2020

Preservation of Equations by Monoidal Monads.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Models of Concurrent Kleene Algebra.
Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

Concurrent Kleene Algebra with Observations: From Hypotheses to Completeness.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

Learning Weighted Automata over Principal Ideal Domains.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

Partially Observable Concurrent Kleene Algebra.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper).
Proceedings of the 31st International Conference on Concurrency Theory, 2020

Learning Automata with Side-Effects.
Proceedings of the Coalgebraic Methods in Computer Science, 2020

2019
On series-parallel pomset languages: Rationality, context-freeness and automata.
J. Log. Algebraic Methods Program., 2019

A (co)algebraic theory of succinct automata.
J. Log. Algebraic Methods Program., 2019

24th Workshop on Logic, Language, Information and Computation (WoLLIC 2017).
Log. J. IGPL, 2019

Scalable verification of probabilistic networks.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Completeness and Incompleteness of Synchronous Kleene Algebra.
Proceedings of the Mathematics of Program Construction - 13th International Conference, 2019

Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time (Invited Talk).
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

A Kleene Theorem for Nominal Automata.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

An Algebraic Framework to Reason About Concurrency (Invited Talk).
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Kleene Algebra with Observations.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

Symbolic Register Automata.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

Tree Automata as Algebras: Minimisation and Determinisation.
Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

2018
Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic.
Log. Methods Comput. Sci., 2018

A coalgebraic treatment of conditional transition systems with upgrades.
Log. Methods Comput. Sci., 2018

Borel Kernels and their Approximation, Categorically.
Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

Preface.
Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

Convex Language Semantics for Nondeterministic Probabilistic Automata.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

Layer by Layer - Combining Monads.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

Almost Sure Productivity.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

SDN-Actors: Modeling and Verification of SDN Programs.
Proceedings of the Formal Methods - 22nd International Symposium, 2018

Concurrent Kleene Algebra: Free Model and Completeness.
Proceedings of the Programming Languages and Systems, 2018

Learning to Coordinate.
Proceedings of the It's All About Coordination, 2018

2017
Enhanced coalgebraic bisimulation.
Math. Struct. Comput. Sci., 2017

Practical coinduction.
Math. Struct. Comput. Sci., 2017

Well-founded coalgebras, revisited.
Math. Struct. Comput. Sci., 2017

Completeness and incompleteness in nominal Kleene algebra.
J. Log. Algebraic Methods Program., 2017

CoCaml: Functional Programming with Regular Coinductive Types.
Fundam. Informaticae, 2017

Deciding Probabilistic Program Equivalence in NetKAT.
CoRR, 2017

Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages (Invited Talk).
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

Cantor meets scott: semantic foundations for probabilistic networks.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Learning nominal automata.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

CALF: Categorical Automata Learning Framework.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

The Power of Convex Algebras.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Report on the POPL mentoring workshop (PLMW 2016).
ACM SIGLOG News, 2016

A coalgebraic view on decorated traces.
Math. Struct. Comput. Sci., 2016

Quien sabe por Algebra, sabe scientificamente: A tribute to José Nuno Oliveira.
J. Log. Algebraic Methods Program., 2016

Cantor meets Scott: Domain-Theoretic Foundations for Probabilistic Network Programming.
CoRR, 2016

A coalgebraic treatment of conditional transition systems with upgrades.
CoRR, 2016

Probabilistic NetKAT.
Proceedings of the Programming Languages and Systems, 2016

Coalgebraic Learning.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

Moessner's Theorem: An Exercise in Coinductive Reasoning in Coq.
Proceedings of the Theory and Practice of Formal Methods, 2016

2015
Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure.
Theor. Comput. Sci., 2015

A short introduction to the coalgebraic method.
ACM SIGLOG News, 2015

Preface for the special issue on Interaction and Concurrency Experience 2012.
Sci. Comput. Program., 2015

IMC<sub>Reo</sub>: interactive Markov chains for Stochastic Reo.
J. Internet Serv. Inf. Secur., 2015

Trace semantics via determinization.
J. Comput. Syst. Sci., 2015

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (Extended Version).
CoRR, 2015

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

A Coalgebraic Decision Procedure for NetKAT.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Nominal Kleene Coalgebra.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Applications of Automata and Concurrency Theory in Networks (Invited Paper).
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Algebra-coalgebra duality in Brzozowski's minimization algorithm.
ACM Trans. Comput. Log., 2014

A compositional model to reason about end-to-end QoS in Stochastic Reo connectors.
Sci. Comput. Program., 2014

Preface.
Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, 2014

Towards a Coalgebraic Chomsky Hierarchy.
CoRR, 2014

Quantitative analysis of Reo-based service coordination.
Proceedings of the Symposium on Applied Computing, 2014

Towards a Coalgebraic Chomsky Hierarchy - (Extended Abstract).
Proceedings of the Theoretical Computer Science, 2014

How to Kill Epsilons with a Dagger - A Coalgebraic Take on Systems with Algebraic Label Structure.
Proceedings of the Coalgebraic Methods in Computer Science, 2014

Automata Learning: A Categorical Perspective.
Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

Initial Algebras of Terms with Binding and Algebraic Structure.
Proceedings of the Categories and Types in Logic, Language, and Physics, 2014

2013
Sound and Complete Axiomatizations of Coalgebraic Language Equivalence.
ACM Trans. Comput. Log., 2013

On Moessner's Theorem.
Am. Math. Mon., 2013

Automatic equivalence proofs for non-deterministic coalgebras.
Sci. Comput. Program., 2013

Report on CALCO 2013.
Bull. EATCS, 2013

Generalizing determinization from automata to coalgebras
Log. Methods Comput. Sci., 2013

A Coinductive Treatment of Infinitary Rewriting.
CoRR, 2013

Language Constructs for Non-Well-Founded Computation.
Proceedings of the Programming Languages and Systems, 2013

A Coalgebraic View of ε-Transitions.
Proceedings of the Algebra and Coalgebra in Computer Science, 2013

Brzozowski's and Up-To Algorithms for Must Testing.
Proceedings of the Programming Languages and Systems - 11th Asian Symposium, 2013

2012
A model of context-dependent component connectors.
Sci. Comput. Program., 2012

A coalgebraic perspective on linear weighted automata.
Inf. Comput., 2012

Final Semantics for Decorated Traces.
Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

Position Automata for Kleene Algebra with Tests.
Sci. Ann. Comput. Sci., 2012

Towards Interaction Reliability in Concurrent Applications.
Sci. Ann. Comput. Sci., 2012

A Coalgebraic Perspective on Minimization and Determinization.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

Brzozowski's Algorithm (Co)Algebraically.
Proceedings of the Logic and Program Semantics, 2012

2011
Preface.
Theor. Comput. Sci., 2011

Quantitative Kleene coalgebras.
Inf. Comput., 2011

Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems.
Proceedings of the Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics, 2011

Concurrency and Interaction in Complex Systems.
Sci. Ann. Comput. Sci., 2011

A Specification Language for Reo Connectors.
Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

2010
A coinductive calculus of binary trees.
Inf. Comput., 2010

A Compositional Semantics for Stochastic Reo Connectors
Proceedings of the Proceedings Ninth International Workshop on the Foundations of Coordination Languages and Software Architectures, 2010

Non-Deterministic Kleene Coalgebras
Log. Methods Comput. Sci., 2010

A Decision Procedure for Bisimilarity of Generalized Regular Expressions.
Proceedings of the Formal Methods: Foundations and Applications, 2010

Generalizing the powerset construction, coalgebraically.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
An Algebra for Kripke Polynomial Coalgebras.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

A Kleene Theorem for Polynomial Coalgebras.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

Automata for Context-Dependent Connectors.
Proceedings of the Coordination Models and Languages, 11th International Conference, 2009

Deriving Syntax and Axioms for Quantitative Regular Behaviours.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Coalgebraic Logic and Synthesis of Mealy Machines.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

Calculating Invariants as Coreflexive Bisimulations.
Proceedings of the Algebraic Methodology and Software Technology, 2008

2007
Behavioural Differential Equations and Coinduction for Binary Trees.
Proceedings of the Logic, 2007

2006
Strong types for relational databases.
Proceedings of the ACM SIGPLAN Workshop on Haskell, 2006


  Loading...