A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="http://plv.mpi-sws.org/sra/paper.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Filters
Taming release-acquire consistency
<span title="">2016</span>
<i title="ACM Press">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2qaxtqe2rfgjnfefqcokcnzelq" style="color: black;">Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL 2016</a>
</i>
Preserved Fulltext
Acknowledgments We would like to thank Marko Doko, Jeehoon Kang, Peter Sewell, Francesco Zappa Nardelli, and the POPL'16 reviewers for their helpful feedback. ...
Moreover, we provided a simple notion of a strong memory fence that suffices for restoring sequential consistency assuming all (racy) accesses are RA, and presented reduction theorems to SC and TSO for ...
G is called TSO-coherent if there exists a total store order for it. Note that unlike modification orders, the total store order relates also read events. ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2837614.2837643">doi:10.1145/2837614.2837643</a>
<a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/popl/LahavGV16.html">dblp:conf/popl/LahavGV16</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lp4lgfkxzvbhtn4vdeaevjj6ei">fatcat:lp4lgfkxzvbhtn4vdeaevjj6ei</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200710003303/http://plv.mpi-sws.org/sra/paper.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/4b/ef/4befc560bb1c8fb43756feb40d8873ae21b28b9c.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2837614.2837643">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
acm.org
</button>
</a>
Fast complete memory consistency verification
<span title="">2009</span>
<i title="IEEE">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/n7ljjecrpje5pj66pk4pvx65qu" style="color: black;">2009 IEEE 15th International Symposium on High Performance Computer Architecture</a>
</i>
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="http://lcs.ios.ac.cn/~lvyi/files/HPCA2009.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
This paper proposes a novel fast memory consistency verification method by identifying a new natural partial order: time order. ...
Based on the time order restriction, memory consistency verification is localized: for any operation, both inferring related orders and checking related cycles need to take into account only a bounded ...
Acknowledgment We are grateful to Michel Dubois and to the anonymous reviewers for their helpful comments and insightful suggestions. ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/hpca.2009.4798276">doi:10.1109/hpca.2009.4798276</a>
<a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/hpca/ChenLHCSWP09.html">dblp:conf/hpca/ChenLHCSWP09</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uqt534rbajh6rmnkvpqvj5rf7e">fatcat:uqt534rbajh6rmnkvpqvj5rf7e</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809135344/http://lcs.ios.ac.cn/~lvyi/files/HPCA2009.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/dc/de/dcde8a5882295accdfc11ed20d842d224e7e4ec1.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/hpca.2009.4798276">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
ieee.com
</button>
</a>
Verifying Visibility-Based Weak Consistency
[chapter]
<span title="">2020</span>
<i title="Springer International Publishing">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a>
</i>
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://link.springer.com/content/pdf/10.1007%2F978-3-030-44914-8_11.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
While some concurrentobject operations are designed to behave atomically, each witnessing the atomic effects of predecessors in a linearization order, others forego such strong consistency to avoid complex ...
In this work we develop a methodology for proving that concurrent object implementations adhere to weak-consistency specifications. ...
In practice, the happens-before order among invocations is determined by a program order, i.e., among invocations of the same thread, and a synchronization order, i.e., among invocations of distinct threads ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-44914-8_11">doi:10.1007/978-3-030-44914-8_11</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/np7yq4pkcfgirj3e75c3za224e">fatcat:np7yq4pkcfgirj3e75c3za224e</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200509232359/https://link.springer.com/content/pdf/10.1007%2F978-3-030-44914-8_11.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/dc/34/dc34c2b7087611fc65073a1feb6decfa1bc68259.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-44914-8_11">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>
On verifying causal consistency
<span title="2017-01-01">2017</span>
<i title="Association for Computing Machinery (ACM)">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xu5bk2lj5rbdxlx6222nw7tsxi" style="color: black;">SIGPLAN notices</a>
</i>
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="https://infoscience.epfl.ch/record/223699/files/draft.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Moreover, for a significant class of implementations, we derive from this reduction the decidability of verifying causal consistency w.r.t. the read-write memory abstraction. 1 Throughout the paper, unbounded ...
Using these machines as observers (in parallel with the implementation) allows to reduce polynomially the problem of checking causal consistency to a state reachability problem. ...
Sequential consistency [30] imposes a total order on all (read and write) operations. In particular, no such total order can exist for History (2d). ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3093333.3009888">doi:10.1145/3093333.3009888</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iwulsdvmnvh5lewrezz2qzswci">fatcat:iwulsdvmnvh5lewrezz2qzswci</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922011142/https://infoscience.epfl.ch/record/223699/files/draft.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/a7/d1/a7d1cf4fe90ec1e4340b36eda5afb632f35c421d.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3093333.3009888">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
acm.org
</button>
</a>
On verifying causal consistency
<span title="">2017</span>
<i title="ACM Press">
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017
</i>
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="https://infoscience.epfl.ch/record/223699/files/draft.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Moreover, for a significant class of implementations, we derive from this reduction the decidability of verifying causal consistency w.r.t. the read-write memory abstraction. 1 Throughout the paper, unbounded ...
Using these machines as observers (in parallel with the implementation) allows to reduce polynomially the problem of checking causal consistency to a state reachability problem. ...
Sequential consistency [30] imposes a total order on all (read and write) operations. In particular, no such total order can exist for History (2d). ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3009837.3009888">doi:10.1145/3009837.3009888</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bweu3s4ctvb2hn56tlbaeknmf4">fatcat:bweu3s4ctvb2hn56tlbaeknmf4</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922011142/https://infoscience.epfl.ch/record/223699/files/draft.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/a7/d1/a7d1cf4fe90ec1e4340b36eda5afb632f35c421d.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3009837.3009888">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
acm.org
</button>
</a>
Verifying Visibility-Based Weak Consistency
[article]
<span title="2019-11-04">2019</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1911.01508v1.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
While some concurrent-object operations are designed to behave atomically, each witnessing the atomic effects of predecessors in a linearization order, others forego such strong consistency to avoid complex ...
In this work we develop a methodology for proving that concurrent object implementations adhere to weak-consistency specifications. ...
In practice, the happens-before order among invocations is determined by a program order, i.e., among invocations of the same thread, and a synchronization order, i.e., among invocations of distinct threads ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1911.01508v1">arXiv:1911.01508v1</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xeu4aoa4szbupchvodlzcaoyay">fatcat:xeu4aoa4szbupchvodlzcaoyay</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200823005451/https://arxiv.org/pdf/1911.01508v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/66/f8/66f8168db46b938b5c59e6045b7efb19580f7987.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1911.01508v1" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>
Automatable Verification of Sequential Consistency
<span title="2003-07-25">2003</span>
<i title="Springer Nature">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qj6jzeossfhihfshwf7nb7lbcq" style="color: black;">Theory of Computing Systems</a>
</i>
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit <a rel="external noopener" href="http://www.cs.ubc.ca:80/~condon/papers/ajh02.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Sequential consistency is a multiprocessor memory model of both practical and theoretical importance. ...
The class includes all published sequentially consistent protocols that are known to us, and we argue why the class is likely to include all real sequentially consistent protocols. ...
Acknowledgments We thank Mark Hill, Dan Sorin, Manoj Plakal and the other members of the Wisconsin Multifacet group for sharing their insights and intuition about proving sequential consistency. ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00224-003-1082-x">doi:10.1007/s00224-003-1082-x</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uy4ktdnedfbrxn4nwpufn6rava">fatcat:uy4ktdnedfbrxn4nwpufn6rava</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060117120918/http://www.cs.ubc.ca:80/~condon/papers/ajh02.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/67/5e/675e0745bcb18e31a6a4f4d0c49098b8741c5358.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00224-003-1082-x">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>
On Verifying Causal Consistency
[article]
<span title="2016-11-15">2016</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1611.00580v2.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Other Versions
<span title="2016-11-02">2016</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1611.00580v1">arXiv:1611.00580v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sf2nvpazhjfe7brmayt6zsyqsu">fatcat:sf2nvpazhjfe7brmayt6zsyqsu</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1611.00580v1">arXiv:1611.00580v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sf2nvpazhjfe7brmayt6zsyqsu">fatcat:sf2nvpazhjfe7brmayt6zsyqsu</a> </span>
We address the issue of verifying automatically whether the executions of an implementation of a data structure are causally consistent. ...
Indeed, such systems often store data in key-value stores, which are instances of the read-write memory abstraction. ...
Sequential consistency [30] imposes a total order on all (read and write) operations. In particular, no such total order can exist for History (2d). ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1611.00580v2">arXiv:1611.00580v2</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/d3tdcxs6bbg23pykouwjqkcsu4">fatcat:d3tdcxs6bbg23pykouwjqkcsu4</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191016133429/https://arxiv.org/pdf/1611.00580v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/c7/a2/c7a2c19d367b8b71b4c235b885653d5e4d49e4ef.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1611.00580v2" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>
The Consistency of Web Conversations
<span title="">2008</span>
<i title="IEEE">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hj24pr6lvba3dfi5muhp4mz5tm" style="color: black;">2008 23rd IEEE/ACM International Conference on Automated Software Engineering</a>
</i>
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit <a rel="external noopener" href="http://www.jmfischer.org:80/papers/ase08_conversations.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
We have used BPELCheck to check conversational consistency for a set of BPEL processes, including an industrial example. ...
A process is consistent if each possible conversation leaves its peer automata in a state labeled as consistent and the overall execution satisfies a user-specified predicate on the automata states. ...
To process an order, the store first authorizes with the bank the total value of the order. If this fails, the processing of the order stops. ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ase.2008.62">doi:10.1109/ase.2008.62</a>
<a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/kbse/FischerMS08.html">dblp:conf/kbse/FischerMS08</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m6ppcwozkffqdhlkitpa532rgq">fatcat:m6ppcwozkffqdhlkitpa532rgq</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20091221231246/http://www.jmfischer.org:80/papers/ase08_conversations.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/db/48/db4846f79d627175e65b9594edf256a9260b82f4.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ase.2008.62">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
ieee.com
</button>
</a>
A Framework for Consistency Algorithms
[article]
<span title="2020-07-21">2020</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/2007.11398v1.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Such an algorithm checks whether the executions of a shared-memory concurrent program are consistent under the axioms defined by a model. ...
Our framework shows, that despite the hardness, fast deterministic consistency algorithms can be obtained by employing tools from fine-grained complexity. ...
First, we demand a total order tw instead of a store order, a partial order that is total on writes to the same location [6, 7, 50] . ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.11398v1">arXiv:2007.11398v1</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ukqpqmos4ngvfghpwyux4ccr2u">fatcat:ukqpqmos4ngvfghpwyux4ccr2u</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200725020211/https://arxiv.org/pdf/2007.11398v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.11398v1" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>
Verifying Sequential Consistency on Shared-Memory Multiprocessors by Model Checking
[article]
<span title="2001-08-25">2001</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections. The file type is <code>application/pdf</code>.
A trace of a memory system satisfies sequential consistency if there exists a total order of all memory events in the trace that is both consistent with the total order at each processor and has the property ...
The sequential consistency memory model specifies a total order among the memory (read and write) events performed at each processor. ...
. , u k , v k is a canonical k-nice cycle in G(Ω)(τ ). Example. We now give an example to illustrate the method described in this section. ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0108016v1">arXiv:cs/0108016v1</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yeq3uimw2bbijouanmoq32lt6m">fatcat:yeq3uimw2bbijouanmoq32lt6m</a>
</span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-cs0108016/cs0108016.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
File Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/a7/9e/a79edc8e0cd24887c98b151e8b09fd2e89cce04a.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0108016v1" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>
On consistency types for lattice-based distributed programming languages
[article]
<span title="2020-09-14">2020</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1907.00822v3.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Other Versions
<span title="2019-11-01">2019</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1907.00822v2">arXiv:1907.00822v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kl4egzvgfjevrcsjpyy5eudufi">fatcat:kl4egzvgfjevrcsjpyy5eudufi</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1907.00822v2">arXiv:1907.00822v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kl4egzvgfjevrcsjpyy5eudufi">fatcat:kl4egzvgfjevrcsjpyy5eudufi</a> </span>
<span title="2020-10-30">2020</span>
<span class="release-stage">accepted</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1907.00822v4">arXiv:1907.00822v4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bokgdhfwi5epxmrbph2ewyoobu">fatcat:bokgdhfwi5epxmrbph2ewyoobu</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1907.00822v4">arXiv:1907.00822v4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bokgdhfwi5epxmrbph2ewyoobu">fatcat:bokgdhfwi5epxmrbph2ewyoobu</a> </span>
<span title="2019-07-01">2019</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1907.00822v1">arXiv:1907.00822v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7le2y5ui3ng5jltc5m4pjv4rge">fatcat:7le2y5ui3ng5jltc5m4pjv4rge</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1907.00822v1">arXiv:1907.00822v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7le2y5ui3ng5jltc5m4pjv4rge">fatcat:7le2y5ui3ng5jltc5m4pjv4rge</a> </span>
In this paper, we propose lattice-based consistency types for replicated data (CTRD), a higher-order static consistency-typed language with replicated data types. ...
In contrast, data flow from data with weak consistency to data with strong consistency requirements is problematic, since application correctness may be broken. ...
order number from a customer, and processes the order according to the availability. ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1907.00822v3">arXiv:1907.00822v3</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gc6657mbkbhdvhytkmizhhcz4u">fatcat:gc6657mbkbhdvhytkmizhhcz4u</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200920015212/https://arxiv.org/pdf/1907.00822v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1907.00822v3" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>
Regular Sequential Serializability and Regular Sequential Consistency
[article]
<span title="2021-10-18">2021</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/2109.08930v2.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Other Versions
<span title="2021-09-18">2021</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2109.08930v1">arXiv:2109.08930v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4z3hwfiwvfefhbbgcgkln7wkla">fatcat:4z3hwfiwvfefhbbgcgkln7wkla</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2109.08930v1">arXiv:2109.08930v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4z3hwfiwvfefhbbgcgkln7wkla">fatcat:4z3hwfiwvfefhbbgcgkln7wkla</a> </span>
Strictly serializable (linearizable) services appear to execute transactions (operations) sequentially, in an order consistent with real time. ...
This work introduces two new consistency models to ease this trade-off: regular sequential serializability (RSS) and regular sequential consistency (RSC). ...
. < is a strict total order. Proof. We must show < is irreflexive, total, and transitive. Irreflexivity follows from the fact that each operation has one carstamp and the irreflexivity of <. ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2109.08930v2">arXiv:2109.08930v2</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/s7kgrqqrn5h2jpopmebcnujjfu">fatcat:s7kgrqqrn5h2jpopmebcnujjfu</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20211022050120/https://arxiv.org/pdf/2109.08930v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/eb/c0/ebc09aca5b1a6906a659e7dea7fbc46117a3ae6b.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2109.08930v2" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>
Robustness Against Transactional Causal Consistency
[article]
<span title="2021-02-02">2021</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1906.12095v4.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
<span title="2021-01-13">2021</span> <span class="release-stage" >pre-print</span> <span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.12095v4">arXiv:1906.12095v4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/idcnbrvda5gdjdrj4adswu2ojy">fatcat:idcnbrvda5gdjdrj4adswu2ojy</a> </span>Other Versions
<span title="2020-11-16">2020</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.12095v3">arXiv:1906.12095v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/isfmmypycrb6bpdi6mo2dldmda">fatcat:isfmmypycrb6bpdi6mo2dldmda</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.12095v3">arXiv:1906.12095v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/isfmmypycrb6bpdi6mo2dldmda">fatcat:isfmmypycrb6bpdi6mo2dldmda</a> </span>
<span title="2019-06-28">2019</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.12095v1">arXiv:1906.12095v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5u4tymap6zhevb2iotjouh67he">fatcat:5u4tymap6zhevb2iotjouh67he</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.12095v1">arXiv:1906.12095v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5u4tymap6zhevb2iotjouh67he">fatcat:5u4tymap6zhevb2iotjouh67he</a> </span>
<span title="2019-12-19">2019</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.12095v2">arXiv:1906.12095v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/o5ilju5quvawjkpkl574rusxfm">fatcat:o5ilju5quvawjkpkl574rusxfm</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.12095v2">arXiv:1906.12095v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/o5ilju5quvawjkpkl574rusxfm">fatcat:o5ilju5quvawjkpkl574rusxfm</a> </span>
over a sequentially consistent memory. ...
in transactional programs over a sequentially consistent shared memory. ...
over a sequentially consistent memory. ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.12095v5">arXiv:1906.12095v5</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4y5o72jpzjfjbfl6ikq5n2zijm">fatcat:4y5o72jpzjfjbfl6ikq5n2zijm</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210118033226/https://arxiv.org/pdf/1906.12095v4.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<span style="color: #f43e3e;">✱</span>
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/eb/a3/eba31de88684ec7f21358c09bb67aba30e32d8b9.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.12095v5" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>
Robustness Against Transactional Causal Consistency
<span title="2019-08-26">2019</span>
<i >
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/iv4yo5vao5ctfjfushi4akt5xi" style="color: black;">International Conference on Concurrency Theory</a>
</i>
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit <a rel="external noopener" href="https://drops.dagstuhl.de/opus/volltexte/2019/10932/pdf/LIPIcs-CONCUR-2019-30.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
over a sequentially consistent memory. ...
in transactional programs over a sequentially consistent shared memory. ...
In the non-transactional case this model corresponds to sequential consistency (SC) [31] . ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.concur.2019.30">doi:10.4230/lipics.concur.2019.30</a>
<a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/concur/BeillahiBE19.html">dblp:conf/concur/BeillahiBE19</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qec6givr4rb25jyoqxnqlm7mta">fatcat:qec6givr4rb25jyoqxnqlm7mta</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220120051335/https://drops.dagstuhl.de/opus/volltexte/2019/10932/pdf/LIPIcs-CONCUR-2019-30.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/57/45/5745a5a0c83af4733ff0a15d65dc68d937c4c968.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.concur.2019.30">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
Publisher / doi.org
</button>
</a>
« Previous
Showing results 1 — 15 out of 20,304 results