{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:37:52Z","timestamp":1725763072130},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319041315"},{"type":"electronic","value":"9783319041322"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04132-2_12","type":"book-chapter","created":{"date-parts":[[2013,12,8]],"date-time":"2013-12-08T21:49:14Z","timestamp":1386539354000},"page":"168-183","source":"Crossref","is-referenced-by-count":7,"title":["On the Correctness and Efficiency of Lock-Free Expandable Tries for Tabled Logic Programs"],"prefix":"10.1007","author":[{"given":"Miguel","family":"Areias","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Rocha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Areias, M., Rocha, R.: An Efficient and Scalable Memory Allocator for Multithreaded Tabled Evaluation of Logic Programs. In: International Conference on Parallel and Distributed Systems, pp. 636\u2013643. IEEE Computer Society (2012)","DOI":"10.1109\/ICPADS.2012.91"},{"issue":"4&5","key":"12_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1017\/S1471068412000117","volume":"12","author":"M. Areias","year":"2012","unstructured":"Areias, M., Rocha, R.: Towards Multi-Threaded Local Tabling Using a Common Table Space. Journal of Theory and Practice of Logic Programming, International Conference on Logic Programming, Special Issue\u00a012(4&5), 427\u2013443 (2012)","journal-title":"Journal of Theory and Practice of Logic Programming, International Conference on Logic Programming, Special Issue"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/227595.227597","volume":"43","author":"W. Chen","year":"1996","unstructured":"Chen, W., Warren, D.S.: Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM\u00a043(1), 20\u201374 (1996)","journal-title":"Journal of the ACM"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Detlefs, D.L., Martin, P.A., Moir, M., Steele Jr., G.L.: Lock-Free Reference Counting. In: ACM Symposium on Principles of Distributed Computing, pp. 190\u2013199. ACM (2001)","DOI":"10.1145\/383962.384016"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Hendler, D., Shavit, N., Yerushalmi, L.: A Scalable Lock-free Stack Algorithm. In: ACM Symposium on Parallelism in Algorithms and Architectures, pp. 206\u2013215. ACM (2004)","DOI":"10.1145\/1007912.1007944"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Wing, J.M.: Axioms for Concurrent Objects. In: ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 13\u201326. ACM (1987)","DOI":"10.1145\/41625.41627"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-540-89982-2_24","volume-title":"Logic Programming","author":"R. Marques","year":"2008","unstructured":"Marques, R., Swift, T.: Concurrent and Local Evaluation of Normal Programs. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 206\u2013222. Springer, Heidelberg (2008)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-642-11503-5_22","volume-title":"Practical Aspects of Declarative Languages","author":"R. Marques","year":"2010","unstructured":"Marques, R., Swift, T., Cunha, J.: A Simple and Efficient Implementation of Concurrent Local Tabling. In: Carro, M., Pe\u00f1a, R. (eds.) PADL 2010. LNCS, vol.\u00a05937, pp. 264\u2013278. Springer, Heidelberg (2010)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Michael, M.M.: High Performance Dynamic Lock-Free Hash Tables and List-Based Sets. In: ACM Symposium on Parallel Algorithms and Architectures, pp. 73\u201382. ACM (2002)","DOI":"10.1145\/564870.564881"},{"issue":"6","key":"12_CR11","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TPDS.2004.8","volume":"15","author":"M.M. Michael","year":"2004","unstructured":"Michael, M.M.: Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects. IEEE Transactions on Parallel and Distributed Systems\u00a015(6), 491\u2013504 (2004)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Prokopec, A., Bronson, N.G., Bagwell, P., Odersky, M.: Concurrent Tries with Efficient Non-Blocking Snapshots. In: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 151\u2013160. ACM (2012)","DOI":"10.1145\/2370036.2145836"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0743-1066(98)10013-4","volume":"38","author":"I.V. Ramakrishnan","year":"1999","unstructured":"Ramakrishnan, I.V., Rao, P., Sagonas, K., Swift, T., Warren, D.S.: Efficient Access Mechanisms for Tabled Logic Programs. Journal of Logic Programming\u00a038(1), 31\u201354 (1999)","journal-title":"Journal of Logic Programming"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-45284-0_10","volume-title":"Practical Aspects of Declarative Languages","author":"J. Santos","year":"2013","unstructured":"Santos, J., Rocha, R.: On the Efficient Implementation of Mode-Directed Tabling. In: Gupta, G. (ed.) PADL 2013. LNCS, vol.\u00a07752, pp. 141\u2013156. Springer, Heidelberg (2013)"},{"issue":"1&2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1017\/S1471068411000512","volume":"12","author":"V. Santos Costa","year":"2012","unstructured":"Santos Costa, V., Rocha, R., Damas, L.: The YAP Prolog System. Journal of Theory and Practice of Logic Programming\u00a012(1&2), 5\u201334 (2012)","journal-title":"Journal of Theory and Practice of Logic Programming"},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1145\/1147954.1147958","volume":"53","author":"O. Shalev","year":"2006","unstructured":"Shalev, O., Shavit, N.: Split-Ordered Lists: Lock-Free Extensible Hash Tables. Journal of the ACM\u00a053(3), 379\u2013405 (2006)","journal-title":"Journal of the ACM"},{"key":"12_CR17","unstructured":"Triplett, J., McKenney, P.E., Walpole, J.: Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming. In: USENIX Annual Technical Conference, p. 11. USENIX Association (2011)"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04132-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T04:48:58Z","timestamp":1558759738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04132-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319041315","9783319041322"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04132-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}