Strong types for relational databases. - Alexandra Silva 001; Joost Visser 001 (Haskell, 2006)

Behavioural Differential Equations and Coinduction for Binary Trees. - Alexandra Silva 001; Jan J. M. M. Rutten (WoLLIC, 2007)

Calculating Invariants as Coreflexive Bisimulations. - Luís Soares Barbosa; José Nuno Oliveira; Alexandra Silva 001 (AMAST, 2008)

Coalgebraic Logic and Synthesis of Mealy Machines. - Marcello M. Bonsangue; Jan J. M. M. Rutten; Alexandra Silva 001 (FoSSaCS, 2008)

Deriving Syntax and Axioms for Quantitative Regular Behaviours. - Filippo Bonchi; Marcello M. Bonsangue; Jan J. M. M. Rutten; Alexandra Silva 001 (CONCUR, 2009)

Automata for Context-Dependent Connectors. - Marcello M. Bonsangue; Dave Clarke 001; Alexandra Silva 001 (COORDINATION, 2009)

A Kleene Theorem for Polynomial Coalgebras. - Marcello M. Bonsangue; Jan J. M. M. Rutten; Alexandra Silva 001 (FoSSaCS, 2009)

An Algebra for Kripke Polynomial Coalgebras. - Marcello M. Bonsangue; Jan J. M. M. Rutten; Alexandra Silva 001 (LICS, 2009)

Generalizing the powerset construction, coalgebraically. - Alexandra Silva 001; Filippo Bonchi; Marcello M. Bonsangue; Jan J. M. M. Rutten (FSTTCS, 2010)

A Decision Procedure for Bisimilarity of Generalized Regular Expressions. - Marcello M. Bonsangue; Georgiana Caltais; Eugen-Ioan Goriac; Dorel Lucanu; Jan J. M. M. Rutten; Alexandra Silva 001 (SBMF, 2010)

Non-Deterministic Kleene Coalgebras - Alexandra Silva 001; Marcello M. Bonsangue; Jan J. M. M. Rutten (Log. Methods Comput. Sci., 2010)

A Compositional Semantics for Stochastic Reo Connectors - Young-Joo Moon 001; Alexandra Silva 001; Christian Krause 001; Farhad Arbab (FOCLASA, 2010)

A coinductive calculus of binary trees. - Alexandra Silva 001; Jan J. M. M. Rutten (Inf. Comput., 2010)

A Specification Language for Reo Connectors. - Alexandra Silva 001 (FSEN, 2011)

Concurrency and Interaction in Complex Systems. - Sonia Ben Mokhtar; Simon Bliudze; Roberto Bruni 001; Alexandra Silva 001; Angelo Troina (Sci. Ann. Comput. Sci., 2011)

Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems. - Alexandra Silva 001; Ana Sokolova (MFPS, 2011)

Quantitative Kleene coalgebras. - Alexandra Silva 001; Filippo Bonchi; Marcello M. Bonsangue; Jan J. M. M. Rutten (Inf. Comput., 2011)

Preface. - Bart Jacobs 001; Milad Niqui; Jan J. M. M. Rutten; Alexandra Silva 001 (Theor. Comput. Sci., 2011)

Brzozowski's Algorithm (Co)Algebraically. - Filippo Bonchi; Marcello M. Bonsangue; Jan J. M. M. Rutten; Alexandra Silva 001 (Logic and Program Semantics, 2012)

A Coalgebraic Perspective on Minimization and Determinization. - Jirí Adámek; Filippo Bonchi; Mathias Hülsbusch; Barbara König 001; Stefan Milius; Alexandra Silva 001 (FoSSaCS, 2012)

Towards Interaction Reliability in Concurrent Applications. - Simon Bliudze; Roberto Bruni 001; Marco Carbone; Alexandra Silva 001 (Sci. Ann. Comput. Sci., 2012)

Position Automata for Kleene Algebra with Tests. - Alexandra Silva 001 (Sci. Ann. Comput. Sci., 2012)

Final Semantics for Decorated Traces. - Filippo Bonchi; Marcello M. Bonsangue; Georgiana Caltais; Jan J. M. M. Rutten; Alexandra Silva 001 (MFPS, 2012)

A coalgebraic perspective on linear weighted automata. - Filippo Bonchi; Marcello M. Bonsangue; Michele Boreale; Jan J. M. M. Rutten; Alexandra Silva 001 (Inf. Comput., 2012)

A model of context-dependent component connectors. - Marcello M. Bonsangue; Dave Clarke 001; Alexandra Silva 001 (Sci. Comput. Program., 2012)

Brzozowski's and Up-To Algorithms for Must Testing. - Filippo Bonchi; Georgiana Caltais; Damien Pous; Alexandra Silva 001 (APLAS, 2013)

A Coalgebraic View of ε-Transitions. - Alexandra Silva 001; Bram Westerbaan (CALCO, 2013)

Language Constructs for Non-Well-Founded Computation. - Jean-Baptiste Jeannin; Dexter Kozen; Alexandra Silva 001 (ESOP, 2013)

A Coinductive Treatment of Infinitary Rewriting. - Jörg Endrullis; Helle Hvid Hansen; Dimitri Hendriks; Andrew Polonsky; Alexandra Silva 001 (CoRR, 2013)

Generalizing determinization from automata to coalgebras - Alexandra Silva 001; Filippo Bonchi; Marcello M. Bonsangue; Jan J. M. M. Rutten (Log. Methods Comput. Sci., 2013)

Report on CALCO 2013. - Alexandra Silva 001; Pawel Sobocinski 001 (Bull. EATCS, 2013)

Automatic equivalence proofs for non-deterministic coalgebras. - Marcello M. Bonsangue; Georgiana Caltais; Eugen-Ioan Goriac; Dorel Lucanu; Jan J. M. M. Rutten; Alexandra Silva 001 (Sci. Comput. Program., 2013)

On Moessner's Theorem. - Dexter Kozen; Alexandra Silva 001 (Am. Math. Mon., 2013)

Sound and Complete Axiomatizations of Coalgebraic Language Equivalence. - Marcello M. Bonsangue; Stefan Milius; Alexandra Silva 001 (ACM Trans. Comput. Log., 2013)

Initial Algebras of Terms with Binding and Algebraic Structure. - Bart Jacobs 001; Alexandra Silva 001 (Categories and Types in Logic, Language, and Physics, 2014)

Automata Learning: A Categorical Perspective. - Bart Jacobs 001; Alexandra Silva 001 (Horizons of the Mind, 2014)

How to Kill Epsilons with a Dagger - A Coalgebraic Take on Systems with Algebraic Label Structure. - Filippo Bonchi; Stefan Milius; Alexandra Silva 001; Fabio Zanasi (CMCS, 2014)

Towards a Coalgebraic Chomsky Hierarchy - (Extended Abstract). - Sergey Goncharov 001; Stefan Milius; Alexandra Silva 001 (IFIP TCS, 2014)

Quantitative analysis of Reo-based service coordination. - Nuno Oliveira 001; Alexandra Silva 001; Luís Soares Barbosa (SAC, 2014)

Towards a Coalgebraic Chomsky Hierarchy. - Sergey Goncharov 001; Stefan Milius; Alexandra Silva 001 (CoRR, 2014)

Preface. - Bart Jacobs 001; Alexandra Silva 001; Sam Staton (MFPS, 2014)

A compositional model to reason about end-to-end QoS in Stochastic Reo connectors. - Young-Joo Moon 001; Alexandra Silva 001; Christian Krause 001; Farhad Arbab (Sci. Comput. Program., 2014)

Algebra-coalgebra duality in Brzozowski's minimization algorithm. - Filippo Bonchi; Marcello M. Bonsangue; Helle Hvid Hansen; Prakash Panangaden; Jan J. M. M. Rutten; Alexandra Silva 001 (ACM Trans. Comput. Log., 2014)

Applications of Automata and Concurrency Theory in Networks (Invited Paper). - Alexandra Silva 001 (CONCUR, 2015)

Nominal Kleene Coalgebra. - Dexter Kozen; Konstantinos Mamouras; Daniela Petrisan; Alexandra Silva 001 (ICALP (2), 2015)

A Coalgebraic Decision Procedure for NetKAT. - Nate Foster; Dexter Kozen; Mae Milano; Alexandra Silva 001; Laure Thompson (POPL, 2015)

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning. - Jörg Endrullis; Helle Hvid Hansen; Dimitri Hendriks; Andrew Polonsky; Alexandra Silva 001 (RTA, 2015)

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (Extended Version). - Jörg Endrullis; Helle Hvid Hansen; Dimitri Hendriks; Andrew Polonsky; Alexandra Silva 001 (CoRR, 2015)

