{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:24:06Z","timestamp":1725891846372},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540472377"},{"type":"electronic","value":"9783540472384"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11901914_16","type":"book-chapter","created":{"date-parts":[[2006,10,10]],"date-time":"2006-10-10T05:21:43Z","timestamp":1160457703000},"page":"186-199","source":"Crossref","is-referenced-by-count":4,"title":["On the Satisfiability of Modular Arithmetic Formulae"],"prefix":"10.1007","author":[{"given":"Bow-Yaw","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Babi\u0107, D., Musuvathi, M.: Modular arithmetic decision procedure. Technical Report MSR-TR-2005-114, Microsoft Research (2005)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-27813-9_49","volume-title":"Computer Aided Verification","author":"C. Barrett","year":"2004","unstructured":"Barrett, C., Berezin, S.: CVC Lite: A new implementation of the cooperating validity checker. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 515\u2013518. Springer, Heidelberg (2004)"},{"key":"16_CR3","first-page":"317","volume-title":"Design Automation Conference","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of BDDs. In: Design Automation Conference, pp. 317\u2013320. ACM Press, New York (1999)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45619-8_1","volume-title":"Logic Programming","author":"B. Boigelot","year":"2002","unstructured":"Boigelot, B., Wolper, P.: Representing arithmetic constraints with finite automata: An overview. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, pp. 1\u201319. Springer, Heidelberg (2002)"},{"issue":"2\u20133","key":"16_CR5","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1023\/B:FORM.0000040025.89719.f3","volume":"25","author":"E. Clarke","year":"2004","unstructured":"Clarke, E., Kroening, D., Sharygina, N., Yorav, K.: Predicate abstraction of ANSI-C programs using SAT. Formal Methods in System Design\u00a025(2\u20133), 105\u2013127 (2004)","journal-title":"Formal Methods in System Design"},{"key":"16_CR6","unstructured":"Cooper, D.C.: Theorem proving in arithmetic without multiplication. Machine Intelligence 7 (1972)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: ACM Symposium on Principles of Programming Languages, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"16_CR8","volume-title":"A Mathematical Introduction to Logic","author":"H. Enderton","year":"1972","unstructured":"Enderton, H.: A Mathematical Introduction to Logic. Academic Press, London (1972)"},{"key":"16_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5712.001.0001","volume-title":"PVM: Parallel Virtual Machine \u2013 A Users\u2019 Guide and Tutorial for Networked Parallel Computing","author":"A. Geist","year":"1994","unstructured":"Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., Sunderam, V.: PVM: Parallel Virtual Machine \u2013 A Users\u2019 Guide and Tutorial for Networked Parallel Computing. MIT Press, Cambridge (1994)"},{"key":"16_CR10","unstructured":"Huet, G., Kahn, G.: Paulin-Mohring: The Coq proof assistant: a tutorial: version 6.1. Technical Report 204, Institut National de Recherche en Informatique et en Automatique (1997)"},{"key":"16_CR11","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6101-8","volume-title":"Algebra","author":"T.W. Hungerford","year":"1980","unstructured":"Hungerford, T.W.: Algebra. Graduate Texts in Mathematics, vol.\u00a073. Springer, Heidelberg (1980)"},{"key":"16_CR12","series-title":"Seminumerical Algorithms","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming. Seminumerical Algorithms, vol.\u00a0II. Addison-Wesley, Reading (1997)"},{"key":"16_CR13","unstructured":"Melham, T.F.: Introduction to the HOL theorem prover. University of Cambridge, Computer Laboratory (1990)"},{"key":"16_CR14","volume-title":"Advanced Linear Programming: Computation and Practice","author":"B.A. Murtagh","year":"1981","unstructured":"Murtagh, B.A.: Advanced Linear Programming: Computation and Practice. McGraw-Hill, New York (1981)"},{"key":"16_CR15","first-page":"34","volume-title":"ACM Symposium on Theory of Computing","author":"D.C. Oppen","year":"1973","unstructured":"Oppen, D.C.: Elementary bounds for presburger arithmetic. In: ACM Symposium on Theory of Computing, pp. 34\u201337. ACM, New York (1973)"},{"key":"16_CR16","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"16_CR17","unstructured":"Paulson, L.C., Nipkow, T.: Isabelle tutorial and user\u2019s manual. Technical Report TR-189, Computer Laboratory, University of Cambridge (1990)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Ralphs, T.K., Guzelsoy, M.: The SYMPHONY callable library for mixed integer programming. In: INFORMS Computing Society (2005)","DOI":"10.1007\/0-387-23529-9_5"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1145\/800133.804361","volume-title":"ACM Symposium on Theory of Computing","author":"C.R. Reddy","year":"1978","unstructured":"Reddy, C.R., Loveland, D.W.: Presburger arithmetic with bounded quantifier alternation. In: ACM Symposium on Theory of Computing, pp. 320\u2013325. ACM, New York (1978)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","first-page":"72","volume-title":"Computer Aided Verification","author":"H. Sa\u00eddi","year":"1997","unstructured":"Sa\u00eddi, H., Graf, S.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 72\u201383. Springer, Heidelberg (1997)"},{"key":"16_CR21","first-page":"100","volume-title":"Logic in Computer Science","author":"S.A. Seshia","year":"2004","unstructured":"Seshia, S.A., Bryant, R.E.: Deciding quantifier-free presburger formulas using parameterized solution bounds. In: Logic in Computer Science, pp. 100\u2013109. IEEE Computer Society, Los Alamitos (2004)"},{"key":"16_CR22","volume-title":"Cryptography: Theory and Practice","author":"D.R. Stinson","year":"1995","unstructured":"Stinson, D.R.: Cryptography: Theory and Practice. CRC Press, Boca Raton (1995)"},{"key":"16_CR23","unstructured":"Wang, B.Y.: On the satisfiability of modular arithmetic formula. Technical Report TR-IIS-06-001, Institute of Information Science, Academia Sinica (2006), \n                    \n                      http:\/\/www.iis.sinica.edu.tw\/LIB\/TechReport\/tr2006\/tr06.html"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11901914_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:37:09Z","timestamp":1619509029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11901914_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540472377","9783540472384"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11901914_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}