UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Browse by UCL people

Group by: Type | Date
Number of items: 13.

Article

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. Green open access
file

Heerdt, GV; Sammartino, M; Silva, A; (2019) Optimizing Automata Learning via Monads. arXiv Green open access
file

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. Green open access
file

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. Green open access
file

Proceedings paper

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. Green open access
file

Gadducci, F; Melgratti, H; Roldan, C; Sammartino, M; (2019) A Categorical Account of Replicated Data Types. In: Chattopadhyay, A and Gastin, P, (eds.) 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)}. (pp. 42:1-42:15). Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik: Dagstuhl, Germany. Green open access
file

Moerman, J; Sammartino, M; (2020) Residual nominal automata. In: Proceedings of the 31st International Conference on Concurrency Theory (CONCUR 2020). (pp. pp. 441-4421). Leibniz-Zentrum für Informatik, Dagstuhl Publishing Green open access
file

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. Green open access
file

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. Green open access
file

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 Green open access
file

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 Green open access
file

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. Green open access
file

Zetzsche, S; van Heerdt, G; Sammartino, M; Silva, A; (2021) Canonical Automata via Distributive Law Homomorphisms. In: Proceedings 37th Conference on Mathematical Foundations of Programming Semantics (MFPS 2021). (pp. pp. 296-313). Green open access
file

This list was generated on Sun Jan 11 04:27:05 2026 GMT.