Trace semantics via determinization. - Bart Jacobs 001; Alexandra Silva 001; Ana Sokolova (J. Comput. Syst. Sci., 2015)

IMCReo: interactive Markov chains for Stochastic Reo. - Nuno Oliveira 001; Alexandra Silva 001; Luís Soares Barbosa (J. Internet Serv. Inf. Secur., 2015)

Preface for the special issue on Interaction and Concurrency Experience 2012. - Marco Carbone; Ivan Lanese; Alexandra Silva 001; Ana Sokolova (Sci. Comput. Program., 2015)

A short introduction to the coalgebraic method. - Alexandra Silva 001 (ACM SIGLOG News, 2015)

Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure. - Filippo Bonchi; Stefan Milius; Alexandra Silva 001; Fabio Zanasi (Theor. Comput. Sci., 2015)

Moessner's Theorem: An Exercise in Coinductive Reasoning in Coq. - Robbert Krebbers; Louis Parlant; Alexandra Silva 001 (Theory and Practice of Formal Methods, 2016)

Coalgebraic Learning. - Alexandra Silva 001 (CSL, 2016)

Probabilistic NetKAT. - Nate Foster; Dexter Kozen; Konstantinos Mamouras; Mark Reitblatt; Alexandra Silva 001 (ESOP, 2016)

A coalgebraic treatment of conditional transition systems with upgrades. - Harsh Beohar; Barbara König 001; Sebastian Küpper; Alexandra Silva 001 (CoRR, 2016)

Cantor meets Scott: Domain-Theoretic Foundations for Probabilistic Network Programming. - Steffen Smolka; Praveen Kumar 003; Nate Foster; Dexter Kozen; Alexandra Silva 001 (CoRR, 2016)

Quien sabe por Algebra, sabe scientificamente: A tribute to José Nuno Oliveira. - Luís Soares Barbosa; Alcino Cunha; Alexandra Silva 001 (J. Log. Algebraic Methods Program., 2016)

A coalgebraic view on decorated traces. - Filippo Bonchi; Marcello M. Bonsangue; Georgiana Caltais; Jan Rutten; Alexandra Silva 001 (Math. Struct. Comput. Sci., 2016)

Report on the POPL mentoring workshop (PLMW 2016). - Alexandra Silva 001 (ACM SIGLOG News, 2016)

The Power of Convex Algebras. - Filippo Bonchi; Alexandra Silva 001; Ana Sokolova (CONCUR, 2017)

Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages. - Tobias Kappé; Paul Brunet; Bas Luttik; Alexandra Silva 001; Fabio Zanasi (CONCUR, 2017)

CALF: Categorical Automata Learning Framework. - Gerco van Heerdt; Matteo Sammartino; Alexandra Silva 001 (CSL, 2017)

Learning nominal automata. - Joshua Moerman; Matteo Sammartino; Alexandra Silva 001; Bartek Klin; Michal Szynwelski (POPL, 2017)

Cantor meets scott: semantic foundations for probabilistic networks. - Steffen Smolka; Praveen Kumar 003; Nate Foster; Dexter Kozen; Alexandra Silva 001 (POPL, 2017)

Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages (Invited Talk). - Alexandra Silva 001 (FSCD, 2017)

Deciding Probabilistic Program Equivalence in NetKAT. - Steffen Smolka; David M. Kahn; Praveen Kumar 003; Nate Foster; Dexter Kozen; Alexandra Silva 001 (CoRR, 2017)

CoCaml: Functional Programming with Regular Coinductive Types. - Jean-Baptiste Jeannin; Dexter Kozen; Alexandra Silva 001 (Fundam. Informaticae, 2017)

Completeness and incompleteness in nominal Kleene algebra. - Dexter Kozen; Konstantinos Mamouras; Alexandra Silva 001 (J. Log. Algebraic Methods Program., 2017)

Well-founded coalgebras, revisited. - Jean-Baptiste Jeannin; Dexter Kozen; Alexandra Silva 001 (Math. Struct. Comput. Sci., 2017)

Practical coinduction. - Dexter Kozen; Alexandra Silva 001 (Math. Struct. Comput. Sci., 2017)

Enhanced coalgebraic bisimulation. - Jurriaan Rot; Filippo Bonchi; Marcello M. Bonsangue; Damien Pous; Jan Rutten; Alexandra Silva 001 (Math. Struct. Comput. Sci., 2017)

