default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatteo Sammartino
Person information
- affiliation: University of London, Royal Holloway, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c22]Stefan Zetzsche, Alexandra Silva, Matteo Sammartino:
Generators and Bases for Monadic Closures. CALCO 2023: 11:1-11:19- [c21]Thomas Neele, Matteo Sammartino:
Compositional Automata Learning of Synchronous Systems. FASE 2023: 47-66 - 2022
- [j7]Joshua Moerman
, Matteo Sammartino:
Residuality and Learning for Nondeterministic Nominal Automata. Log. Methods Comput. Sci. 18(1) (2022) - [j6]Fabio Gadducci, Hernán C. Melgratti, Christian Roldán, Matteo Sammartino:
Categorical specification and implementation of Replicated Data Types. Theor. Comput. Sci. 903: 84-112 (2022) - [c20]Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Matteo Sammartino, Alexandra Silva:
A Categorical Framework for Learning Generalised Tree Automata. CMCS 2022: 67-87 - [c19]Amir Naseredini, Martin Berger, Matteo Sammartino, Shale Xiong:
ALARM: Active LeArning of Rowhammer Mitigations. HASP@MICRO 2022: 1-9 - [c18]Stefan Zetzsche, Alexandra Silva, Matteo Sammartino:
Guarded Kleene Algebra with Tests: Automata Learning. MFPS 2022 - [i13]Amir Naseredini, Martin Berger, Matteo Sammartino, Shale Xiong:
ALARM: Active LeArning of Rowhammer Mitigations. CoRR abs/2211.16942 (2022) - 2021
- [j5]Elvira Albert, Miguel Gómez-Zamalloa, Miguel Isabel, Albert Rubio, Matteo Sammartino, Alexandra Silva:
Actor-based model checking for Software-Defined Networks. J. Log. Algebraic Methods Program. 118: 100617 (2021) - [c17]Stefan Zetzsche, Gerco van Heerdt, Alexandra Silva, Matteo Sammartino:
Canonical automata via distributive law homomorphisms. MFPS 2021: 296-313 - 2020
- [c16]Gerco van Heerdt, Matteo Sammartino, Alexandra Silva:
Learning Automata with Side-Effects. CMCS 2020: 68-89 - [c15]Joshua Moerman, Matteo Sammartino:
Residual Nominal Automata. CONCUR 2020: 44:1-44:21 - [c14]Roberto Bruni, Ugo Montanari, Matteo Sammartino:
Algebras for Tree Decomposable Graphs. ICGT 2020: 203-220 - [c13]Fabio Gadducci, Hernán C. Melgratti, Christian Roldán, Matteo Sammartino:
Implementation Correctness for Replicated Data Types, Categorically. ICTAC 2020: 283-303 - [i12]Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Matteo Sammartino, Alexandra Silva:
A Categorical Framework for Learning Generalised Tree Automata. CoRR abs/2001.05786 (2020) - [i11]Elvira Albert, Miguel Gómez-Zamalloa, Miguel Isabel, Albert Rubio, Matteo Sammartino, Alexandra Silva:
Actor-Based Model Checking for SDN Networks. CoRR abs/2001.10022 (2020) - [i10]Stefan Zetzsche, Alexandra Silva, Matteo Sammartino:
Bases for algebras over a monad. CoRR abs/2010.10223 (2020)
2010 – 2019
- 2019
- [j4]Gerco van Heerdt, Joshua Moerman, Matteo Sammartino, Alexandra Silva:
A (co)algebraic theory of succinct automata. J. Log. Algebraic Methods Program. 105: 112-125 (2019) - [c12]Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Matteo Sammartino, Alexandra Silva:
Tree Automata as Algebras: Minimisation and Determinisation. CALCO 2019: 6:1-6:22 - [c11]Loris D'Antoni, Tiago Ferreira, Matteo Sammartino, Alexandra Silva:
Symbolic Register Automata. CAV (1) 2019: 3-21 - [c10]Fabio Gadducci, Hernán C. Melgratti, Christian Roldán, Matteo Sammartino:
A Categorical Account of Replicated Data Types. FSTTCS 2019: 42:1-42:15 - [i9]Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Matteo Sammartino, Alexandra Silva:
Tree Automata as Algebras: Minimisation and Determinisation. CoRR abs/1904.08802 (2019) - [i8]Gerco van Heerdt, Joshua Moerman, Matteo Sammartino, Alexandra Silva:
A (co)algebraic theory of succinct automata. CoRR abs/1905.05519 (2019) - [i7]Joshua Moerman, Matteo Sammartino:
Residual Nominal Automata. CoRR abs/1910.11666 (2019) - 2018
- [c9]Ugo Montanari, Matteo Sammartino, Alain Tcheukam Siwe:
Decomposition Structures for Soft Constraint Evaluation Problems: An Algebraic Approach. Graph Transformation, Specifications, and Nets 2018: 179-200 - [c8]Elvira Albert, Miguel Gómez-Zamalloa, Albert Rubio, Matteo Sammartino, Alexandra Silva:
SDN-Actors: Modeling and Verification of SDN Programs. FM 2018: 550-567 - [i6]Loris D'Antoni, Tiago Ferreira, Matteo Sammartino, Alexandra Silva:
Symbolic Register Automata. CoRR abs/1811.06968 (2018) - 2017
- [c7]Gerco van Heerdt, Matteo Sammartino, Alexandra Silva:
CALF: Categorical Automata Learning Framework. CSL 2017: 29:1-29:24 - [c6]Joshua Moerman, Matteo Sammartino, Alexandra Silva, Bartek Klin, Michal Szynwelski:
Learning nominal automata. POPL 2017: 613-625 - [i5]Gerco van Heerdt, Matteo Sammartino, Alexandra Silva:
CALF: Categorical Automata Learning Framework. CoRR abs/1704.05676 (2017) - [i4]Gerco van Heerdt, Matteo Sammartino, Alexandra Silva:
Learning Automata with Side-Effects. CoRR abs/1704.08055 (2017) - 2016
- [i3]Joshua Moerman, Matteo Sammartino, Alexandra Silva, Bartek Klin, Michal Szynwelski:
Learning Nominal Automata. CoRR abs/1607.06268 (2016) - 2015
- [j3]Roberto Bruni, Ugo Montanari, Matteo Sammartino:
Revisiting causality, coalgebraically. Acta Informatica 52(1): 5-33 (2015) - [j2]Roberto Bruni, Ugo Montanari, Matteo Sammartino:
A coalgebraic semantics for causality in Petri nets. J. Log. Algebraic Methods Program. 84(6): 853-883 (2015) - [c5]Roberto Bruni, Ugo Montanari, Matteo Sammartino:
Causal Trees, Finally. Programming Languages with Applications to Biology and Security 2015: 27-43 - [c4]Nicklas Hoch, Ugo Montanari, Matteo Sammartino:
Dynamic Programming on Nominal Graphs. GaM 2015: 80-96 - [p2]Roberto Bruni, Ugo Montanari, Matteo Sammartino:
Reconfigurable and Software-Defined Networks of Connectors and Components. The ASCENS Approach 2015: 73-106 - [p1]Nicklas Hoch, Giacoma Valentina Monreale, Ugo Montanari, Matteo Sammartino, Alain Tcheukam Siwe:
From Local to Global Knowledge and Back. The ASCENS Approach 2015: 185-220 - [i2]Roberto Bruni, Ugo Montanari, Matteo Sammartino:
A coalgebraic semantics for causality in Petri nets. CoRR abs/1507.06462 (2015) - 2014
- [j1]Ugo Montanari, Matteo Sammartino:
A network-conscious π-calculus and its coalgebraic semantics. Theor. Comput. Sci. 546: 188-224 (2014) - [c3]Vincenzo Ciancia, Matteo Sammartino:
A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours. TGC 2014: 97-111 - [c2]Ugo Montanari, Matteo Sammartino:
Network-Conscious π-calculus - A Model of Pastry. LSFA 2014: 3-17 - 2013
- [b1]Matteo Sammartino:
A Network-Aware Process Calculus for Global Computing and its Categorical Framework. University of Pisa, Italy, 2013 - [i1]Vincenzo Ciancia, Matteo Sammartino:
A decidable class of (nominal) omega-regular languages over an infinite alphabet. CoRR abs/1310.3945 (2013) - 2012
- [c1]Ugo Montanari, Matteo Sammartino:
Network Conscious π-calculus: A Concurrent Semantics. MFPS 2012: 291-306
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-28 01:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
