{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:38:11Z","timestamp":1761917891085},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030346263"},{"type":"electronic","value":"9783030346270"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34627-0_7","type":"book-chapter","created":{"date-parts":[[2019,11,12]],"date-time":"2019-11-12T14:02:55Z","timestamp":1573567375000},"page":"78-93","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Extending Index-Array Properties for Data Dependence Analysis"],"prefix":"10.1007","author":[{"given":"Mahdi Soltan","family":"Mohammadi","sequence":"first","affiliation":[]},{"given":"Kazem","family":"Cheshmi","sequence":"additional","affiliation":[]},{"given":"Maryam Mehri","family":"Dehnavi","sequence":"additional","affiliation":[]},{"given":"Anand","family":"Venkat","sequence":"additional","affiliation":[]},{"given":"Tomofumi","family":"Yuki","sequence":"additional","affiliation":[]},{"given":"Michelle Mills","family":"Strout","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,13]]},"reference":[{"key":"7_CR1","unstructured":"Ctop research group webpage at utah (2018). http:\/\/ctop.cs.utah.edu\/ctop\/"},{"key":"7_CR2","unstructured":"Sparselib++ homepage (2018). https:\/\/math.nist.gov\/sparselib++\/"},{"key":"7_CR3","unstructured":"Z3 git homepage (2018). https:\/\/github.com\/Z3Prover\/z3\/wiki"},{"key":"7_CR4","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2016). www.SMT-LIB.org"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1006\/jpdc.1996.1261","volume":"40","author":"D Barthou","year":"1997","unstructured":"Barthou, D., Collard, J.F., Feautrier, P.: Fuzzy array dataflow analysis. J. Parallel Distrib. Comput. 40(2), 210\u2013226 (1997)","journal-title":"J. Parallel Distrib. Comput."},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/11609773_28","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"AR Bradley","year":"2005","unstructured":"Bradley, A.R., Manna, Z., Sipma, H.B.: What\u2019s decidable about arrays? In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 427\u2013442. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11609773_28"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Cheshmi, K., Kamil, S., Strout, M.M., Dehnavi, M.M.: Sympiler: transforming sparse matrix codes by decoupling symbolic analysis. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2017, pp. 13:1\u201313:13. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3126908.3126936","DOI":"10.1145\/3126908.3126936"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/2049662.2049663","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of Florida sparse matrix collection. ACM Trans. Math. Softw. (TOMS) 38(1), 1:1\u20131:25 (2011). https:\/\/doi.org\/10.1145\/2049662.2049663 . Article no. 1. http:\/\/doi.acm.org\/10.1145\/2049662.2049663","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-642-02658-4_25","volume-title":"Computer Aided Verification","author":"Y Ge","year":"2009","unstructured":"Ge, Y., de Moura, L.: Complete instantiation for quantified formulas in satisfiabiliby modulo theories. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 306\u2013320. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_25"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-540-78499-9_33","volume-title":"Foundations of Software Science and Computational Structures","author":"P Habermehl","year":"2008","unstructured":"Habermehl, P., Iosif, R., Vojnar, T.: What else is decidable about integer arrays? In: Amadio, R. (ed.) FoSSaCS 2008. LNCS, vol. 4962, pp. 474\u2013489. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78499-9_33"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Lin, Y., Padua, D.: Compiler analysis of irregular memory accesses. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, vol. 35, pp. 157\u2013168. ACM, New York, May 2000","DOI":"10.1145\/358438.349322"},{"key":"7_CR12","unstructured":"McKinley, K.: Dependence analysis of arrays subscriptecl by index arrays. Technical report. TR91187, Rice University (1991)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Oancea, C.E., Rauchwerger, L.: Logical inference techniques for loop parallelization. In: Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2012. ACM, New York (2012)","DOI":"10.1145\/2254064.2254124"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-36036-7_5","volume-title":"Languages and Compilers for Parallel Computing","author":"CE Oancea","year":"2013","unstructured":"Oancea, C.E., Rauchwerger, L.: A hybrid approach to proving memory reference monotonicity. In: Rajopadhye, S., Mills Strout, M. (eds.) LCPC 2011. LNCS, vol. 7146, pp. 61\u201375. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36036-7_5"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Paek, Y., Hoeflinger, J., Padua, D.: Simplification of array access patterns for compiler optimizations. In: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, PLDI 1998, pp. 60\u201371. ACM, New York (1998)","DOI":"10.1145\/277652.277664"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Pugh, W., Wonnacott, D.: Nonlinear array dependence analysis. In: Third Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers, Troy, New York, May 1995","DOI":"10.1007\/978-1-4615-2315-4_1"},{"issue":"3","key":"7_CR17","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1145\/291889.291900","volume":"20","author":"W Pugh","year":"1998","unstructured":"Pugh, W., Wonnacott, D.: Constraint-based array dependence analysis. ACM Trans. Program. Lang. Syst. 20(3), 635\u2013678 (1998)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"7_CR18","unstructured":"Rus, S.: Hybrid analysis of memory references and its application to automatic parallelization. Ph.D. thesis, Texas A&M (2006)"},{"issue":"4","key":"7_CR19","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1024597010150","volume":"31","author":"S Rus","year":"2003","unstructured":"Rus, S., Hoeflinger, J., Rauchwerger, L.: Hybrid analysis: static & dynamic memory reference analysis. Int. J. Parallel Program. 31(4), 251\u2013283 (2003)","journal-title":"Int. J. Parallel Program."},{"issue":"2","key":"7_CR20","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1145\/322123.322137","volume":"26","author":"RE Shostak","year":"1979","unstructured":"Shostak, R.E.: A practical decision procedure for arithmetic with function symbols. J. ACM 26(2), 351\u2013360 (1979). https:\/\/doi.org\/10.1145\/322123.322137","journal-title":"J. ACM"},{"key":"7_CR21","unstructured":"Soltan Mohammadi, M., et al.: Sparse matrix code dependence analysis simplification at compile time. ArXiv e-prints, July 2018"},{"issue":"C","key":"7_CR22","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.parco.2016.02.004","volume":"53","author":"MM Strout","year":"2016","unstructured":"Strout, M.M., LaMielle, A., Carter, L., Ferrante, J., Kreaseck, B., Olschanowsky, C.: An approach for code generation in the sparse polyhedral framework. Parallel Comput. 53(C), 32\u201357 (2016)","journal-title":"Parallel Comput."},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Venkat, A., et al.: Automating wavefront parallelization for sparse matrix computations. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2016, pp. 41:1\u201341:12 (2016)","DOI":"10.1109\/SC.2016.40"},{"key":"7_CR24","unstructured":"Verdoolaege, S.: Integer Set Library: Manual (2018). http:\/\/isl.gforge.inria.fr"},{"key":"7_CR25","unstructured":"Vuduc, R., Kamil, S., Hsu, J., Nishtala, R., Demmel, J.W., Yelick, K.A.: Automatic performance tuning and analysis of sparse triangular solve. ICS (2002)"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-06486-4_7","volume-title":"High-Performance Computing on the Intel\u00ae Xeon Phi\u2122","author":"E Wang","year":"2014","unstructured":"Wang, E., et al.: Intel math kernel library. High-Performance Computing on the Intel\u00ae Xeon Phi\u2122, pp. 167\u2013188. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06486-4_7"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34627-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,4]],"date-time":"2022-10-04T12:36:31Z","timestamp":1664886991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34627-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030346263","9783030346270"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34627-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LCPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Languages and Compilers for Parallel Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Salt Lake City, UT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lcpc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lcpcworkshop.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}