On the complexity of linearizability-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On the complexity of linearizability

Published:2018-03-01 Issue:9 Volume:101 Page:1227-1240
ISSN:0010-485X
Container-title:Computing
language:en
Short-container-title:Computing

Author:

Hamza Jad^ORCID

Funder

Université Paris Diderot

INRIA-EPFL

École Polytechnique Fédérale de Lausanne

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00607-018-0596-7.pdf

Reference13 articles.

1. Alur R, McMillan KL, Peled D (2000) Model-checking of correctness conditions for concurrent objects. Inf Comput 160(1–2):167–188

2. Bouajjani A, Emmi M, Enea C, Hamza J (2013) Verifying concurrent programs against sequential specifications. In: ESOP’13. LNCS, vol 7792. Springer, pp 290–309

3. Burckhardt S, Dern C, Musuvathi M, Tan R (2010) Line-up: a complete and automatic linearizability checker. In: Proceedings of the 2010 ACM SIGPLAN conference on programming language design and implementation, PLDI’10. ACM, New York, pp 330–340. https://doi.org/10.1145/1806596.1806634

4. Elmas T, Qadeer S, Sezgin A, Subasi O, Taşıran S (2010) Simplifying linearizability proofs with reduction and abstraction. In: TACAS’10: Proceedings of the 16th international conference on tools and algorithms for the construction and analysis of systems. LNCS, vol 6015. Springer, pp 296–311

5. Filipovic I, O’Hearn PW, Rinetzky N, Yang H (2010) Abstraction for concurrent objects. Theor Comput Sci 411(51–52):4379–4398

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP