Imagen de Portada

Automated generation of attack trees with optimal shape and labelling

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gadyatskaya, Olga, Mauw, Sjouke, Trujillo-Rasuac, Rolando, Willemse, Tim A. C.
Formato:	Preprint
Publicado:	2023
Materias:	Cryptography and Security Formal Languages and Automata Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Regular Expression Denial of Service Induced by Backreferences
por: Liu, Yichen, et al.
Publicado: (2026)

Privacy-Preserving Runtime Verification
por: Henzinger, Thomas A., et al.
Publicado: (2025)

Sharing The Secret: Distributed Privacy-Preserving Monitoring
por: Karimi, Mahyar, et al.
Publicado: (2026)

Reachability Analysis of the Domain Name System
por: Nevatia, Dhruv, et al.
Publicado: (2024)

Verification and Attack Synthesis for Network Protocols
por: von Hippel, Max
Publicado: (2025)

Oblivious Monitoring for Discrete-Time STL via Fully Homomorphic Encryption
por: Waga, Masaki, et al.
Publicado: (2024)

Formal Modelling and Security Analysis of Bitcoin's Payment Protocol
por: Modesti, Paolo, et al.
Publicado: (2021)

Attack Tree Generation via Process Mining
por: Konsta, Alyzia-Maria, et al.
Publicado: (2024)

From High-Level Types to Low-Level Monitors: Synthesizing Verified Runtime Checkers for MAVLink
por: Amorim, Arthur, et al.
Publicado: (2026)

Cellular Automata based Resource Efficient Maximally Equidistributed Pseudo-Random Number Generators
por: A, Bhuvaneswari, et al.
Publicado: (2026)

Robust and Attack Resilient Logic Locking with a High Application-Level Impact
por: Liu, Yuntao, et al.
Publicado: (2021)

Formally Verifying Noir Zero Knowledge Programs with NAVe
por: Antonino, Pedro, et al.
Publicado: (2026)

Shallow Implementation of Quantum Fingerprinting with Application to Quantum Finite Automata
por: Ziiatdinov, Mansur, et al.
Publicado: (2024)

Agentproof: Static Verification of Agent Workflow Graphs
por: Xavier, Melwin, et al.
Publicado: (2026)

The Bright Side of Timed Opacity
por: André, Étienne, et al.
Publicado: (2024)

Formally Discovering and Reproducing Network Protocols Vulnerabilities
por: Crochet, Christophe, et al.
Publicado: (2025)

Proving DNSSEC Correctness: A Formal Approach to Secure Domain Name Resolution
por: Zhang, Qifan, et al.
Publicado: (2025)

Formal Verification of Physical Layer Security Protocols for Next-Generation Communication Networks (extended version)
por: Ye, Kangfeng, et al.
Publicado: (2025)

Data-Flow-Based Normalization Generation Algorithm of R1CS for Zero-Knowledge Proof
por: Shi, Chenhao, et al.
Publicado: (2023)

Symmaries: Automatic Inference of Formal Security Summaries for Java Programs
por: Khakpour, Narges, et al.
Publicado: (2025)

Towards Provable Security in Industrial Control Systems Via Dynamic Protocol Attestation
por: Amorim, Arthur, et al.
Publicado: (2024)

Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers
por: Zhang, Linpeng, et al.
Publicado: (2024)

Mining Diamonds in labeled Transition Systems
por: van Spaendonck, P. H. M., et al.
Publicado: (2025)

Graded Symbolic Verification with a Fuzzy Dolev-Yao Attacker Model
por: Moran, Murat
Publicado: (2026)

Diagnosability of labeled $\mathfrak{D_p}$ automata
por: Zhang, Kuize, et al.
Publicado: (2021)

Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras
por: Fülöp, Zoltán, et al.
Publicado: (2025)

Non-interference analysis of bounded labeled Petri nets
por: Ran, Ning, et al.
Publicado: (2025)

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
por: Zhang, Kuize, et al.
Publicado: (2024)

Exact descriptional complexity of determinization of input-driven pushdown automata
por: Martynova, Olga
Publicado: (2024)

Inform: From Compartmental Models to Stochastic Bounded Counter Machines
por: Leys, Tim, et al.
Publicado: (2024)

Computing measures of weak-MSO definable sets of trees
por: Niwiński, Damian, et al.
Publicado: (2024)

Two or three things I know about tree transducers
por: Nguyên, Lê Thành Dũng
Publicado: (2024)

Random Testing of Model Checkers for Timed Automata with Automated Oracle Generation
por: Manini, Andrea, et al.
Publicado: (2025)

Automated Formal Verification of Area-Optimized Safety Registers in Automotive SoCs
por: Zhang, Shuhang, et al.
Publicado: (2025)

Automating the Analysis and Improvement of Dynamic Programming Algorithms with Applications to Natural Language Processing
por: Vieira, Tim
Publicado: (2026)

Nondeterministic tree-walking automata are not closed under complementation
por: Martynova, Olga, et al.
Publicado: (2024)

Beyond Correctness: Exposing LLM-generated Logical Flaws in Reasoning via Multi-step Automated Theorem Proving
por: Zheng, Xinyi, et al.
Publicado: (2025)

On the transversals of Latin squares generated by nonlinear bipermutive cellular automata
por: Dennunzio, Alberto, et al.
Publicado: (2026)

Benchmarking Testing in Automated Theorem Proving
por: Kim, Jongyoon, et al.
Publicado: (2026)

Bounded treewidth, multiple context-free grammars, and downward closures
por: Aiswarya, C., et al.
Publicado: (2025)