{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T13:40:10Z","timestamp":1716644410441},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,3,29]],"date-time":"2014-03-29T00:00:00Z","timestamp":1396051200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form Methods Syst Des"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10703-014-0206-z","type":"journal-article","created":{"date-parts":[[2014,3,28]],"date-time":"2014-03-28T23:51:15Z","timestamp":1396050675000},"page":"189-212","source":"Crossref","is-referenced-by-count":4,"title":["Verification of Galois field based circuits by formal reasoning based on computational algebraic geometry"],"prefix":"10.1007","volume":"45","author":[{"given":"Alexey","family":"Lvov","sequence":"first","affiliation":[]},{"given":"Luis A.","family":"Lastras-Monta\u00f1o","sequence":"additional","affiliation":[]},{"given":"Barry","family":"Trager","sequence":"additional","affiliation":[]},{"given":"Viresh","family":"Paruthi","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Shadowen","sequence":"additional","affiliation":[]},{"given":"Ali","family":"El-Zein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,29]]},"reference":[{"key":"206_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1147\/JRD.2011.2177106","volume":"56","author":"PJ Meaney","year":"2012","unstructured":"Meaney PJ, Lastras-Monta\u00f1o LA, Papazova VK, Stephens E, Johnson JS, Alves LC, O\u2019Connor JA, Clarke WJ (2012) IBM zEnterprise redundant array of independent memory subsystem. IBM J Res Dev 56:1\u20134","journal-title":"IBM J Res Dev"},{"key":"206_CR2","doi-asserted-by":"crossref","unstructured":"Lastras-Monta\u00f1o LA, Meaney PJ, Stephens E, Trager BM, O\u2019Connor J, Alves LC (2011) A new class of array codes for memory storage. In: Information theory and applications workshop (ITA), pp 1\u201310, 6\u201311","DOI":"10.1109\/ITA.2011.5743586"},{"key":"206_CR3","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C\u201335","author":"RE Bryant","year":"1986","unstructured":"Bryant RE (1986) Graph based algorithms for Boolean function manipulation. IEEE Trans Comput C\u201335:677\u2013691","journal-title":"IEEE Trans Comput"},{"key":"206_CR4","doi-asserted-by":"crossref","unstructured":"Bryant RE, Chen Y-A (1995) Verification of arithmetic functions with binary moment diagrams. In: Design automation conference","DOI":"10.21236\/ADA281028"},{"key":"206_CR5","doi-asserted-by":"crossref","unstructured":"Kebschull U, Rosentiel W (1993) Efficient graph-based computation and manipulation of functional decision diagrams. In: European conference on design automation, pp 278\u2013282","DOI":"10.1109\/EDAC.1993.386463"},{"key":"206_CR6","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-3-540-30494-4_12","volume-title":"Formal methods in computer-aided design","author":"H Mony","year":"2004","unstructured":"Mony H, Baumgartner J, Paruthi V, Kanzelman R, Kuehlmann A (2004) Scalable automated verification via expert-system guided transformations. In: Hu AJ, Martin AK (eds) Formal methods in computer-aided design. Springer, Berlin, pp 159\u2013173"},{"key":"206_CR7","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/3-540-44585-4_45","volume":"2102","author":"S Morioka","year":"2001","unstructured":"Morioka S, Katayama Y, Yamane T (2001) Towards efficient verification of arithmetic algorithms over Galois fields. Proc Comput Aided Verif 2102:465\u2013477","journal-title":"Proc Comput Aided Verif"},{"key":"206_CR8","doi-asserted-by":"crossref","unstructured":"Lv J, Kalla P, Enescu F (2011) Verification of composite Galois field multipliers over $$GF((2^m)^n)$$ G F ( ( 2 m ) n ) using computer algebra techniques. In: Proceedings of IEEE international high level design validation and test, workshop, pp 136\u2013143","DOI":"10.1109\/HLDVT.2011.6113989"},{"key":"206_CR9","doi-asserted-by":"crossref","unstructured":"Pretzel O (1992) Error-correcting codes and finite fields. Oxford applied mathematics and CS series. Oxford University Press, Oxford. ISBN 0-198-59678-2","DOI":"10.1093\/oso\/9780198596783.001.0001"},{"key":"206_CR10","unstructured":"Lidl R, Niederreiter H (1997) Finite fields: encyclopedia of mathematics and its applications, vol 20. Cambridge University Press, Cambridge. ISBN: 0-521-39231-4"},{"key":"206_CR11","unstructured":"Cox D, Little J, O\u2019Shea D (2010) Ideals, varieties and algorithms. Undergraduate texts in mathematics. Springer, New York. ISBN: 0-387-35650-9"},{"issue":"5","key":"206_CR12","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1109\/92.953498","volume":"9","author":"D Sarwate","year":"2001","unstructured":"Sarwate D, Shanbhag N (2001) High-speed architectures for Reed\u2013Solomon decoders. IEEE Trans VLSI Syst 9(5):641\u2013655","journal-title":"IEEE Trans VLSI Syst"},{"key":"206_CR13","unstructured":"Decker W, Greuel G-M, Pfister G, Sch\u00f6nemann H (2011) Singular 3-1-3\u2014a computer algebra system for polynomial computations. http:\/\/www.singular.uni-kl.de"},{"key":"206_CR14","unstructured":"Dreyer A, Marx O, Pavlenko E, Wedler M, Stoffel D, Kunz W, Greuel G (2011) Preprocessing polynomials for arithmetic reasoning within the SMT-Solver STABLE. In: Seventh international workshop on constraints in formal verification (CFV\u201911), San Jose, CA, USA"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-014-0206-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10703-014-0206-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-014-0206-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T13:04:57Z","timestamp":1716642297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10703-014-0206-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,29]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["206"],"URL":"https:\/\/doi.org\/10.1007\/s10703-014-0206-z","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,29]]}}}