Learning to Coordinate. - Gerco van Heerdt; Bart Jacobs 001; Tobias Kappé; Alexandra Silva 001 (It's All About Coordination, 2018)

Concurrent Kleene Algebra: Free Model and Completeness. - Tobias Kappé; Paul Brunet; Alexandra Silva 001; Fabio Zanasi (ESOP, 2018)

SDN-Actors: Modeling and Verification of SDN Programs. - Elvira Albert; Miguel Gómez-Zamalloa; Albert Rubio; Matteo Sammartino; Alexandra Silva 001 (FM, 2018)

Almost Sure Productivity. - Alejandro Aguirre 001; Gilles Barthe; Justin Hsu; Alexandra Silva 001 (ICALP, 2018)

Layer by Layer - Combining Monads. - Fredrik Dahlqvist; Louis Parlant; Alexandra Silva 001 (ICTAC, 2018)

Preface. - Alexandra Silva 001 (MFPS, 2018)

Borel Kernels and their Approximation, Categorically. - Fredrik Dahlqvist; Alexandra Silva 001; Vincent Danos; Ilias Garnier (MFPS, 2018)

A coalgebraic treatment of conditional transition systems with upgrades. - Harsh Beohar; Barbara König 001; Sebastian Küpper; Alexandra Silva 001; Thorsten Wißmann (Log. Methods Comput. Sci., 2018)

Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic. - Jörg Endrullis; Helle Hvid Hansen; Dimitri Hendriks; Andrew Polonsky; Alexandra Silva 001 (Log. Methods Comput. Sci., 2018)

Tree Automata as Algebras: Minimisation and Determinisation. - Gerco van Heerdt; Tobias Kappé; Jurriaan Rot; Matteo Sammartino; Alexandra Silva 001 (CALCO, 2019)

Symbolic Register Automata. - Loris D'Antoni; Tiago Ferreira 001; Matteo Sammartino; Alexandra Silva 001 (CAV (1), 2019)

Kleene Algebra with Observations. - Tobias Kappé; Paul Brunet; Jurriaan Rot; Alexandra Silva 001; Jana Wagemaker; Fabio Zanasi (CONCUR, 2019)

An Algebraic Framework to Reason About Concurrency (Invited Talk). - Alexandra Silva 001 (FSTTCS, 2019)

A Kleene Theorem for Nominal Automata. - Paul Brunet; Alexandra Silva 001 (ICALP, 2019)

Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time (Invited Talk). - Alexandra Silva 001 (MFCS, 2019)

Completeness and Incompleteness of Synchronous Kleene Algebra. - Jana Wagemaker; Marcello M. Bonsangue; Tobias Kappé; Jurriaan Rot; Alexandra Silva 001 (MPC, 2019)

Scalable verification of probabilistic networks. - Steffen Smolka; Praveen Kumar 003; David M. Kahn; Nate Foster; Justin Hsu; Dexter Kozen; Alexandra Silva 001 (PLDI, 2019)

24th Workshop on Logic, Language, Information and Computation (WoLLIC 2017). - Juliette Kennedy; Ruy J. G. B. de Queiroz; Alexandra Silva 001; Mehrnoosh Sadrzadeh (Log. J. IGPL, 2019)

A (co)algebraic theory of succinct automata. - Gerco van Heerdt; Joshua Moerman; Matteo Sammartino; Alexandra Silva 001 (J. Log. Algebraic Methods Program., 2019)

On series-parallel pomset languages: Rationality, context-freeness and automata. - Tobias Kappé; Paul Brunet; Bas Luttik; Alexandra Silva 001; Fabio Zanasi (J. Log. Algebraic Methods Program., 2019)

Semantics of Probabilistic Programming: A Gentle Introduction. - Fredrik Dahlqvist; Alexandra Silva 001; Dexter Kozen (Foundations of Probabilistic Programming, 2020)

Learning Automata with Side-Effects. - Gerco van Heerdt; Matteo Sammartino; Alexandra Silva 001 (CMCS, 2020)

CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper). - Luca Aceto; Jos C. M. Baeten; Patricia Bouyer-Decitre; Holger Hermanns; Alexandra Silva 001 (CONCUR, 2020)

Partially Observable Concurrent Kleene Algebra. - Jana Wagemaker; Paul Brunet; Simon Docherty; Tobias Kappé; Jurriaan Rot; Alexandra Silva 001 (CONCUR, 2020)

