implement ordering guarantees

Ensuring functional correctness and performance resilience of network protocols under component failures and adversarial attacks remains a significant challenge. Method: This paper proposes a synergistic analysis framework integrating formal verification with attack synthesis. It models protocol behavior using a formal specification language and employs logical predicates, trace analysis, and model checking to achieve closed-loop verification—simultaneously establishing correctness guarantees and automatically generating realistic attack scenarios. Contribution/Results: Diverging from conventional unidirectional verification, our approach innovatively embeds attack-path generation directly into the verification workflow, enabling reproducible and interpretable failure attribution. Experimental evaluation across multiple mainstream network protocols demonstrates substantial improvements in vulnerability detection rates and attack-surface characterization accuracy. The results validate the feasibility and practicality of formal methods for deep, security-critical analysis of complex network protocols.

This paper addresses the modeling and analysis of valid execution traces in process systems governed by precedence and response constraints. We formalize the constraint set as a partially ordered set (poset) and establish, for the first time, a bijective correspondence between precedence/response constraint systems and linear extensions of their associated posets—thereby enabling a complete combinatorial characterization of feasible traces. Building on this foundation, we develop an exact classification framework for trace sets, supporting quantitative evaluation of process utility. Our approach integrates order theory, constraint satisfaction modeling, and linear extension theory, substantially enhancing the computability and cross-system comparability of constraint-driven processes. The theoretical framework advances process mining and conformance checking by providing rigorous foundations for trace enumeration, constraint verification, and utility-aware process analysis.

This work addresses the limitations of existing Signal First-Order Logic (SFO), which lacks quantitative semantics and online monitoring capabilities, hindering the verification of complex real-time properties in hybrid systems. We introduce, for the first time, a robustness-based quantitative semantics for SFO and define its past-time fragment. To enable efficient online monitoring, we propose a “pastification” transformation that converts bounded-response formulas into equisatisfiable past-time formulas. Building on this foundation, we develop the first publicly available prototype system supporting full SFO, enabling quantitative runtime verification of properties beyond the expressiveness of Signal Temporal Logic. Experimental evaluation across multiple benchmarks demonstrates that our approach is both practical and efficient.

Message reordering in the Actor model leads to unpredictable concurrent behavior. This paper introduces a protocol-constrained actor capability mechanism that integrates static capability control into the Actor model: a flow-sensitive type system enforces ordering and payload-type constraints on actor references, enabling safe replication and delegation; an effect system is further employed to construct a behavioral predictability verification framework. The approach statically guarantees, at compile time, that messages arrive in protocol-specified order—ensuring actors correctly handle any arrival sequence and eliminating runtime nondeterminism arising from reordering. To our knowledge, this is the first work to deeply integrate static capabilities with protocol-aware references to achieve strong, formal guarantees on Actor message ordering. It establishes a concurrency model for distributed systems that simultaneously ensures safety and formal verifiability.

This work addresses the challenge of runtime verification in actor-based concurrent systems, where causal dependencies across actors and nondeterministic message interleavings obscure precise execution semantics—a problem exacerbated by the limited applicability of existing tools, which are largely confined to single-process settings. To overcome this, the authors propose ACTORCHESTRA, a framework that, for the first time, enables automatic instrumentation of Erlang systems compliant with the OTP standard without requiring source code modifications, thereby establishing a multi-actor causal tracing infrastructure. Complementing this, they introduce WALTZ, a declarative domain-specific language that allows specification of behavioral properties from which executable, integrated monitors are automatically generated. Empirical evaluation on three real-world systems demonstrates the approach’s effectiveness in detecting complex violations, while performance assessments confirm a practical trade-off between enhanced safety guarantees and runtime overhead.

This work addresses the inefficiencies and semantic inconsistencies arising from separately implementing driver and monitor programs in traditional hardware module testing. To overcome this, the authors propose a domain-specific language (DSL) tailored to hardware communication protocols, which enables the unified specification of both driver and monitor logic through an imperative syntax, thereby ensuring their semantic consistency for the first time. Building upon this DSL, they develop a prototype tool that leverages waveform parsing and transaction-level trace inference techniques to accurately reconstruct protocol-compliant transaction sequences from raw signal waveforms. Experimental results demonstrate that the approach significantly improves development efficiency, with further validation planned on real-world interconnect protocols such as Wishbone and AXI-Stream.

This work addresses the visibility of security-relevant facts in layered network security pipelines, where discrepancies in processing order—such as those exploited by order-sensitive attacks like HTTP request smuggling—can undermine correctness. For the first time, layer ordering is formally integrated into a semantic security framework through a composable automaton model. This model endows transformation sequences with finite-state semantics via layer-order automata, deterministic order-preserving transducers, evidence-tagging mechanisms, and decision automata, and precisely characterizes the regular prefix-closed conditions necessary for faithful online execution. The approach enables formal identification of boundary-inconsistency scenarios including CL.TE, TE.CL, TE.TE, and HTTP/2 downgrade attacks, establishes a component-permutation classification based on equivalent decision languages, and proves the equivalence of the proposed framework to finite-output deterministic edit transducers.

本文通过将Paxos协议的伪代码转化为可执行的DistAlgo语言，解决了分布式系统中复制与共识协议的理解和验证问题。

This study addresses the lack of deductive reasoning foundations in discrete-event simulation, which hinders formal verification of model correctness and performance guarantees. To overcome this, we propose a core imperative calculus and proof system that extends reasoning over discrete-time probabilistic programs to performance models involving continuous time and distributions, rigorously establishing the soundness and completeness of the associated proof rules. Leveraging measure theory and the Lean theorem prover, we implement reasoning for almost-sure reachability and expected hitting times in continuous-time probabilistic programs. We successfully complete formal proofs on client-server architectures and network routing protocol case studies, thereby transcending the limitations of analytical solutions in classical queueing theory.

本文介绍了一种名为Consort的框架，通过在实时数据库分支上实施不可绕过的控制来强制执行规范优先、测试驱动的开发方法，以确保由代理编写的代码的质量和可维护性。