Skip to content

Formally Verifying the Absence of Overloading in Apache Storm

· 0 citations · 18 references

TL;DR

A novel finite-state modelling strategy is introduced that preserves essential Storm behaviour, including nondeterministic outputs and timed processing, while abstracting indistinguishable tuples and threads into counters and advancing time by sound leaps between relevant events.

View source

Similar papers

Preprint Sep 2026

Enforcement of In-Kernel Stateful Security Policies via eBPF

Many attacks against workloads running on multi-tenant systems are multi-step and history-dependent: sequences of innocuous operations whose malicious nature emerges only over an execution trace. Defending against them requires security policies that are stateful, are enforced within the kernel, and have a precise sema...

Letterio Galletta · 0 citations
Open access Sep 2026

Improving Security Policy Validation in Distributed Systems Using Attack Graph Simulations

Validation of security policies in distributed systems is difficult because rules are heterogeneous, interact in non-obvious ways, and static checks often overlook multi-stage attacker chains. We offer a unified framework to translate real policies, and in parallel give visibility into policy-aware attack graphs (PAAGs...

Z. Al-araji, B. Hasan, Fahad Ahmed Shaban et al. · 0 citations
Conference Open access Aug 2026

Generate-and-Verify AI Policy Design for Distributed Serverless Scheduling

Serverless computing platforms face complex scheduling challenges involving cold starts, queue delays, instance reuse, resource fragmentation, and multi-tenant fairness. In this paper, we propose GenVerify, a framework that leverages large language models (LLMs) to automatically generate candidate scheduling policies a...

Zhi-Wei Luo, Jing-Yi Chen, Guo-Ze Feng et al. · 0 citations

Formally-Verified, Tight Timing Constraints for Machine Code

Cloq is introduced, the first dependently typed, machine-checked framework for verifying timing properties of raw (stripped) machine code within the Rocq interactive theorem-proving environment, and provides high-assurance, high-precision timing guarantees that verify that real-time systems and cryptographic algorithms...

C. Averill · 0 citations
Preprint Oct 2026

Modular Responsiveness Verification of Rust Async Runtimes

This work presents a lightweight and modular proof technique for verifying eventual progression guarantees for Rust async runtimes and realizes this proof technique as a set of static analyses for Rust and uses these to verify eventual progression of several key components of multiple Rust async runtime implementations...

Yan-Ze Li, I. Beschastnikh, Alexander J. Summers · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.