Learning Weighted Automata over Principal Ideal Domains. - Gerco van Heerdt; Clemens Kupke; Jurriaan Rot; Alexandra Silva 001 (FoSSaCS, 2020)

Concurrent Kleene Algebra with Observations: From Hypotheses to Completeness. - Tobias Kappé; Paul Brunet; Alexandra Silva 001; Jana Wagemaker; Fabio Zanasi (FoSSaCS, 2020)

Models of Concurrent Kleene Algebra. - Alexandra Silva 001 (LPAR, 2020)

Preservation of Equations by Monoidal Monads. - Louis Parlant; Jurriaan Rot; Alexandra Silva 001; Bas Westerbaan (MFCS, 2020)

Hennessy-Milner Results for Probabilistic PDL. - Tao Gu 002; Alexandra Silva 001; Fabio Zanasi (MFPS, 2020)

Actor-Based Model Checking for SDN Networks. - Elvira Albert; Miguel Gómez-Zamalloa; Miguel Isabel; Albert Rubio; Matteo Sammartino; Alexandra Silva 001 (CoRR, 2020)

Minimisation in Logical Form. - Nick Bezhanishvili; Marcello M. Bonsangue; Helle Hvid Hansen; Dexter Kozen; Clemens Kupke; Prakash Panangaden; Alexandra Silva 001 (CoRR, 2020)

A Logic to Reason about Dependence and Independence. - Jialu Bao; Simon Docherty; Justin Hsu; Alexandra Silva 001 (CoRR, 2020)

Bases for algebras over a monad. - Stefan Zetzsche; Alexandra Silva 001; Matteo Sammartino (CoRR, 2020)

EATCS Distinguished Dissertation Award 2020 - Call for Nominations. - Susanne Albers; Nikhil Bansal 001; Elvira Mayordomo; Dale Miller 001; Jaroslav Nesetril; Damian Niwinski; David Peleg; Vladimiro Sassone; Alexandra Silva 001 (Bull. EATCS, 2020)

Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time. - Steffen Smolka; Nate Foster; Justin Hsu; Tobias Kappé; Dexter Kozen; Alexandra Silva 001 (Proc. ACM Program. Lang., 2020)

Conditional transition systems with upgrades. - Harsh Beohar; Barbara König 001; Sebastian Küpper; Alexandra Silva 001 (Sci. Comput. Program., 2020)

Left-handed completeness. - Dexter Kozen; Alexandra Silva 001 (Theor. Comput. Sci., 2020)

Toward a Uniform Theory of Effectful State Machines. - Sergey Goncharov 001; Stefan Milius; Alexandra Silva 001 (ACM Trans. Comput. Log., 2020)

Learning Pomset Automata. - Gerco van Heerdt; Tobias Kappé; Jurriaan Rot; Alexandra Silva 001 (FoSSaCS, 2021)

Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness. - Todd Schmid; Tobias Kappé; Dexter Kozen; Alexandra Silva 001 (ICALP, 2021)

A Bunched Logic for Conditional Independence. - Jialu Bao; Simon Docherty; Justin Hsu; Alexandra Silva 001 (LICS, 2021)

Prognosis: closed-box analysis of network protocol implementations. - Tiago Ferreira 001; Harrison Brewton; Loris D'Antoni; Alexandra Silva 001 (SIGCOMM, 2021)

Canonical automata via distributive law homomorphisms. - Stefan Zetzsche; Gerco van Heerdt; Alexandra Silva 001; Matteo Sammartino (MFPS, 2021)

On Star Expressions and Coalgebraic Completeness Theorems. - Todd Schmid; Jurriaan Rot; Alexandra Silva 001 (MFPS, 2021)

Actor-based model checking for Software-Defined Networks. - Elvira Albert; Miguel Gómez-Zamalloa; Miguel Isabel; Albert Rubio; Matteo Sammartino; Alexandra Silva 001 (J. Log. Algebraic Methods Program., 2021)

Distribution Bisimilarity via the Power of Convex Algebras. - Filippo Bonchi; Alexandra Silva 001; Ana Sokolova (Log. Methods Comput. Sci., 2021)

Equivalence checking for weak bi-Kleene algebra. - Tobias Kappé; Paul Brunet; Bas Luttik; Alexandra Silva 001; Fabio Zanasi (Log. Methods Comput. Sci., 2021)

