Browse by UCL people
Group by: Type | Date
Number of items: 68.
2025
Moeller, M;
Ferreira, T;
Lu, T;
Foster, N;
Silva, A;
(2025)
Active Learning of Symbolic NetKAT Automata.
Proceedings of the ACM on Programming Languages
, 9
(PLDI)
pp. 1119-1142.
10.1145/3729295.
|
|
van Heerdt, G;
Hsu, J;
Ouaknine, J;
Silva, A;
(2025)
Convex language semantics for nondeterministic probabilistic automata.
Theoretical Computer Science
, 1040
, Article 115191. 10.1016/j.tcs.2025.115191.
|
|
Voogd, Erik;
Johnsen, Einar Broch;
Kløvstad, Åsmund Aqissiaq Arild;
Rot, Jurriaan;
Silva, Alexandra;
(2025)
Correct and Complete Symbolic Execution for Free.
In: Kosmatov, Nikolai and Kovács, Laura, (eds.)
Integrated Formal Methods: IFM 2024.
(pp. pp. 237-255).
Springer: Cham, Switzerland.
|
|
Zilberstein, N;
Gorla, D;
Silva, A;
(2025)
Denotational Semantics for Probabilistic and Concurrent Programs.
In:
36th International Conference on Concurrency Theory (CONCUR 2025). Leibniz International Proceedings in Informatics (LIPIcs).
(pp. 39:1-39:24).
Leibniz-Zentrum für Informatik: Dagstuhl, Germany.
|
 |
2023
|
Dahlqvist, F;
Silva, A;
Smith, W;
(2023)
Deterministic stream-sampling for probabilistic programming: semantics and verification.
In:
2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
IEEE: Boston, MA, USA.
|
|
Ferreira, T;
Henry, L;
Da Silva, RF;
Silva, A;
(2023)
Conflict-Aware Active Automata Learning.
In: Achilleos, A and Della Monica, D, (eds.)
Proceedings of the Fourteenth International Symposium on Games, Automata, Logics, and Formal Verification.
(pp. pp. 150-167).
ArXiv: Ithaca, NY, USA.
|
|
|
Różowski, W;
Kappé, T;
Kozen, D;
Schmid, T;
Silva, A;
(2023)
Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity.
In:
Leibniz International Proceedings in Informatics (LIPIcs).
Leibniz-Zentrum für Informatik: Paderborn, Germany.
|
|
Voogd, E;
Johnsen, EB;
Silva, A;
Susag, ZJ;
Wąsowski, A;
(2023)
Symbolic Semantics for Probabilistic Programs.
In:
International Conference on Quantitative Evaluation of Systems QEST 2023: Quantitative Evaluation of Systems.
(pp. pp. 329-345).
Springer, Cham
|
|
Zetzsche, S;
Silva, A;
Sammartino, M;
(2023)
Generators and Bases for Monadic Closures.
In:
Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023).
(pp. pp. 1-19).
Schloss Dagstuhl Leibniz-Zentrum für Informatik: Dagstuhl, Germany.
|
 |
