相关论文: Formal Verification of Flow Equivalence in Desynch…

Nondeterminism in scheduling is the cardinal reason for difficulty in proving correctness of concurrent programs. A powerful proof strategy was recently proposed [6] to show the correctness of such programs. The approach captured data-flow…

We present the numerical equivalence between the Wilson flow and stout-link smearing, both of which are known to be a relatively new technique for smoothing the gauge fields on the lattice. Although the conceptional correspondence between…

Previous results on proving confluence for Constraint Handling Rules are extended in two ways in order to allow a larger and more realistic class of CHR programs to be considered confluent. Firstly, we introduce the relaxed notion of…

We introduce notions of suspension and flow equivalence on one-sided topological Markov shifts, which we call one-sided suspension and one-sided flow equivalence, respectively. We prove that one-sided flow equivalence is equivalent to…

This paper continues the study of equilibria for flows over time in the fluid queueing model recently considered by Koch and Skutella [10]. We provide a constructive proof for the existence and uniqueness of equilibria in the case of a…

Chain-of-Thought (CoT) and Looped Transformers have been shown to empirically improve performance on reasoning tasks and to theoretically enhance expressivity by recursively increasing the number of computational steps. However, their…

We present Leapfrog, a Coq-based framework for verifying equivalence of network protocol parsers. Our approach is based on an automata model of P4 parsers, and an algorithm for symbolically computing a compact representation of a…

In this paper we introduce a flow to study the Toda system, which we call {\it Toda flow.} More generally, we introduce a flow of the Liouville systems, formulated as a coupled parabolic system with nonlocal interactions. Finite-time…

We will study a certain synchronizing property of subshifts called $\lambda$-synchronization. The $\lambda$-synchronizing subshifts form a large class of irreducible subshifts containing irreducible sofic shifts. We prove that the…

Chase-Lev deque is a concurrent data structure designed for efficient load balancing in multiprocessor scheduling. It employs a work-stealing strategy, where each thread possesses its own work-stealing deque to store tasks, and idle threads…

This paper provides a systematic exploration of Control Flow Integrity (CFI) and Control Flow Attestation (CFA) mechanisms, examining their differences and relationships. It addresses crucial questions about the goals, assumptions,…

This article presents numerical investigations on accuracy and convergence properties of several numerical approaches for simulating steady state flows in heterogeneous aquifers. Finite difference, finite element, discontinuous Galerkin,…

This paper proves that labelled flows are expressive enough to contain all process algebras which are a standard model for concurrency. More precisely, we construct the space of execution paths and of higher dimensional homotopies between…

The study of hypersonic flows and their underlying aerothermochemical reactions is particularly important in the design and analysis of vehicles exiting and reentering Earth's atmosphere. Computational physics codes can be employed to…

Flow matching (FM) has shown promising results in data-driven planning. However, it inherently lacks formal guarantees for ensuring state and action constraints, whose satisfaction is a fundamental and crucial requirement for the safety and…

A principled approach to the design of program verification and con- struction tools is applied to separation logic. The control flow is modelled by power series with convolution as separating conjunction. A generic construction lifts…

For a class of coalescing stochastic flows on the real line the existence of dual flows is proved. A stochastic flow and its dual are constructed as a forward and backward perfect cocycles over the same metric dynamical system. The metric…

We study discrete flow equivalence of two-sided topological Markov shifts by using extended Ruelle algebras. We characterize flow equivalence of two-sided topological Markov shifts in terms of conjugacy of certain actions weighted by…

In this article we present a method for formally proving the correctness of the lazy algorithms for computing homographic and quadratic transformations -- of which field operations are special cases-- on a representation of real numbers by…

Distributed system theory literature often argues for correctness using an informal, Hoare-like style of reasoning. While these arguments are intuitive, they have not all been foolproof, and whether they directly correspond to formal proofs…