Matteo Sammartino

Orcid: 0000-0003-1456-2242

Affiliations:
  • University of London, Royal Holloway, UK


According to our database1, Matteo Sammartino authored at least 35 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Compositional Automata Learning of Synchronous Systems.
Proceedings of the Fundamental Approaches to Software Engineering, 2023

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

2022
Categorical specification and implementation of Replicated Data Types.
Theor. Comput. Sci., 2022

Residuality and Learning for Nondeterministic Nominal Automata.
Log. Methods Comput. Sci., 2022

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

ALARM: Active LeArning of Rowhammer Mitigations.
Proceedings of the 11th International Workshop on Hardware and Architectural Support for Security and Privacy, 2022

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

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

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

2020
Bases for algebras over a monad.
CoRR, 2020

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

Implementation Correctness for Replicated Data Types, Categorically.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30, 2020

Algebras for Tree Decomposable Graphs.
Proceedings of the Graph Transformation - 13th International Conference, 2020

Residual Nominal Automata.
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
A (co)algebraic theory of succinct automata.
J. Log. Algebraic Methods Program., 2019

A Categorical Account of Replicated Data Types.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 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
SDN-Actors: Modeling and Verification of SDN Programs.
Proceedings of the Formal Methods - 22nd International Symposium, 2018

Decomposition Structures for Soft Constraint Evaluation Problems: An Algebraic Approach.
Proceedings of the Graph Transformation, Specifications, and Nets, 2018

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

2015
From Local to Global Knowledge and Back.
Proceedings of the Software Engineering for Collective Autonomic Systems, 2015

Reconfigurable and Software-Defined Networks of Connectors and Components.
Proceedings of the Software Engineering for Collective Autonomic Systems, 2015

A coalgebraic semantics for causality in Petri nets.
J. Log. Algebraic Methods Program., 2015

Dynamic Programming on Nominal Graphs.
Proceedings of the Proceedings Graphs as Models, 2015

Revisiting causality, coalgebraically.
Acta Informatica, 2015

Causal Trees, Finally.
Proceedings of the Programming Languages with Applications to Biology and Security, 2015

2014
A network-conscious π-calculus and its coalgebraic semantics.
Theor. Comput. Sci., 2014

Network-Conscious π-calculus - A Model of Pastry.
Proceedings of the Ninth Workshop on Logical and Semantic Frameworks, with Applications, 2014

A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours.
Proceedings of the Trustworthy Global Computing - 9th International Symposium, 2014

2013
A Network-Aware Process Calculus for Global Computing and its Categorical Framework.
PhD thesis, 2013

A decidable class of (nominal) omega-regular languages over an infinite alphabet.
CoRR, 2013

2012
Network Conscious π-calculus: A Concurrent Semantics.
Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012


  Loading...