Zobrazeno 1 - 10
of 57
pro vyhledávání: '"Sammartino, Matteo"'
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, but don't disclose details, making it difficult for customers to evalua
Externí odkaz:
http://arxiv.org/abs/2211.16942
Publikováno v:
Electronic Notes in Theoretical Informatics and Computer Science, Volume 1 - Proceedings of MFPS XXXVIII (February 28, 2023) entics:10505
Guarded Kleene Algebra with Tests (GKAT) is the fragment of Kleene Algebra with Tests (KAT) that arises by replacing the union and iteration operations of KAT with predicate-guarded variants. GKAT is more efficiently decidable than KAT and expressive
Externí odkaz:
http://arxiv.org/abs/2204.14153
Publikováno v:
EPTCS 351, 2021, pp. 296-313
The classical powerset construction is a standard method converting a non-deterministic automaton into a deterministic one recognising the same language. Recently, the powerset construction has been lifted to a more general framework that converts an
Externí odkaz:
http://arxiv.org/abs/2104.13421
It is well-known that every regular language admits a unique minimal deterministic acceptor. Establishing an analogous result for non-deterministic acceptors is significantly more difficult, but nonetheless of great practical importance. To tackle th
Externí odkaz:
http://arxiv.org/abs/2010.10223
Autor:
Albert, Elvira, Gómez-Zamalloa, Miguel, Isabel, Miguel, Rubio, Albert, Sammartino, Matteo, Silva, Alexandra
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 network it provides opens a range of new opportunities for formal methods an
Externí odkaz:
http://arxiv.org/abs/2001.10022
Publikováno v:
Proc. CMCS 2022, pp 67-87
Automata learning is a popular technique used to automatically construct an automaton model from queries. Much research went into devising ad hoc adaptations of algorithms for different types of automata. The CALF project seeks to unify these using c
Externí odkaz:
http://arxiv.org/abs/2001.05786
Autor:
Moerman, Joshua, Sammartino, Matteo
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 1 (February 3, 2022) lmcs:7332
We are motivated by the following question: which data languages admit an active learning algorithm? This question was left open in previous work by the authors, and is particularly challenging for languages recognised by nondeterministic automata. T
Externí odkaz:
http://arxiv.org/abs/1910.11666
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 determinized automaton and its semantics---languages over an alphabet--
Externí odkaz:
http://arxiv.org/abs/1905.05519
Publikováno v:
Proc. CALCO 2019, pp 6:1-6:22
We study a categorical generalisation of tree automata, as $\Sigma$-algebras for a fixed endofunctor $\Sigma$ endowed with initial and final states. Under mild assumptions about the base category, we present a general minimisation algorithm for these
Externí odkaz:
http://arxiv.org/abs/1904.08802
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 automata address a demand for a model over large or infinite alphabets, resp
Externí odkaz:
http://arxiv.org/abs/1811.06968