Results 11 to 20 of about 1,172 (171)
Speculative Linearizability [PDF]
ACM SIGPLAN Notices, 2011 Linearizability is a key design methodology for reasoning about implementations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusion that operations execute sequentially and fault-free, despite the
Guerraoui, Rachid +5 more
core +9 more sources
On the complexity of linearizability [PDF]
Computing, 2015 It was previously shown that the problem of verifying whether a finite concurrent system is linearizable can be done with an EXPSPACE complexity. However, the best known lower bound is PSPACE-hardness, and can be obtained using a reduction from control ...
Hamza, Jad
core +7 more sources
Replication-aware linearizability [PDF]
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019 International audienceDistributed systems often replicate data at multiple locations to achieve availability despite network partitions. These systems accept updates at any replica and propagate them asynchronously to every other replica.
Constantin Enea +7 more
core +4 more sources
Linearizability and Causality [PDF]
, 2016 Most work on the verification of concurrent objects for shared memory assumes sequential consistency, but most multicore processors support only weak memory models that do not provide sequential consistency.
Derrick, J. +3 more
core +4 more sources
Verifying linearizability on TSO architectures [PDF]
, 2014 Linearizability is the standard correctness criterion for fine-grained, non-atomic concurrent algorithms, and a variety of methods for verifying linearizability have been developed.
Smith, G. +8 more
core +10 more sources
Linearizability conditions of quasi-cubic systems [PDF]
Electronic Journal of Qualitative Theory of Differential Equations, 2012 In this paper we study the linearizability problem of the two-dimensional complex quasi-cubic system $\dot{z}=z+(zw)^{d}(a_{30}z^{3}+a_{21}z^{2}w+a_{12}zw^2+a_{03}w^{3}),~\dot{w}=-w-(zw)^{d}(b_{30}w^{3}+b_{21}w^{2}z+b_{12}wz^2+b_{03}z^{3})$, where $z, w,
Wentao Huang, Xingyu Fan, Xingwu Chen
doaj +3 more sources
Aspect-Oriented Linearizability Proofs [PDF]
, 2013 Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on identifying the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to
Sezgin, Ali +10 more
core +5 more sources
Linearizability and schedulability [PDF]
, 2007 Consider the problem of scheduling a set of tasks on a single processor such that deadlines are met. Assume that tasks may share data and that linearizability, the most common correctness condition for data sharing, must be satisfied.
Andersson, Björn
core +3 more sources
Concurrent Specifications Beyond Linearizability [PDF]
, 2019 With 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. A very general way to specify concurrent objects is to simply give
Ledent, Jérémy +2 more
core +5 more sources
Linearizability of flows by embeddings [PDF]
Selecta MathematicaWe consider the problem of determining the class of continuous-time dynamical systems that can be globally linearized in the sense of admitting an embedding into a linear system on a finite-dimensional Euclidean space. We solve this problem for dynamical
Arathoon, Philip, Kvalheim, Matthew D.
core +4 more sources