Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,495,980 papers from all fields of science
Search
Sign In
Create Free Account
Sequential consistency
Sequential consistency is one of the consistency models used in the domain of concurrent computing (e.g. in distributed shared memory, distributed…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Cache coherence
Causal consistency
Concurrent computing
Concurrent data structure
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Effective abstractions for verification under relaxed memory models
A. Dan
,
Yuri Meshman
,
Martin T. Vechev
,
Eran Yahav
Computer languages, systems & structures
2015
Corpus ID: 2242018
2013
2013
Lasso screening with a small regularization parameter
Yun Wang
,
Z. Xiang
,
P. Ramadge
IEEE International Conference on Acoustics…
2013
Corpus ID: 17743425
Screening for lasso problems is a means of quickly reducing the size of the dictionary needed to solve a given instance without…
Expand
2010
2010
An Intuitionistic Epistemic Logic for Sequential Consistency on Shared Memory
Yoichi Hirai
Logic Programming and Automated Reasoning
2010
Corpus ID: 15206838
In the celebrated Godel Prize winning papers, Herlihy, Shavit, Saks and Zaharoglou gave topological characterization of waitfree…
Expand
2004
2004
Safety property verification using sequential SAT and bounded model checking
G. Parthasarathy
,
Madhu K. Iyer
,
K. Cheng
,
Li-C. Wang
IEEE Design & Test of Computers
2004
Corpus ID: 16028472
Model checkers verify properties of safety- or business-critical systems. The main idea behind model checking is to convert a…
Expand
2002
2002
On Abstractions and Simplifications in the Design of Human-Automation Interfaces
M. Heymann
,
A. Degani
2002
Corpus ID: 2146772
Summary This report addresses the design of human-automation interaction from a formal perspectivethat focuses on the information…
Expand
Highly Cited
1991
Highly Cited
1991
A parallel shortest augmenting path algorithm for the assignment problem
E. Balas
,
Donald L. Miller
,
J. Pekny
,
P. Toth
JACM
1991
Corpus ID: 649890
Abstract : We describe a parallel version of the shortest augmenting path algorithm for the assignment problem. While generating…
Expand
Highly Cited
1991
Highly Cited
1991
Proving sequential consistency of high-performance shared memories (extended abstract)
Phillip B. Gibbons
,
Michael Merritt
,
K. Gharachorloo
ACM Symposium on Parallelism in Algorithms and…
1991
Corpus ID: 14422222
Relaxed consistency models such as weak consistency or release consistency may be understood as a contract between programmer and…
Expand
Highly Cited
1990
Highly Cited
1990
Implementing Sequential Consistency in Cache-Based Systems
S. Adve
,
M. Hill
International Conference on Parallel Processing
1990
Corpus ID: 2077505
A model for shared-memory systems commonly (and often implicitly) assumed by programmers is that of sequential consistency. For…
Expand
1967
1967
Truncated sequential hypothesis tests
J. Bussgang
,
M. Marcus
IEEE Transactions on Information Theory
1967
Corpus ID: 18903364
Through a careful examination of the equations by which Wald determines the values of the boundaries for tests of sequential…
Expand
1952
1952
Tables to Facilitate Sequential t-Tests.
P. Armitage
1952
Corpus ID: 126375645
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE