Results 91 to 100 of about 1,172 (171)
The article describes an alteration of the traditional method of input‐output feedback linearization by applying a linear‐nonlinear decomposition of a system. The modified method makes it possible to obtain an equivalent linear model of the system in the presence of parametric uncertainties and disturbances.
G. I. Mihalev +7 more
wiley +1 more source
nekton: A Linearizability Proof Checker
Abstract is a new tool for checking linearizability proofs of highly complex concurrent search structures. The tool’s unique features are its parametric heap abstraction based on separation logic and the flow framework, and its support for hindsight arguments about future-dependent linearization points.
Roland Meyer 0001 +3 more
openaire +2 more sources
A ZK-based multi-blockchain transaction layer for minimal trust base
In the realm of blockchains, synchronization challenges are two-folded. First, smart contracts from different blockchains cannot communicate with each other, making it hard to establish a trustworthy communication channel to share and maintain a ...
Sinka Gao, Guoqiang Li
doaj +1 more source
Concurrent specifications beyond linearizability
International audienceWith the advent of parallel architectures, distributed programs are used intensively and the question of how to formally specify the behaviors expected from such programs becomes crucial.
Ledent, Jérémy +2 more
core +1 more source
A Machine-Verified Proof of Linearizability for a Queue Algorithm [PDF]
Proofs of linearizability are typically intricate and lengthy, and readers may find it difficult to verify their correctness. We present a unique technique for producing proofs of linearizability that are fully verifiable by a mechanical proof system ...
Yavuz, Ugur
core
Linearization of finite subgroups of Cremona groups over nonclosed fields
We study linearizability properties of finite subgroups of the Cremona group Crn(k) $\operatorname {{\mathrm {Cr}}}_n(k)$ upper C r Subscript n Baseline left parenthesis k right parenthesis in the case where k is a global field, with the focus on ...
Boris Kunyavskii
doaj +1 more source
A Complete Program Logic for Compositional Linearizability [PDF]
We present Linearizability Hoare Logic (LHL), the first mechanized, sound, and complete program logic for atomic, set, and interval linearizability. We achieve this by showing soundness and completeness of LHL w.r.t.
Feng, Yueyang +4 more
core +1 more source
Sequential Consistency versus Linearizability
The power of two well-known consistency conditions for shared memory multiprocessors, sequential consistency and linearizability, is compared. The cost measure studied is the worst-case response time in distributed implementations of virtual shared ...
Hagit Attiya, Jennifer L. Welch
core
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability
This paper studies the problem of verifying linearizability at runtime, where one seeks for a concurrent algorithm for verifying that the current execution of a given concurrent shared object implementation is linearizable. It shows that it is impossible
Castañeda, Armando +1 more
core
A Linearizability-based Hierarchy for Concurrent Specifications
Two linearizability-style correctness conditions that can be used to argue safety properties of progressively more concurrent behaviors of objects.
Armando Castañeda +5 more
core +1 more source

