{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:21Z","timestamp":1740108261032,"version":"3.37.3"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T00:00:00Z","timestamp":1654560000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T00:00:00Z","timestamp":1654560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1717515"],"award-info":[{"award-number":["1717515"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s00607-022-01092-3","type":"journal-article","created":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T08:06:15Z","timestamp":1654589175000},"page":"955-978","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantifiability: a concurrent correctness condition modeled in vector space"],"prefix":"10.1007","volume":"105","author":[{"given":"Victor","family":"Cook","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8070-7633","authenticated-orcid":false,"given":"Christina","family":"Peterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zachary","family":"Painter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damian","family":"Dechev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,7]]},"reference":[{"issue":"1","key":"1092_CR1","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1145\/2578855.2535845","volume":"49","author":"P Abdulla","year":"2014","unstructured":"Abdulla P, Aronis S, Jonsson B, Sagonas K (2014) Optimal dynamic partial order reduction. SIGPLAN Not 49(1):373\u2013384","journal-title":"SIGPLAN Not"},{"issue":"OOPSLA","key":"1092_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3360576","volume":"3","author":"PA Abdulla","year":"2019","unstructured":"Abdulla PA, Atig MF, Jonsson B, L\u00e5ng M, Ngo TP, Sagonas K (2019) Optimal stateless model checking for reads-from equivalence under sequential consistency. Proc ACM Program Lang 3(OOPSLA):1\u201329","journal-title":"Proc ACM Program Lang"},{"doi-asserted-by":"crossref","unstructured":"Afek Y, Korland G, Yanovsky E (2010) Quasi-linearizability: relaxed consistency for improved concurrency. In: Principles of distributed systems. Springer, Berlin, pp 395\u2013410","key":"1092_CR3","DOI":"10.1007\/978-3-642-17653-1_29"},{"doi-asserted-by":"crossref","unstructured":"Alistarh D, Brown T, Kopinsky J, Nadiradze G (2018) Relaxed schedulers can efficiently parallelize iterative algorithms. In: Proceedings of the 2018 ACM symposium on principles of distributed computing, pp 377\u2013386","key":"1092_CR4","DOI":"10.1145\/3212734.3212756"},{"issue":"8","key":"1092_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/2858788.2688523","volume":"50","author":"D Alistarh","year":"2015","unstructured":"Alistarh D, Kopinsky J, Li J, Shavit N (2015) The SprayList: a scalable relaxed priority queue. SIGPLAN Not 50(8):11\u201320","journal-title":"SIGPLAN Not"},{"issue":"4","key":"1092_CR6","first-page":"77","volume":"9","author":"I Arora","year":"2012","unstructured":"Arora I, Gupta A (2012) Cloud databases: a paradigm shift in databases. Int J Comput Sci Issues (IJCSI) 9(4):77","journal-title":"Int J Comput Sci Issues (IJCSI)"},{"issue":"5","key":"1092_CR7","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1145\/185675.185815","volume":"41","author":"J Aspnes","year":"1994","unstructured":"Aspnes J, Herlihy M, Shavit N (1994) Counting networks. J ACM (JACM) 41(5):1020\u20131048","journal-title":"J ACM (JACM)"},{"doi-asserted-by":"crossref","unstructured":"Bhiri S, Perrin O, Godart C (2005) Ensuring required failure atomicity of composite web services. In: Proceedings of the 14th international conference on World Wide Web, pp 138\u2013147","key":"1092_CR8","DOI":"10.1145\/1060745.1060769"},{"doi-asserted-by":"crossref","unstructured":"Boehm HJ, Demsky B (2014) Outlawing ghosts: avoiding out-of-thin-air results. In: Proceedings of the workshop on memory systems performance and correctness, pp\u00a01\u20136","key":"1092_CR9","DOI":"10.1145\/2618128.2618134"},{"doi-asserted-by":"crossref","unstructured":"Bouajjani A, Emmi M, Enea C, Hamza J (2015) Tractable refinement checking for concurrent objects. In: Proceedings of the 42nd annual ACM SIGPLAN-SIGACT symposium on principles of programming languages (POPL \u201915), vol 50, no 1, pp 651\u2013662","key":"1092_CR10","DOI":"10.1145\/2775051.2677002"},{"doi-asserted-by":"crossref","unstructured":"Burckhardt S, Dern C, Musuvathi M, Tan R (2010) Line-up: a complete and automatic linearizability checker. In: Proceedings of the 31st ACM SIGPLAN conference on programming language design and implementation (PLDI\u201910), vol 45, no 6, pp 330\u2013340","key":"1092_CR11","DOI":"10.1145\/1809028.1806634"},{"doi-asserted-by":"crossref","unstructured":"Cook V, Peterson C, Painter Z, Dechev D (2020) Entropy measurement of concurrent disorder. In: Proceedings of the 17th international conference on quantitative evaluation of systems (QEST 2020)","key":"1092_CR12","DOI":"10.1007\/978-3-030-59854-9_18"},{"doi-asserted-by":"crossref","unstructured":"Cook V, Peterson C, Painter Z, Dechev D(2021) Design and implementation of highly scalable quantifiable data structures. In: International conference on parallel computing technologies. Springer, pp 371\u2013385","key":"1092_CR13","DOI":"10.1007\/978-3-030-86359-3_28"},{"doi-asserted-by":"crossref","unstructured":"Cook V, Peterson C, Painter Z, Dechev D (2021) Quantifiability: correctness of concurrent programs in vector space. In: 29th Euromicro international conference on parallel, distributed and network-based processing","key":"1092_CR14","DOI":"10.1109\/PDP52278.2021.00023"},{"doi-asserted-by":"crossref","unstructured":"Dang H, Dinh TTA, Loghin D, Chang EC. Lin Q, Ooi BC (2019) Towards scaling blockchain systems via sharding. In: Proceedings of the 2019 international conference on management of data, pp 123\u2013140","key":"1092_CR15","DOI":"10.1145\/3299869.3319889"},{"doi-asserted-by":"crossref","unstructured":"Debals O, De\u00a0Lathauwer L (2015) Stochastic and deterministic tensorization for blind signal separation. In: International conference on latent variable analysis and signal separation. Springer, pp 3\u201313","key":"1092_CR16","DOI":"10.1007\/978-3-319-22482-4_1"},{"doi-asserted-by":"crossref","unstructured":"Emmi M, Enea C, Hamza J (2015) Monitoring refinement via symbolic reasoning. In: Proceedings of the 36th ACM SIGPLAN conference on programming language design and implementation (PLDI \u201915), vol\u00a050. ACM, pp 260\u2013269","key":"1092_CR17","DOI":"10.1145\/2813885.2737983"},{"issue":"51\u201352","key":"1092_CR18","doi-asserted-by":"publisher","first-page":"4379","DOI":"10.1016\/j.tcs.2010.09.021","volume":"411","author":"I Filipovi\u0107","year":"2010","unstructured":"Filipovi\u0107 I, O\u2019Hearn P, Rinetzky N, Yang H (2010) Abstraction for concurrent objects. Theor Comput Sci 411(51\u201352):4379\u20134398","journal-title":"Theor Comput Sci"},{"doi-asserted-by":"crossref","unstructured":"Flanagan C, Godefroid P (2005) Dynamic partial-order reduction for model checking software. In: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages. vol\u00a040. ACM, pp 110\u2013121","key":"1092_CR19","DOI":"10.1145\/1047659.1040315"},{"doi-asserted-by":"crossref","unstructured":"Gaussier E, Glesser D, Reis V, Trystram D (2015) Improving backfilling by using machine learning to predict running times. In: Proceedings of the international conference for high performance computing, networking, storage and analysis, SC\u201915. IEEE, pp 1\u201310","key":"1092_CR20","DOI":"10.1145\/2807591.2807646"},{"issue":"4","key":"1092_CR21","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1137\/S0097539794279614","volume":"26","author":"PB Gibbons","year":"1997","unstructured":"Gibbons PB, Korach E (1997) Testing shared memories. SIAM J Comput 26(4):1208\u20131244","journal-title":"SIAM J Comput"},{"doi-asserted-by":"crossref","unstructured":"Gibbons R (1997) A historical application profiler for use by parallel schedulers. In: Workshop on job scheduling strategies for parallel processing. Springer, pp 58\u201377","key":"1092_CR22","DOI":"10.1007\/3-540-63574-2_16"},{"key":"1092_CR23","volume-title":"Polynomial approximation in hierarchical Tucker format by vector-tensorization","author":"L Grasedyck","year":"2010","unstructured":"Grasedyck L (2010) Polynomial approximation in hierarchical Tucker format by vector-tensorization. Institute f\u00fcr Geometrie und Praktische Mathematik, Bericht"},{"issue":"12","key":"1092_CR24","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1145\/359657.359666","volume":"21","author":"JV Guttag","year":"1978","unstructured":"Guttag JV, Horowitz E, Musser DR (1978) Abstract data types and software validation. Commun ACM 21(12):1048\u20131064","journal-title":"Commun ACM"},{"unstructured":"Haas A (2015) Fast concurrent data structures through timestamping. PhD thesis, University of Salzburg, Salzburg, Austria","key":"1092_CR25"},{"doi-asserted-by":"crossref","unstructured":"Haas A, Lippautz M, Henzinger TA, Payer H, Sokolova A, Kirsch CM, Sezgin A (2013) Distributed queues in shared memory: multicore performance and scalability through quantitative relaxation. In: Proceedings of the ACM international conference on computing frontiers, CF \u201913. ACM, New York, pp 17:1\u201317:9","key":"1092_CR26","DOI":"10.1145\/2482767.2482789"},{"doi-asserted-by":"crossref","unstructured":"Hendler D, Shavit N, Yerushalmi L (2004) A scalable lock-free stack algorithm. In: Proceedings of the sixteenth annual ACM symposium on parallelism in algorithms and architectures, SPAA \u201904. ACM, New York, pp 206\u2013215","key":"1092_CR27","DOI":"10.1145\/1007912.1007944"},{"doi-asserted-by":"crossref","unstructured":"Henzinger TA, Kirsch CM, Payer H, Sezgin A, Sokolova A (2013) Quantitative relaxation of concurrent data structures. In: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL \u201913. ACM, New York, pp 317\u2013328","key":"1092_CR28","DOI":"10.1145\/2429069.2429109"},{"unstructured":"Herlihy M, Shavit N (2012) The art of multiprocessor programming. Morgan Kaufmann, Revised Reprint. ISBN: 0123973375","key":"1092_CR29"},{"issue":"3","key":"1092_CR30","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy MP, Wing JM (1990) Linearizability: a correctness condition for concurrent objects. ACM Trans Program Lang Syst (TOPLAS) 12(3):463\u2013492","journal-title":"ACM Trans Program Lang Syst (TOPLAS)"},{"doi-asserted-by":"crossref","unstructured":"Hoare CAR (1978) Proof of correctness of data representations. In: Programming methodology. Springer, pp 269\u2013281","key":"1092_CR31","DOI":"10.1007\/978-1-4612-6315-9_20"},{"doi-asserted-by":"crossref","unstructured":"Kaya O, U\u00e7ar B (2015) Scalable sparse tensor decompositions in distributed memory systems. In: Proceedings of the international conference for high performance computing, networking, storage and analysis, SC\u201915. IEEE, pp 1\u201311","key":"1092_CR32","DOI":"10.1145\/2807591.2807624"},{"doi-asserted-by":"crossref","unstructured":"Kirsch CM, Lippautz M, Payer H (2013) Fast and scalable, lock-free k-FIFO queues. In: International conference on parallel computing technologies. Springer, pp 208\u2013223","key":"1092_CR33","DOI":"10.1007\/978-3-642-39958-9_18"},{"issue":"9","key":"1092_CR34","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L Lamport","year":"1979","unstructured":"Lamport L (1979) How to make a multiprocessor computer that correctly executes multiprocess program. IEEE Trans Comput 28(9):690\u2013691","journal-title":"IEEE Trans Comput"},{"doi-asserted-by":"crossref","unstructured":"Lane, J.R., Nakao, A (2008) Best-effort network layer packet reordering in support of multipath overlay packet dispersion. In: IEEE GLOBECOM 2008-2008 IEEE global telecommunications conference. IEEE, pp\u00a01\u20136","key":"1092_CR35","DOI":"10.1109\/GLOCOM.2008.ECP.472"},{"issue":"4","key":"1092_CR36","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1145\/319996.319999","volume":"8","author":"NA Lynch","year":"1983","unstructured":"Lynch NA (1983) Multilevel atomicity-a new correctness criterion for database concurrency control. ACM Trans Database Syst (TODS) 8(4):484\u2013502","journal-title":"ACM Trans Database Syst (TODS)"},{"doi-asserted-by":"crossref","unstructured":"Nanevski A, Banerjee A, Delbianco GA, F\u00e1bregas I (2019) Specifying concurrent programs in separation logic: morphisms and simulations. arXiv preprint. arXiv:1904.07136","key":"1092_CR37","DOI":"10.1145\/3360587"},{"doi-asserted-by":"crossref","unstructured":"Ou P, Demsky B (2017) Checking concurrent data structures under the C\/C++ 11 memory model. In: Proceedings of the 22nd ACM SIGPLAN symposium on principles and practice of parallel programming (PPoPP \u201917), vol\u00a052. ACM, pp 45\u201359","key":"1092_CR38","DOI":"10.1145\/3155284.3018749"},{"issue":"4","key":"1092_CR39","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/322154.322158","volume":"26","author":"CH Papadimitriou","year":"1979","unstructured":"Papadimitriou CH (1979) The serializability of concurrent database updates. J ACM (JACM) 26(4):631\u2013653","journal-title":"J ACM (JACM)"},{"issue":"4","key":"1092_CR40","first-page":"631","volume":"26","author":"CH Papadiniitriou","year":"1970","unstructured":"Papadiniitriou CH (1970) Serializability of concurrent updates. J ACM 26(4):631\u2013653","journal-title":"Serializability of concurrent updates. J ACM"},{"key":"1092_CR41","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.procs.2019.02.101","volume":"150","author":"A Paznikov","year":"2019","unstructured":"Paznikov A, Anenkov A (2019) Implementation and analysis of distributed relaxed concurrent queues in remote memory access model. Procedia Comput Sci 150:654\u2013662","journal-title":"Procedia Comput Sci"},{"doi-asserted-by":"crossref","unstructured":"Peterson C, Cook V, Dechev D (2021) Concurrent correctness in vector space. In: International conference on verification, model checking, and abstract interpretation. Springer, pp 151\u2013173","key":"1092_CR42","DOI":"10.1007\/978-3-030-67067-2_8"},{"issue":"3","key":"1092_CR43","doi-asserted-by":"publisher","first-page":"C269","DOI":"10.1137\/18M1210691","volume":"41","author":"ET Phipps","year":"2019","unstructured":"Phipps ET, Kolda TG (2019) Software for sparse tensor decomposition on emerging computing architectures. SIAM J Sci Comput 41(3):C269\u2013C290","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"1092_CR44","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/507234.507236","volume":"27","author":"H Schuldt","year":"2002","unstructured":"Schuldt H, Alonso G, Beeri C, Schek HJ (2002) Atomicity and isolation for transactional processes. ACM Trans Database Syst (TODS) 27(1):63\u2013116","journal-title":"ACM Trans Database Syst (TODS)"},{"doi-asserted-by":"crossref","unstructured":"Sergey I, Nanevski A, Banerjee A, Delbianco GA (2016) Hoare-style specifications as correctness conditions for non-linearizable concurrent objects. In: Proceedings of the 2016 ACM SIGPLAN international conference on object-oriented programming, systems, languages, and applications (OOPSLA \u201916), vol 51, no 10, pp 92\u2013110","key":"1092_CR45","DOI":"10.1145\/3022671.2983999"},{"key":"1092_CR46","doi-asserted-by":"publisher","first-page":"033037","DOI":"10.1088\/1742-6596\/1399\/3\/033037","volume":"1399","author":"AV Tabakov","year":"2019","unstructured":"Tabakov AV, Paznikov AA (2019) Using relaxed concurrent data structures for contention minimization in multithreaded MPI programs. J Phys Conf Ser 1399:033037","journal-title":"J Phys Conf Ser"},{"doi-asserted-by":"crossref","unstructured":"Tsafrir D, Etsion Y, Feitelson DG (2005) Modeling user runtime estimates. In: Workshop on job scheduling strategies for parallel processing. Springer, pp 1\u201335","key":"1092_CR47","DOI":"10.1007\/11605300_1"},{"doi-asserted-by":"crossref","unstructured":"Vechev M, Yahav E, Yorsh G (2009) Experience with model checking linearizability. In: International SPIN workshop on model checking of software. Springer, pp 261\u2013278","key":"1092_CR48","DOI":"10.1007\/978-3-642-02652-2_21"},{"issue":"2","key":"1092_CR49","doi-asserted-by":"publisher","first-page":"4-es","DOI":"10.1145\/1242520.1242521","volume":"3","author":"CP Wright","year":"2007","unstructured":"Wright CP, Spillane R, Sivathanu G, Zadok E (2007) Extending acid semantics to the file system. ACM Trans Storage (TOS) 3(2):4-es","journal-title":"ACM Trans Storage (TOS)"},{"issue":"3","key":"1092_CR50","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/TPDS.2015.2419651","volume":"27","author":"D Zhang","year":"2016","unstructured":"Zhang D, Dechev D (2016) A lock-free priority queue design based on multi-dimensional linked lists. IEEE Trans Parallel Distrib Syst 27(3):613\u2013626","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"12","key":"1092_CR51","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1109\/TSE.2015.2467371","volume":"41","author":"L Zhang","year":"2015","unstructured":"Zhang L, Chattopadhyay A, Wang C (2015) Round-up: runtime verification of quasi linearizability for concurrent data structures. IEEE Trans Softw Eng 41(12):1202\u20131216","journal-title":"IEEE Trans Softw Eng"},{"doi-asserted-by":"crossref","unstructured":"Zhou Q, Ye F (2019) Apex: automatic precondition execution with isolation and atomicity in internet-of-things. In: Proceedings of the international conference on internet of things design and implementation, pp 25\u201336","key":"1092_CR52","DOI":"10.1145\/3302505.3310066"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01092-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-022-01092-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01092-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T15:07:32Z","timestamp":1682348852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-022-01092-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,7]]},"references-count":52,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1092"],"URL":"https:\/\/doi.org\/10.1007\/s00607-022-01092-3","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2022,6,7]]},"assertion":[{"value":"4 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}