ProbNV: probabilistic verification of network control planes. - Nick Giannarakis; Alexandra Silva 001; David Walker 001 (Proc. ACM Program. Lang., 2021)

Tree-Based Adaptive Model Learning. - Tiago Ferreira 001; Gerco van Heerdt; Alexandra Silva 001 (A Journey from Process Algebra via Timed Automata to Model Learning, 2022)

A Categorical Framework for Learning Generalised Tree Automata. - Gerco van Heerdt; Tobias Kappé; Jurriaan Rot; Matteo Sammartino; Alexandra Silva 001 (CMCS, 2022)

Concurrent NetKAT - Modeling and analyzing stateful, concurrent networks. - Jana Wagemaker; Nate Foster; Tobias Kappé; Dexter Kozen; Jurriaan Rot; Alexandra Silva 001 (ESOP, 2022)

Processes Parametrised by an Algebraic Theory. - Todd Schmid; Wojciech Rozowski; Alexandra Silva 001; Jurriaan Rot (ICALP, 2022)

Guarded Kleene Algebra with Tests: Automata Learning. - Stefan Zetzsche; Alexandra Silva 001; Matteo Sammartino (MFPS, 2022)

Formalizing Moessner's theorem and generalizations in Nuprl. - Mark Bickford; Dexter Kozen; Alexandra Silva 001 (J. Log. Algebraic Methods Program., 2022)

Generators and Bases for Monadic Closures. - Stefan Zetzsche; Alexandra Silva 001; Matteo Sammartino (CALCO, 2023)

Automata Learning with an Incomplete Teacher. - Mark Moeller; Thomas Wiener; Alaia Solko-Breslin; Caleb Koch 001; Nate Foster; Alexandra Silva 001 (ECOOP, 2023)

A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests. - Todd Schmid; Tobias Kappé; Alexandra Silva 001 (ESOP, 2023)

Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity. - Wojciech Rozowski; Tobias Kappé; Dexter Kozen; Todd Schmid; Alexandra Silva 001 (ICALP, 2023)

Deterministic stream-sampling for probabilistic programming: semantics and verification. - Fredrik Dahlqvist; Alexandra Silva 001; William Smith (LICS, 2023)

Symbolic Semantics for Probabilistic Programs. - Erik Voogd; Einar Broch Johnsen; Alexandra Silva 001; Zachary J. Susag; Andrzej Wasowski (QEST, 2023)

A Coalgebraic Approach to Reducing Finitary Automata. - Keri D'Angelo; Alexandra Silva 001; Gerco van Heerdt; Leon Witzman (CoRR, 2023)

Symbolic Semantics for Probabilistic Programs (extended version). - Erik Voogd; Einar Broch Johnsen; Alexandra Silva 001; Zachary J. Susag; Andrzej Wasowski (CoRR, 2023)

Joint Distributions in Probabilistic Semantics. - Dexter Kozen; Alexandra Silva 001; Erik Voogd (MFPS, 2023)

Conflict-Aware Active Automata Learning. - Tiago Ferreira 001; Léo Henry; Raquel Fernandes da Silva; Alexandra Silva 001 (GandALF, 2023)

Automata Learning with an Incomplete Teacher (Artifact). - Mark Moeller; Thomas Wiener; Alaia Solko-Breslin; Caleb Koch 001; Nate Foster; Alexandra Silva 001 (Dagstuhl Artifacts Ser., 2023)

Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning. - Noam Zilberstein; Derek Dreyer; Alexandra Silva 001 (Proc. ACM Program. Lang., 2023)

Long-Term Mentoring for Computer Science Researchers. - Emily Ruppel; Sihang Liu 001; Elba Garza; Sukyoung Ryu; Alexandra Silva 001; Talia Ringer (Commun. ACM, 2023)

Multisets and Distributions. - Dexter Kozen; Alexandra Silva 001 (Logics and Type Systems in Theory and Practice, 2024)

A Categorical Approach to DIBI Models. - Tao Gu 002; Jialu Bao; Justin Hsu; Alexandra Silva 001; Fabio Zanasi (FSCD, 2024)

On Iteration in Discrete Probabilistic Programming. - Mateo Torres-Ruiz; Robin Piedeleu; Alexandra Silva 001; Fabio Zanasi (FSCD, 2024)

