Image de couverture de livre

Information-flow Interfaces and Security Lattices

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bartocci, Ezio, Henzinger, Thomas A., Nickovic, Dejan, da Costa, Ana Oliveira
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Hypernode Automata
par: Bartocci, Ezio, et autres
Publié: (2023)

QuAK: Quantitative Automata Kit
par: Chalupa, Marek, et autres
Publié: (2024)

Safety and Liveness of Quantitative Properties and Automata
par: Boker, Udi, et autres
Publié: (2023)

Quantitative Language Automata
par: Henzinger, Thomas A., et autres
Publié: (2025)

Privacy-Preserving Runtime Verification
par: Henzinger, Thomas A., et autres
Publié: (2025)

Sharing The Secret: Distributed Privacy-Preserving Monitoring
par: Karimi, Mahyar, et autres
Publié: (2026)

Positive Varieties of Lattice Languages
par: Inoue, Yusuke, et autres
Publié: (2025)

Resolving Nondeterminism with Randomness
par: Henzinger, Thomas A., et autres
Publié: (2025)

Decoupled Planning for Multiple Omega-Regular Objectives
par: Avni, Guy, et autres
Publié: (2026)

Presenting Interval Pomsets with Interfaces
par: Amrane, Amazigh, et autres
Publié: (2024)

Passive Learning of Lattice Automata from Recurrent Neural Networks
par: Slimi, Jaouhar, et autres
Publié: (2025)

Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems
par: Shoudai, Takayoshi, et autres
Publié: (2026)

Vulnerabilities Analysis and Secure Controlling for Unmanned Aerial System Based on Reactive Synthesis
par: Yang, Dong, et autres
Publié: (2024)

Automating the Analysis of Quantitative Automata with QuAK
par: Chalupa, Marek, et autres
Publié: (2025)

Extending QuAK with Nested Quantitative Automata
par: Henzinger, Thomas A., et autres
Publié: (2026)

History-deterministic Timed Automata
par: Bose, Sougata, et autres
Publié: (2023)

Navigational hierarchies of regular languages
par: Place, Thomas, et autres
Publié: (2024)

Dot-depth three, return of the J-class
par: Place, Thomas, et autres
Publié: (2024)

All about unambiguous polynomial closure
par: Place, Thomas, et autres
Publié: (2022)

A General Information Extraction Framework Based on Formal Languages
par: Schmid, Markus L.
Publié: (2025)

Deciding Subtyping for Asynchronous Multiparty Sessions
par: Li, Elaine, et autres
Publié: (2024)

Flavors of Quantifiers in Hyperlogics
par: Chalupa, Marek, et autres
Publié: (2025)

Cost Automata, Safe Schemes, and Downward Closures
par: Barozzini, David, et autres
Publié: (2020)

Do CFLOBDDs Actually Make Use of Linear Structure?
par: Sistla, Meghana Aparna, et autres
Publié: (2026)

Efficient Runtime Verification of Real-Time Systems under Parametric Communication Delays
par: Fränzle, Martin, et autres
Publié: (2024)

Time for Timed Monitorability
par: Grosen, Thomas M., et autres
Publié: (2025)

Exploiting Assumptions for Effective Monitoring of Real-Time Properties under Partial Observability
par: Cimatti, Alessandro, et autres
Publié: (2024)

Measure Many Quantum Finite Automata on Infinite Words
par: Midya, Abhisek, et autres
Publié: (2026)

Type-Driven Prompt Programming: From Typed Interfaces to a Calculus of Constraints
par: Paul, Abhijit
Publié: (2025)

Inform: From Compartmental Models to Stochastic Bounded Counter Machines
par: Leys, Tim, et autres
Publié: (2024)

Quantum finite automata and linear context-free languages: a decidable problem
par: Bertoni, A., et autres
Publié: (2013)

Corrections to A Menagerie of Timed Automata
par: Keiren, Jeroen J. A., et autres
Publié: (2016)

A model of actors and grey failures
par: Bocchi, Laura, et autres
Publié: (2022)

Finite Automata for Efficient Graph Recognition
par: Drewes, Frank, et autres
Publié: (2024)

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
par: Akshay, S., et autres
Publié: (2024)

A Formal Approach for Tuning Stochastic Oscillators
par: Ballarini, Paolo, et autres
Publié: (2024)

A Tree Sampler for Bounded Context-Free Languages
par: Considine, Breandan
Publié: (2024)

Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
par: Hausmann, Daniel, et autres
Publié: (2024)

Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
par: Acharya, Rohan, et autres
Publié: (2024)

Characterization of Isometric Words based on Swap and Mismatch Distance
par: Anselmo, M., et autres
Publié: (2024)