Image de couverture de livre

Tracer: A Tool for Race Detection in Software Defined Network Models

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Caltais, Georgiana, Zangiabady, Mahboobeh, Zvirbulis, Ervin
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory Networking and Internet Architecture Symbolic Computation
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Automata Size Reduction by Procedure Finding
par: Šedý, Michal, et autres
Publié: (2024)

It Takes a Village: Bridging the Gaps between Current and Formal Specifications for Protocols
par: Basin, David, et autres
Publié: (2025)

Executable QR codes with Machine Learning for Industrial Applications
par: Scanzio, Stefano, et autres
Publié: (2024)

Scalable Computation of Inter-Core Bounds Through Exact Abstractions
par: Foughali, Mohammed Aristide, et autres
Publié: (2024)

Specializing anti-unification for interaction models composition via gate connections
par: Nguetoum, Joel, et autres
Publié: (2025)

NetAgentBench: A State-Centric Benchmark for Evaluating Agentic Network Configuration
par: Twabi, Ahmed, et autres
Publié: (2026)

Formally Discovering and Reproducing Network Protocols Vulnerabilities
par: Crochet, Christophe, et autres
Publié: (2025)

Proceedings Combined 31st International Workshop on Expressiveness in Concurrency and 21st Workshop on Structural Operational Semantics
par: Caltais, Georgiana, et autres
Publié: (2024)

Algebraic power series and their automatic complexity modulo prime powers
par: Rowland, Eric, et autres
Publié: (2024)

Proving DNSSEC Correctness: A Formal Approach to Secure Domain Name Resolution
par: Zhang, Qifan, et autres
Publié: (2025)

Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems
par: Yamakami, Tomoyuki
Publié: (2024)

Scalable and Approximation-free Symbolic Control for Unknown Euler-Lagrange Systems
par: Das, Ratnangshu, et autres
Publié: (2025)

CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams
par: Sistla, Meghana, et autres
Publié: (2022)

Computing Sound Lower and Upper Bounds on Hamilton-Jacobi Reach-Avoid Value Functions
par: Tabbara, Ihab, et autres
Publié: (2025)

Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
par: Kiefer, Stefan, et autres
Publié: (2025)

Weakly-unambiguous Parikh automata and their link to holonomic series
par: Bostan, Alin, et autres
Publié: (2025)

Graded Symbolic Verification with a Fuzzy Dolev-Yao Attacker Model
par: Moran, Murat
Publié: (2026)

FORM: Learning Expressive and Transferable First-Order Logic Reward Machines
par: Ardon, Leo, et autres
Publié: (2024)

Real-Time Emergency Vehicle Detection using Mel Spectrograms and Regular Expressions
par: Pacheco-Gonzalez, Alberto, et autres
Publié: (2023)

DRAMPyML: A Formal Description of DRAM Protocols with Timed Petri Nets
par: Christ, Derek, et autres
Publié: (2026)

Automated Formal Verification of a Highly-Configurable Register Generator
par: Zhang, Shuhang, et autres
Publié: (2024)

In-Memory Sorting-Searching with Cayley Tree
par: Paul, Subrata, et autres
Publié: (2025)

Dynamic Symbolic Execution for Semantic Difference Analysis of Component and Connector Architectures
par: Grahl, Johanna, et autres
Publié: (2025)

Resynchronized Uniformization and Definability Problems for Rational Relations
par: Löding, Christof, et autres
Publié: (2021)

Some Remarks on First-Order Definable Tree Languages
par: Blumensath, Achim
Publié: (2024)

Efficient Solving for Dynamic Data Structure Constraint Satisfaction Problem
par: Li, Nanbing, et autres
Publié: (2026)

GOL in GOL in HOL: Verified Circuits in Conway's Game of Life
par: Myreen, Magnus O., et autres
Publié: (2025)

Combinatorics of nondeterministic walks
par: de Panafieu, Élie, et autres
Publié: (2023)

Engineering an LTLf Synthesis Tool
par: Duret-Lutz, Alexandre, et autres
Publié: (2025)

Robust and Attack Resilient Logic Locking with a High Application-Level Impact
par: Liu, Yuntao, et autres
Publié: (2021)

GrappaRE -- A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions
par: De Rosa, Mattia, et autres
Publié: (2025)

Existential Definability over the Subword Ordering
par: Baumann, Pascal, et autres
Publié: (2022)

Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations
par: Bueri, Lucas, et autres
Publié: (2024)

Characterization and Decidability of FC-Definable Regular Languages
par: Thompson, Sam M., et autres
Publié: (2025)

Bridging the Empirical-Theoretical Gap in Neural Network Formal Language Learning Using Minimum Description Length
par: Lan, Nur, et autres
Publié: (2024)

Transducing Language Models
par: Snæbjarnarson, Vésteinn, et autres
Publié: (2026)

An elementary proof of Bridy's theorem
par: Rowland, Eric, et autres
Publié: (2023)

Networks of Moore Machines
par: Yodaiken, Victor
Publié: (2015)

Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
par: Iosif, Radu, et autres
Publié: (2023)

On the Representational Capacity of Neural Language Models with Chain-of-Thought Reasoning
par: Nowak, Franz, et autres
Publié: (2024)