Correct and Complete Symbolic Execution for Free. - Erik Voogd; Einar Broch Johnsen; Åsmund Aqissiaq Arild Kløvstad; Jurriaan Rot; Alexandra Silva 001 (IFM, 2024)

A Cyclic Proof System for Guarded Kleene Algebra with Tests. - Jan Rooduijn; Dexter Kozen; Alexandra Silva 001 (IJCAR (2), 2024)

A Completeness Theorem for Probabilistic Regular Expressions. - Wojciech Rozowski; Alexandra Silva 001 (LICS, 2024)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version). - Jan Rooduijn; Dexter Kozen; Alexandra Silva 001 (CoRR, 2024)

Total Outcome Logic: Proving Termination and Nontermination in Programs with Branching. - James Li; Noam Zilberstein; Alexandra Silva 001 (CoRR, 2024)

Probabilistic Concurrent Reasoning in Outcome Logic: Independence, Conditioning, and Invariants. - Noam Zilberstein; Alexandra Silva 001; Joseph Tassarotti (CoRR, 2024)

KATch: A Fast Symbolic Verifier for NetKAT. - Mark Moeller; Jules Jacobs; Olivier Savary Bélanger; David Darais; Cole Schlesinger; Steffen Smolka; Nate Foster; Alexandra Silva 001 (Proc. ACM Program. Lang., 2024)

Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers. - Linpeng Zhang; Noam Zilberstein; Benjamin Lucien Kaminski; Alexandra Silva 001 (Proc. ACM Program. Lang., 2024)

Outcome Separation Logic: Local Reasoning for Correctness and Incorrectness with Computational Effects. - Noam Zilberstein; Angelina Saliling; Alexandra Silva 001 (Proc. ACM Program. Lang., 2024)

Preface of the special issue on the conference on Computer-Aided Verification 2020 and 2021. - Aws Albarghouthi; K. Rustan M. Leino; Alexandra Silva 001; Caterina Urban (Formal Methods Syst. Des., 2024)

Denotational Semantics for Probabilistic and Concurrent Programs. - Noam Zilberstein; Daniele Gorla; Alexandra Silva 001 (CONCUR, 2025)

A Complete Diagrammatic Calculus for Automata Simulation. - Thibaut Antoine; Robin Piedeleu; Alexandra Silva 001; Fabio Zanasi (CSL, 2025)

A Complete Inference System for Probabilistic Infinite Trace Equivalence. - Corina Cîrstea; Lawrence S. Moss; Victoria Noquez; Todd Schmid; Alexandra Silva 001; Ana Sokolova (CSL, 2025)

A Complete Axiomatisation of Equivalence for Discrete Probabilistic Programming. - Robin Piedeleu; Mateo Torres-Ruiz; Alexandra Silva 001; Fabio Zanasi (ESOP (2), 2025)

Weighted GKAT: Completeness and Complexity. - Spencer Van Koevering; Wojciech Rozowski; Alexandra Silva 001 (ICALP, 2025)

On Formal Methods Thinking in Computer Science Education. - Brijesh Dongol; Catherine Dubois; Stefan Hallerstede; Eric C. R. Hehner; Carroll Morgan; Peter Müller 001; Leila Ribeiro 001; Alexandra Silva 001; Graeme Smith 001; Erik P. de Vink (Formal Aspects Comput., 2025)

27th Workshop on Logic, Language, Information and Computation - WoLLIC 2021. - Alexandra Silva 001; Renata Wassermann; Ruy J. G. B. de Queiroz (J. Log. Comput., 2025)

StacKAT: Infinite State Network Verification. - Jules Jacobs; Nate Foster; Tobias Kappé; Dexter Kozen; Lily Saada; Alexandra Silva 001; Jana Wagemaker (Proc. ACM Program. Lang., 2025)

Active Learning of Symbolic NetKAT Automata. - Mark Moeller; Tiago Ferreira 001; Thomas Lu; Nate Foster; Alexandra Silva 001 (Proc. ACM Program. Lang., 2025)

A Demonic Outcome Logic for Randomized Nondeterminism. - Noam Zilberstein; Dexter Kozen; Alexandra Silva 001; Joseph Tassarotti (Proc. ACM Program. Lang., 2025)

Convex language semantics for nondeterministic probabilistic automata. - Gerco van Heerdt; Justin Hsu; Joël Ouaknine; Alexandra Silva 001 (Theor. Comput. Sci., 2025)