Results 31 to 40 of about 1,172 (171)
Strict Linearizability and Abstract Atomicity [PDF]
International Journal of Foundations of Computer Science, 2021 Linearizability is a commonly accepted consistency condition for concurrent objects. Filipović et al. show that linearizability is equivalent to observational refinement. However, linearizability does not permit concurrent objects to share memory spaces with their client programs.
Tangliu Wen +4 more
openaire +2 more sources
CoRR, 2015 The semantics of concurrent data structures is usually given by a sequential specification and a consistency condition. Linearizability is the most popular consistency condition due to its simplicity and general applicability. Nevertheless, for applications that do not require all guarantees offered by linearizability, recent research has focused on ...
Andreas Haas +8 more
openaire +2 more sources
Linearizability of eigenvector nonlinearities
CoRR, 2021 We present a method to linearize, without approximation, a specific class of eigenvalue problems with eigenvector nonlinearities (NEPv), where the nonlinearities are expressed by scalar functions that are defined by a quotient of linear functions of the eigenvector.
Claes, Rob +3 more
openaire +2 more sources
Systems, 2023 In this article, we explore some theoretical issues related to reductionism and systems. Fundamentally, reductionism neglects that a system can acquire properties.
Gianfranco Minati
doaj +1 more source
R-linearizability: an extension of linearizability to replicated objects
1993 4th Workshop on Future Trends of Distributed Computing Systems, 2002 The authors extend linearizability, a consistency criterion for concurrent systems, to the replicated context, where availability and performance are enhanced by using redundant objects. The mode of operation on sets of replicas and the consistency criterion of R-linearizability are defined.
Pacull, F., Sandoz, A.
openaire +2 more sources
Using coarse-grained abstractions to verify linearizability on TSO architectures [PDF]
, 2014 Most approaches to verifying linearizability assume a sequentially consistent memory model, which is not always realised in practice. In this paper we study correctness on a weak memory model: the TSO (Total Store Order) memory model, which is ...
Dongol, B +3 more
core +6 more sources
Relating trace refinement and linearizability
, 2017 In the late 1980's, Back extended the notion of stepwise refinement of sequential systems to concurrent systems. By doing so he provided a definition of what it means for a concurrent system to be correct with respect to an abstract (potentially ...
Smith, Graeme, Winter, Kirsten
core +2 more sources
Infrared Small Object Tracking Based on Att-Siam Network
IEEE Access, 2022 Aiming at the practical problems such as background clutter interference and occlusion during the tracking of small air targets by infrared imaging guided missiles, we propose an improved SiamFC infrared small target tracking algorithm.
Ying Chao Li, Shuai Yang
doaj +1 more source
Linearizability problem of persistent centers
Electronic Journal of Qualitative Theory of Differential Equations, 2018 The concepts of persistent and weakly persistent centers were introduced in 2009 and the same concept was applied in the study of some families of differential equations in 2013.
Matej Mencinger +3 more
doaj +1 more source
Linearizability conditions for 1:-5 Lotka-Volterra two-dimensional complex quartic systems
上海师范大学学报. 自然科学版, 2017 In this paper we investigate the linearizability problem for the planar Lotka-Volterra complex quartic systems which are 1:-5 linear systems perturbed by homogeneous polynomials of degree 4, that is to say, we consider systems of the form ẋ = x(1 ...
Hu Zhaoping, Zhang Chao
doaj +1 more source