{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:45:59Z","timestamp":1742913959756,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642197178"},{"type":"electronic","value":"9783642197185"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19718-5_6","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T14:17:15Z","timestamp":1300112235000},"page":"97-115","source":"Crossref","is-referenced-by-count":4,"title":["Transfer Function Synthesis without Quantifier Elimination"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Brauer","sequence":"first","affiliation":[]},{"given":"Andy","family":"King","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Atmel Products. AVR32 Architecture Manual (2007), http:\/\/www.atmel.com\/","key":"6_CR1"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10703-009-0073-1","volume":"35","author":"R. Bagnara","year":"2009","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Weakly-relational shapes for numeric abstractions: improved algorithms and proofs of correctness. Formal Methods in System Design\u00a035(3), 279\u2013323 (2009)","journal-title":"Formal Methods in System Design"},{"key":"6_CR3","volume-title":"Principles of Model Checking","author":"C. Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. The MIT Press, Cambridge (2008)"},{"doi-asserted-by":"crossref","unstructured":"Balakrishnan, G., Reps, T.: WYSINWYX: What You See Is Not What You eXecute. ACM Trans. Program. Lang. Syst.\u00a032(6) (2010)","key":"6_CR4","DOI":"10.1145\/1749608.1749612"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.entcs.2010.09.003","volume":"267","author":"E. Barrett","year":"2010","unstructured":"Barrett, E., King, A.: Range and Set Abstraction Using SAT. Electronic Notes in Theoretical Computer Science\u00a0267(1), 17\u201327 (2010)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-15769-1_11","volume-title":"Static Analysis","author":"J. Brauer","year":"2010","unstructured":"Brauer, J., King, A.: Automatic Abstraction for Intervals using Boolean Formulae. In: Cousot, R., Martel, M. (eds.) SAS 2010. LNCS, vol.\u00a06337, pp. 167\u2013183. Springer, Heidelberg (2010)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-24730-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E. Clarke","year":"2004","unstructured":"Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 168\u2013176. Springer, Heidelberg (2004)"},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1017\/S1471068407003146","volume":"8","author":"M. Codish","year":"2008","unstructured":"Codish, M., Lagoon, V., Stuckey, P.J.: Logic programming with satisfiability. Theory and Practice of Logic Programming\u00a08(1), 121\u2013128 (2008)","journal-title":"Theory and Practice of Logic Programming"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-12002-2_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B. Cook","year":"2010","unstructured":"Cook, B., Kroening, D., R\u00fcmmer, P., Wintersteiger, C.: Ranking Function Synthesis for Bit-Vector Relations. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 236\u2013250. Springer, Heidelberg (2010)"},{"key":"6_CR10","first-page":"238","volume-title":"POPL","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation: A Unified Lattice model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: POPL, pp. 238\u2013252. ACM Press, New York (1977)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-31987-0_3","volume-title":"Programming Languages and Systems","author":"P. Cousot","year":"2005","unstructured":"Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Mine, A., Monniaux, D., Rival, X.: The Astr\u00e9e analyser. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 21\u201330. Springer, Heidelberg (2005)"},{"key":"6_CR12","first-page":"84","volume-title":"POPL","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Halbwachs, N.: Automatic Discovery of Linear Restraints Among Variables of a Program. In: POPL, pp. 84\u201397. ACM Press, New York (1978)"},{"issue":"1-3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0167-6423(97)00034-8","volume":"32","author":"R. Giacobazzi","year":"1998","unstructured":"Giacobazzi, R., Ranzato, F.: Optimal domains for disjunctive abstract interpretation. Sci. Comput. Program.\u00a032(1-3), 177\u2013210 (1998)","journal-title":"Sci. Comput. Program."},{"issue":"13","key":"6_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1080\/00207168908803778","volume":"30","author":"P. Granger","year":"1989","unstructured":"Granger, P.: Static Analysis of Arithmetical Congruences. International Journal of Computer Mathematics\u00a030(13), 165\u2013190 (1989)","journal-title":"International Journal of Computer Mathematics"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/1375581.1375616","volume-title":"PLDI","author":"S. Gulwani","year":"2008","unstructured":"Gulwani, S., Srivastava, S., Venkatesan, R.: Program Analysis as Constraint Solving. In: PLDI, pp. 281\u2013292. ACM Press, New York (2008)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF00290339","volume":"7","author":"J.B. Kam","year":"1997","unstructured":"Kam, J.B., Ullman, J.D.: Monotone Data Flow Analysis Frameworks. Acta Informatica\u00a07, 305\u2013317 (1997)","journal-title":"Acta Informatica"},{"unstructured":"Kapur, D.: Automatically Generating Loop Invariants Using Quantifier Elimination. In: Deduction and Applications, vol.\u00a005431, IBFI (2005)","key":"6_CR17"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF00268497","volume":"6","author":"M. Karr","year":"1976","unstructured":"Karr, M.: Affine Relationships among Variables of a Program. Acta Informatica\u00a06, 133\u2013151 (1976)","journal-title":"Acta Informatica"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-11319-2_16","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. King","year":"2010","unstructured":"King, A., S\u00f8ndergaard, H.: Automatic Abstraction for Congruences. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol.\u00a05944, pp. 197\u2013213. Springer, Heidelberg (2010)"},{"key":"6_CR20","volume-title":"Decision Procedures","author":"D. Kroening","year":"2008","unstructured":"Kroening, D., Strichman, O.: Decision Procedures. Springer, Heidelberg (2008)"},{"unstructured":"Le Berre, D.: SAT4J: Bringing the power of SAT technology to the Java platform (2010), http:\/\/www.sat4j.org\/","key":"6_CR21"},{"issue":"1","key":"6_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10990-006-8609-1","volume":"19","author":"A. Min\u00e9","year":"2006","unstructured":"Min\u00e9, A.: The Octagon Abstract Domain. Higher-Order and Symbolic Computation\u00a019(1), 31\u2013100 (2006)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"6_CR23","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/1480881.1480899","volume-title":"POPL","author":"D. Monniaux","year":"2009","unstructured":"Monniaux, D.: Automatic Modular Abstractions for Linear Constraints. In: POPL, pp. 140\u2013151. ACM Press, New York (2009)"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-14295-6_51","volume-title":"Computer Aided Verification","author":"D. Monniaux","year":"2010","unstructured":"Monniaux, D.: Quantifier Elimination by Lazy Model Enumeration. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol.\u00a06174, pp. 585\u2013599. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Analysis of Modular Arithmetic. ACM Trans. Program. Lang. Syst.\u00a029(5) (August 2007)","key":"6_CR25","DOI":"10.1145\/1275497.1275504"},{"issue":"2","key":"6_CR26","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10107-003-0433-3","volume":"99","author":"A. Neumaier","year":"2004","unstructured":"Neumaier, A., Shcherbina, O.: Safe Bounds in Linear and Mixed-Integer Linear Programming. Math. Program.\u00a099(2), 283\u2013296 (2004)","journal-title":"Math. Program."},{"issue":"3","key":"6_CR27","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","volume":"2","author":"D.A. Plaisted","year":"1986","unstructured":"Plaisted, D.A., Greenbaum, S.: A Structure-Preserving Clause Form Translation. Journal of Symbolic Computation\u00a02(3), 293\u2013304 (1986)","journal-title":"Journal of Symbolic Computation"},{"issue":"5","key":"6_CR28","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/1037949.1024410","volume":"38","author":"J. Regehr","year":"2004","unstructured":"Regehr, J., Reid, A.: HOIST: A System for Automatically Deriving Static Analyzers for Embedded Systems. ACM SIGOPS Operating Systems Review\u00a038(5), 133\u2013143 (2004)","journal-title":"ACM SIGOPS Operating Systems Review"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-24622-0_21","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"T. Reps","year":"2004","unstructured":"Reps, T., Sagiv, M., Yorsh, G.: Symbolic Implementation of the Best Transformer. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol.\u00a02937, pp. 252\u2013266. Springer, Heidelberg (2004)"},{"issue":"4","key":"6_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1721695.1721702","volume":"9","author":"B. Schlich","year":"2010","unstructured":"Schlich, B.: Model Checking of Software for Microcontrollers. ACM Trans. Embed. Comput. Syst.\u00a09(4), 1\u201327 (2010)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-74061-2_8","volume-title":"Static Analysis","author":"A. Simon","year":"2007","unstructured":"Simon, A., King, A.: Taming the Wrapping of Integer Arithmetic. In: Riis Nielson, H., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol.\u00a04634, pp. 121\u2013136. Springer, Heidelberg (2007)"},{"unstructured":"Simon, A., King, A., Howe, J.M.: The Two Variable Per Inequality Abstract Domain. Higher-Order and Symbolic Computation (to appear)","key":"6_CR32"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19718-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T18:36:55Z","timestamp":1685990215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19718-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642197178","9783642197185"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19718-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}