4 citations · 4 across the 2 of their papers we have counts for
3 papers
RFSeek and Ye Shall Find
Noga H. Rotman, Tiago Ferreira, Hila Peleg +2
Requests for Comments (RFCs) are extensive specification documents for network protocols, but their prose-based format and their considerable length often impede precise operationa…
Active Learning of Symbolic NetKAT Automata
Mark Moeller, Tiago Ferreira, Thomas Lu +2
NetKAT is a domain-specific programming language and logic that has been successfully used to specify and verify the behavior of packet-switched networks. This paper develops techn…
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…