{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:29:14Z","timestamp":1725568154651},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405597"},{"type":"electronic","value":"9783540450856"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45085-6_14","type":"book-chapter","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T13:13:30Z","timestamp":1288098810000},"page":"167-181","source":"Crossref","is-referenced-by-count":1,"title":["A Randomized Satisfiability Procedure for Arithmetic and Uninterpreted Function Symbols"],"prefix":"10.1007","author":[{"given":"Sumit","family":"Gulwani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George C.","family":"Necula","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Ackermann, W.: Solvable Cases of the Decision Problem. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam (1954)"},{"key":"14_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/10721959_5","volume-title":"Automated Deduction - CADE-17","author":"L. Bachmair","year":"2000","unstructured":"Bachmair, L., Tiwari, A.: Abstract congruence closure and specializations. In: McAllester, D. (ed.) CADE 2000. LNCS (LNAI), vol.\u00a01831, pp. 64\u201378. Springer, Heidelberg (2000)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-44585-4_22","volume-title":"Computer Aided Verification","author":"J.-C. Filli\u00e2tre","year":"2001","unstructured":"Filli\u00e2tre, J.-C., Owre, S., Rue\u00df, H., Shankar, N.: ICS: Integrated Canonization and Solving. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 246\u2013249. Springer, Heidelberg (2001)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/604131.604138","volume-title":"The 30th Annual ACM Symposium on Principles of Programming Languages","author":"S. Gulwani","year":"2003","unstructured":"Gulwani, S., Necula, G.C.: Discovering affine equalities using random interpretation. In: The 30th Annual ACM Symposium on Principles of Programming Languages, pp. 74\u201384. ACM Press, New York (2003)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Necula, G.C.: A randomized satisfiability procedure for arithmetic and uninterpreted function symbols. Technical Report UCB-CS-03-1241. University of California, Berkeley (2003)","DOI":"10.1007\/978-3-540-45085-6_14"},{"key":"14_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/357073.357079","volume":"1","author":"G. Nelson","year":"1979","unstructured":"Nelson, G., Oppen, D.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems\u00a01(2), 245\u2013257 (1979)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/LICS.2001.932479","volume-title":"16th Annual IEEE Symposium on Logic in Computer Science (LICS 2001)","author":"H. Ruess","year":"2001","unstructured":"Ruess, H., Shankar, N.: Deconstructing Shostak. In: 16th Annual IEEE Symposium on Logic in Computer Science (LICS 2001), Washington - Brussels - Tokyo, pp. 19\u201328. IEEE, Los Alamitos (2001)"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2422.322411","volume":"31","author":"R.E. Shostak","year":"1984","unstructured":"Shostak, R.E.: Deciding combinations of theories. Journal of the ACM\u00a031(1), 1\u201312 (1984)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-19"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45085-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T22:12:05Z","timestamp":1559772725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45085-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405597","9783540450856"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45085-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}