4 citations · 8 across the 4 of their papers we have counts for
6 papers
A Detailed Account of Compositional Automata Learning through Alphabet Refinement
Leo Henry, Thomas Neele, Mohammad Reza Mousavi +1
Active automata learning infers automaton models of systems from behavioral observations, a technique successfully applied to a wide range of domains. Compositional approaches have…
ALARM: Active LeArning of Rowhammer Mitigations
Amir Naseredini, Martin Berger, Matteo Sammartino +1
Rowhammer is a serious security problem of contemporary dynamic random-access memory (DRAM) where reads or writes of bits can flip other bits. DRAM manufacturers add mitigations, b…
Actor-Based Model Checking for SDN Networks
Elvira Albert, Miguel Gómez-Zamalloa, Miguel Isabel +3
Software-Defined Networking (SDN) is a networking paradigm that has become increasingly popular in the last decade. The unprecedented control over the global behavior of the networ…
A (co)algebraic theory of succinct automata
Gerco van Heerdt, Joshua Moerman, Matteo Sammartino +1
The classical subset construction for non-deterministic automata can be generalized to other side-effects captured by a monad. The key insight is that both the state space of the d…
Symbolic Register Automata
Loris D'Antoni, Tiago Ferreira, Matteo Sammartino +1
Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automa…
Dynamic Programming on Nominal Graphs
Nicklas Hoch, Ugo Montanari, Matteo Sammartino
Many optimization problems can be naturally represented as (hyper) graphs, where vertices correspond to variables and edges to tasks, whose cost depends on the values of the adjace…