2022
|
Bickford, M;
Kozen, D;
Silva, A;
(2022)
Formalizing Moessner's theorem and generalizations in Nuprl.
Journal of Logical and Algebraic Methods in Programming
, 124
, Article 100713. 10.1016/j.jlamp.2021.100713.
|
|
Heerdt, GV;
Kappé, T;
Rot, J;
Sammartino, M;
Silva, A;
(2022)
A Categorical Framework for Learning Generalised Tree Automata.
In:
Coalgebraic Methods in Computer Science.
(pp. pp. 67-87).
Springer Nature: Cham, Switzerland.
|
|
Schmid, T;
Rozowski, W;
Silva, A;
Rot, J;
(2022)
Processes Parametrised by an Algebraic Theory.
In:
49th International Colloquium on Automata, Languages, and Programming (ICALP 2022).
(pp. 132:1-132:20).
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
|
|
Schmid, Todd;
Rozowski, Wojciech;
Silva, Alexandra;
Rot, Jurriaan;
(2022)
Processes Parametrised by an Algebraic Theory.
arXiv
|
|
Wagemaker, Jana;
Foster, Nate;
Kappe, Tobias;
Kozen, Dexter;
Rot, Jurriaan;
Silva, Alexandra;
(2022)
Concurrent NetKAT Modeling and analyzing stateful, concurrent networks.
In: Sergey, I, (ed.)
ESOP 2022: Programming Languages and Systems.
(pp. pp. 575-602).
Springer Nature
|
2021
|
Albert, E;
Gómez-Zamalloa, M;
Isabel, M;
Rubio, A;
Sammartino, M;
Silva, A;
(2021)
Actor-based model checking for Software-Defined Networks.
Journal of Logical and Algebraic Methods in Programming
, 118
, Article 100617. 10.1016/j.jlamp.2020.100617.
|
|
Bao, J;
Docherty, S;
Hsu, J;
Silva, A;
(2021)
A Bunched Logic for Conditional Independence.
In:
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
IEEE
(In press).
|
|
|
Bonchi, F;
Silva, A;
Sokolova, A;
(2021)
Distribution Bisimilarity via the Power of Convex Algebras.
Logical Methods in Computer Science
, 17
(3)
10:1-10:28.
10.46298/LMCS-17(3:10)2021.
|
|
|
Ferreira, T;
Brewton, H;
D'Antoni, L;
Silva, A;
(2021)
Prognosis: Closed-box analysis of network protocol implementations.
In:
SIGCOMM '21: Proceedings of the 2021 ACM SIGCOMM 2021 Conference.
(pp. pp. 762-774).
ACM Press: New York, NY, USA.
|
|
|
Giannarakis, N;
Silva, A;
Walker, D;
(2021)
ProbNV: probabilistic verification of network control planes.
In:
Proceedings of the ACM on Programming Languages (PACMPL).
(pp. 90.1-90.30).
Association for Computing Machinery (ACM): New York, NY, United States.
|
|
|
Heerdt, GV;
Kappé, T;
Rot, J;
Silva, A;
(2021)
Learning Pomset Automata.
In: Kiefer, S and Tasson, C, (eds.)
Foundations of Software Science and Computation Structures. FOSSACS 2021.
(pp. pp. 510-530).
Springer: Cham, Switzerland.
|
|
|
Kappé, T;
Brunet, P;
Luttik, B;
Silva, A;
Zanasi, F;
(2021)
Equivalence checking for weak bi-Kleene algebra.
Logical Methods in Computer Science
, 17
(3)
19:1-19:53.
10.46298/LMCS-17(3:19)2021.
|
|
|
Schmid, T;
Rot, J;
Silva, A;
(2021)
On Star Expressions and Completeness Theorems.
In:
Proceedings: 37th Conference on Mathematical Foundations of Programming Semantics.
(pp. pp. 242-259).
|
|
Schmid, T;
Kappé, T;
Kozen, D;
Silva, A;
(2021)
Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness.
In: Bansal, N and Merelli, E and Worrell, J, (eds.)
ICALP 2021.
(pp. 142:1-142:14).
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
|
|
2020
|
Aceto, L;
Baeten, J;
Bouyer-Decitre, P;
Hermanns, H;
Silva, A;
(2020)
CONCUR Test-Of-Time Award 2020 Announcement.
In: Konnov, I and Kovács, L, (eds.)
31st International Conference on Concurrency Theory (CONCUR 2020).
(pp. 5:1-5:3).
Schloss Dagstuhl--Leibniz-Zentrum für Informatik: Dagstuhl, Germany.
|
|
|
Beohar, H;
Koenig, B;
Kuepper, S;
Silva, A;
(2020)
Conditional transition systems with upgrades.
Science of Computer Programming
, 186
, Article 102320. 10.1016/j.scico.2019.102320.
|
|
|
Goncharov, S;
Milius, S;
Silva, A;
(2020)
Toward a Uniform Theory of Effectful State Machines.
ACM Transactions on Computational Logic
, 21
(3)
, Article 23. 10.1145/3372880.
|
|
|
Gu, T;
Silva, A;
Zanasi, F;
(2020)
Hennessy-Milner Results for Probabilistic PDL.
In:
Electronic Notes in Theoretical Computer Science.
(pp. pp. 283-304).
Elsevier: Duivendrecht, Netherlands.
|
|
|
Kappé, T;
Brunet, P;
Silva, A;
Wagemaker, J;
Zanasi, F;
(2020)
Concurrent Kleene Algebra with Observations: From Hypotheses to Completeness.
In: Goubault-Larrecq, J and König, B, (eds.)
Foundations of Software Science and Computation Structures: 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings.
(pp. pp. 381-400).
Springer: Cham, Switzerland.
|
|
|
Kozen, D;
Silva, A;
(2020)
Left-handed completeness.
Theoretical Computer Science
, 807
pp. 220-233.
10.1016/j.tcs.2019.10.040.
|
|
Parlant, L;
Rot, J;
Silva, A;
Westerbaan, B;
(2020)
Preservation of Equations by Monoidal Monads.
In: Esparza, J and Král', D, (eds.)
(Proceedings) 45th MFCS 2020.
(pp. 77:1-77:1).
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
|
|
|
van Heerdt, G;
Kupke, C;
Rot, J;
Silva, A;
(2020)
Learning Weighted Automata over Principal Ideal Domains.
Lecture Notes in Computer Science
, 12077
pp. 602-621.
10.1007/978-3-030-45231-5_31.
|
|
|
van Heerdt, G;
Sammartino, M;
Silva, A;
(2020)
Learning automata with side-effects.
In:
Coalgebraic Methods in Computer Science.
(pp. pp. 68-89).
Springer Nature
|
|
|
Wagemaker, J;
Brunet, P;
Docherty, S;
Kappé, T;
Rot, J;
Silva, A;
(2020)
Partially Observable Concurrent Kleene Algebra.
In:
31st International Conference on Concurrency Theory (CONCUR 2020).
(pp. 20:1-20:22).
Schloss Dagstuhl--Leibniz-Zentrum für Informatik: Dagstuhl, Germany.
|
2019
|
Brunet, P;
Silva, A;
(2019)
A kleene theorem for nominal automata.
In:
46th International Colloquium on Automata, Languages, and Programming (ICALP 2019).
(pp. 107:1-107:13).
Dagstuhl Publishing: Patras, Greece.
|
|
|
Heerdt, GV;
Sammartino, M;
Silva, A;
(2019)
Optimizing Automata Learning via Monads.
arXiv
|
|
Kappe, T;
Brunet, P;
Luttik, B;
Silva, A;
Zanasi, F;
(2019)
On series-parallel pomset languages: Rationality, context-freeness and automata.
Journal of Logical and Algebraic Methods in Programming
, 103
pp. 130-153.
10.1016/j.jlamp.2018.12.001.
|
|
Kappe, T;
Brunet, P;
Rot, J;
Silva, A;
Wagemaker, J;
Zanasi, F;
(2019)
Kleene Algebra with Observations.
In:
Proceedings of the 30th International Conference on Concurrency Theory (CONCUR 2019).
(pp. 41:1 -41:16).
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik: Dagstuhl, Germany.
|
|
|
Sammartino, M;
Silva, A;
Ferreira, T;
D'Antoni, L;
(2019)
Symbolic Register Automata.
In: Dillig, I and Tasiran, S, (eds.)
International Conference on Computer Aided Verification, CAV 2019. Lecture Notes in Computer Science, vol 11561.
Springer: Cham.
|
|
|
Sammartino, M;
Van Heerdt, G;
Silva, A;
Moerman, J;
(2019)
A (co)algebraic theory of succinct automata.
Journal of Logical and Algebraic Methods in Programming
, 105
pp. 112-125.
10.1016/j.jlamp.2019.02.008.
|
|
Silva, A;
(2019)
An algebraic framework to reason about concurrency.
In: Chattopadhyay, A and Gastin, P, (eds.)
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019).
(pp. 6.1).
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik: Dagstuhl, Germany.
|
|
|
Smolka, S;
Foster, N;
Hsu, J;
Kappé, T;
Kozen, D;
Silva, A;
(2019)
Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time.
Proceedings of the ACM on Programming Languages
, 4
(POPL)
, Article 61. 10.1145/3371129.
|
|
|
Smolka, S;
Kumar, P;
Kahn, DM;
Foster, N;
Hsu, J;
Kozen, D;
Silva, A;
(2019)
Scalable verification of probabilistic networks.
In:
PLDI 2019 Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation.
(pp. pp. 190-203).
ACM: Phoenix, AZ, USA.
|
|
|
van Heerdt, G;
Kappé, T;
Rot, J;
Sammartino, M;
Silva, A;
(2019)
Tree automata as algebras: Minimisation and determinisation.
In:
Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019).
(pp. 6:1-6:22).
LIPICS
|
|
|
Wagemaker, J;
Bonsangue, M;
Kappé, T;
Rot, J;
Silva, A;
(2019)
Completeness and Incompleteness of Synchronous Kleene Algebra.
In:
Mathematics of Program Construction.
(pp. pp. 385-413).
Springer: Cham, Switzerland.
|
2018
|
Aguirre, A;
Barthe, G;
Hsu, J;
Silva, A;
(2018)
Almost sure productivity.
In:
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018).
(pp. 113.1-113.15).
LIPIcs , Schloss Dagstuhl - Leibniz-Zentrum für Informatik: Prague, Czech Republic.
|
|
Albert, E;
Gómez-Zamalloa, M;
Rubio, A;
Sammartino, M;
Silva, A;
(2018)
SDN-Actors: Modeling and Verification of SDN Programs.
In: Havelund, K and Peleska, J and Roscoe, B and de Vink, E, (eds.)
Proceedings of International Symposium on Formal Methods 2018.
(pp. pp. 550-567).
Springer Nature: Cham, Switzerland.
|
|
Beohar, H;
König, B;
Küpper, S;
Silva, A;
(2018)
Conditional transition systems with upgrades.
In:
Proceedings of the International Symposium on Theoretical Aspects of Software Engineering (TASE) 2017.
(pp. pp. 1-8).
IEEE: Danvers (MA), USA.
|
|
Beohar, H;
König, B;
Küpper, S;
Silva, A;
Wissmann, T;
(2018)
A coalgebraic treatment of conditional transition systems with upgrades.
Logical Methods in Computer Science
, 14
(1)
10.23638/LMCS-14(1:19)2018.
|
|
|
Dahlqvist, F;
Parlant, L;
Silva, A;
(2018)
Layer by Layer – Combining Monads.
In: Fischer, B and Uustalu, T, (eds.)
Theoretical Aspects of Computing – ICTAC 2018. ICTAC 2018. Lecture Notes in Computer Science.
(pp. pp. 153-172).
Springer: Cham.
|
|
Endrullis, J;
Hansen, HH;
Hendriks, D;
Polonsky, A;
Silva, A;
(2018)
Coinductive foundations of infinitary rewriting and infinitary equational logic.
Logical Methods in Computer Science
, 14
(1)
10.23638/LMCS-14(1:3)2018.
|
|
|
Kappé, T;
Brunet, P;
Silva, A;
Zanasi, F;
(2018)
Concurrent Kleene Algebra: Free Model and Completeness.
In: Ahmed, A, (ed.)
Programming Languages and Systems.
(pp. pp. 856-882).
Springer: Thessaloniki, Greece.
|
|
|
Silva, A;
(2018)
Preface.
Electronic Notes in Theoretical Computer Science
, 336
pp. 1-3.
10.1016/j.entcs.2018.03.012.
|
|
|
Silva, A;
Dahlqvist, F;
Danos, V;
Garnier, I;
(2018)
Borel Kernels and their Approximation, Categorically.
In:
Proceedings of the 34th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXIV).
(pp. pp. 91-119).
Elsevier: Toronto, Canada.
|
|
van Heerdt, G;
Hsu, J;
Ouaknine, J;
Silva, A;
(2018)
Convex Language Semantics for Nondeterministic Probabilistic Automata.
In: Fischer, B and Uustalu, T, (eds.)
Theoretical Aspects of Computing – ICTAC 2018. ICTAC 2018. Lecture Notes in Computer Science.
(pp. pp. 472-492).
Springer: Cham.
|
|
van Heerdt, G;
Jacobs, B;
Kappé, T;
Silva, A;
(2018)
Learning to Coordinate.
In: de Boer, F and Bonsangue, M and Rutten, J, (eds.)
It's All About Coordination: Essays to Celebrate the Lifelong Scientific Achievements of Farhad Arbab.
(pp. 139-159).
Springer: Cham, Switzerland.
|
2017
|
Bonchi, F;
Silva, A;
Sokolova, A;
(2017)
The power of convex algebras.
In: Meyer, R and Nestmann, U, (eds.)
28th International Conference on Concurrency Theory (CONCUR 2017).
(pp. 23:1-23:18).
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik: Dagstuhl, Germany.
|
|
|
Jeannin, J-B;
Kozen, D;
Silva, A;
(2017)
CoCaml: Functional Programming with Regular Coinductive Types.
Fundamenta Informaticae
, 150
(3-4)
pp. 347-377.
10.3233/FI-2017-1473.
|
|
Kappe, T;
Brunet, P;
Luttik, B;
Silva, A;
Zanasi, F;
(2017)
Brzozowski Goes Concurrent-A Kleene Theorem for Pomset Languages.
In: Meyer, R and Nestmann;, U, (eds.)
Proceedings of the CONCUR 2017 : 28th International Conference on Concurrency Theory.
(pp. 25:1-25:16).
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik: Dagstuhl, Germany.
|
|
|
Kozen, D;
Mamouras, K;
Silva, A;
(2017)
Completeness and incompleteness in nominal Kleene algebra.
Journal of Logical and Algebraic Methods in Programming
, 91
pp. 17-32.
10.1016/j.jlamp.2017.06.002.
|
|
|
Moerman, J;
Sammartino, M;
Silva, A;
Klin, B;
Szynwelski, M;
(2017)
Learning nominal automata.
In: Castagna, Giuseppe and Gordon, Andrew D., (eds.)
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017.
(pp. pp. 613-625).
ACM: Paris, France.
|
|
|
Moerman, J;
Sammartino, M;
Silva, A;
Klin, B;
Szynwelski, M;
(2017)
Learning nominal automata.
ACM SIGPLAN Notices - POPL '17
, 52
(1)
pp. 613-625.
10.1145/3093333.3009879.
|
|
Rot, J;
Bonchi, F;
Bonsangue, M;
Pous, D;
Rutten, J;
Silva, A;
(2017)
Enhanced coalgebraic bisimulation.
Mathematical Structures in Computer Science
, 27
(7)
pp. 1236-1264.
10.1017/S0960129515000523.
|
|
|
Smolka, S;
Kumar, P;
Foster, N;
Kozen, D;
Silva, A;
(2017)
Cantor Meets Scott: Semantic Foundations for Probabilistic Networks.
In: Castagna, Giuseppe and Gordon, Andrew D., (eds.)
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017.
(pp. pp. 557-571).
ACM: Paris, France.
|
|
|
Smolka, S;
Kumar, P;
Foster, N;
Kozen, D;
Silva, A;
(2017)
Cantor meets Scott: semantic foundations for probabilistic networks.
ACM SIGPLAN Notices - POPL '17
, 52
(1)
pp. 557-571.
10.1145/3093333.3009843.
|
|
|
Van Heerdt, G;
Sammartino, M;
Silva, A;
(2017)
CALF: Categorical automata learning framework.
In: Goranko, V and Dam, M, (eds.)
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic (CSL 2017).
(pp. 29:1-29:24).
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik: Dagstuhl, Germany.
|
|
2016
|
Bonchi, F;
Bonsangue, M;
Caltais, G;
Rutten, J;
Silva, A;
(2016)
A coalgebraic view on decorated traces.
Mathematical Structures in Computer Science
, 26
(7)
pp. 1234-1268.
10.1017/S0960129514000449.
|
|
Foster, N;
Kozen, D;
Mamouras, K;
Reitblatt, M;
Silva, A;
(2016)
Probabilistic NetKAT.
In: Thiemann, P, (ed.)
Programming Languages and Systems: 25th European Symposium on Programming, ESOP 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, 2-8 April 2016, Proceedings.
(pp. pp. 282-309).
Springer Berlin Heidelberg
|
|
|
Krebbers, R;
Parlant, L;
Silva, A;
(2016)
Moessner's theorem: An exercise in coinductive reasoning in COQ.
In: Abraham, E and Bonsangue, M and Johnsen, EB, (eds.)
Theory and Practice of Formal Methods: Essays Dedicated to Frank de Boer on the Occasion of His 60th Birthday.
(pp. pp. 309-324).
Springer International Publishing
|
|
