{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:49:36Z","timestamp":1725565776161},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540227915"},{"type":"electronic","value":"9783540278641"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27864-1_22","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T16:35:37Z","timestamp":1284654937000},"page":"296-311","source":"Crossref","is-referenced-by-count":9,"title":["Approximating the Algebraic Relational Semantics of Imperative Programs"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Col\u00f3n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0913-3","volume-title":"Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra","author":"T. Becker","year":"1993","unstructured":"Becker, T., Weispfenning, V.: Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra. Springer, New York (1993)"},{"key":"22_CR2","first-page":"89","volume-title":"Constraint Logic Programming: Selected Research","author":"A. Colmerauer","year":"1993","unstructured":"Colmerauer, A.: Naive solving of non-linear constraints. In: Benhamou, F., Colmerauer, A. (eds.) Constraint Logic Programming: Selected Research, pp. 89\u2013112. MIT Press, Cambridge (1993)"},{"doi-asserted-by":"crossref","unstructured":"Cousot, P.: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. Electronic Notes in Theoretical Computer Science, vol.\u00a06 (1997), http:\/\/www.elsevier.nl\/locate\/entcs\/volume6.html","key":"22_CR3","DOI":"10.1016\/S1571-0661(05)80168-9"},{"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: Conference Record of the 4th ACM Symposium on Principles of Programming Languages, pp. 238\u2013252 (1977)","key":"22_CR4","DOI":"10.1145\/512950.512973"},{"doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Automatic synthesis of optimal invariant assertions: Mathematical foundations. In: Proceedings of the ACM Symposium on Artificial Intelligence and Programming Languages, pp. 1\u201312 (1977)","key":"22_CR5","DOI":"10.1145\/800228.806926"},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-55844-6_142","volume-title":"Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Comparing the Galois connection and widening\/ narrowing approaches to Abstract Interpretation. In: Bruynooghe, M., Wirsing, M. (eds.) Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming, pp. 269\u2013295. Springer, Heidelberg (1992)"},{"doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Conference Record of the 5th ACM Symposium on Principles of Programming Languages, pp. 84\u201396 (1978)","key":"22_CR7","DOI":"10.1145\/512760.512770"},{"key":"22_CR8","series-title":"An Introduction to Computational Algebraic Geometry and Commutative Algebra","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2181-2","volume-title":"Ideals, Varieties, and Algorithms","author":"D. Cox","year":"1992","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, New York (1992)"},{"key":"22_CR9","volume-title":"Introduction to Lattices and Order","author":"B.A. Davey","year":"1990","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)"},{"key":"22_CR10","volume-title":"A Discipline of Programming","author":"E.W. Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Inc., Englewood Cliffs (1976)"},{"key":"22_CR11","volume-title":"An Introduction to Gr\u00f6bner Bases","author":"R. Fr\u00f6berg","year":"1997","unstructured":"Fr\u00f6berg, R.: An Introduction to Gr\u00f6bner Bases. John Wiley & Sons, Chichester (1997)"},{"issue":"1","key":"22_CR12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/TSE.1975.6312821","volume":"SE-1","author":"S.M. German","year":"1975","unstructured":"German, S.M., Wegbreit, B.: A synthesizer of inductive assertions. IEEE Transactions on Software Engineering\u00a0SE-1(1), 68\u201375 (1975)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"22_CR13","first-page":"169","volume-title":"Proceedings of the International Joint Conference on Theory and Practice of Software Development","author":"P. Granger","year":"1991","unstructured":"Granger, P.: Static analysis of linear congruence equalities among variables of a program. In: Abramsky, S., Maibaum, T.S.E. (eds.) Proceedings of the International Joint Conference on Theory and Practice of Software Development, pp. 169\u2013192. Springer, Heidelberg (1991)"},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/A:1008678014487","volume":"11","author":"N. Halbwachs","year":"1997","unstructured":"Halbwachs, N., Proy, Y.-E., Roumanoff, P.: Verification of real-time systems using linear relation analysis. Formal Methods in System Design\u00a011(2), 157\u2013185 (1997)","journal-title":"Formal Methods in System Design"},{"key":"22_CR15","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"},{"issue":"4","key":"22_CR16","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1145\/360032.360048","volume":"19","author":"S. Katz","year":"1976","unstructured":"Katz, S., Manna, Z.: Logical analysis of programs. Communications of the ACM\u00a019(4), 188\u2013206 (1976)","journal-title":"Communications of the ACM"},{"key":"22_CR17","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502388.001.0001","volume-title":"Linear Algebra","author":"R.W. Kaye","year":"1998","unstructured":"Kaye, R.W., Wilson, R.: Linear Algebra. Oxford University Press, Oxford (1998)"},{"key":"22_CR18","volume-title":"Mathematical Theory of Computation","author":"Z. Manna","year":"1974","unstructured":"Manna, Z.: Mathematical Theory of Computation. McGraw-Hill, New York (1974)"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-44978-7_8","volume-title":"Proceedings of the 2nd Symposium on Programs as Data Objects","author":"I. Mastroeni","year":"2001","unstructured":"Mastroeni, I.: Numerical power analysis. In: Proceedings of the 2nd Symposium on Programs as Data Objects, pp. 117\u2013137. Springer, Heidelberg (2001)"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"E.W. Mayr","year":"1982","unstructured":"Mayr, E.W., Meyer, A.R.: The complexity of the word problems for commutative semigroups and polynomial ideals. Adv. Math.\u00a046, 305\u2013329 (1982)","journal-title":"Adv. Math."},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF00264277","volume":"20","author":"A. Mili","year":"1983","unstructured":"Mili, A.: A relational approach to the design of deterministic programs. Acta Informatica\u00a020, 315\u2013328 (1983)","journal-title":"Acta Informatica"},{"issue":"1","key":"22_CR22","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/360569.360659","volume":"18","author":"H. Mills","year":"1975","unstructured":"Mills, H.: The new math of computer programming. Communications of the ACM\u00a018(1), 43\u201348 (1975)","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Precise interprocedural analysis through linear algebra. In: Jones, N.D., Leroy, X. (eds.) 31st ACM Symposium on Principles of Programming Languages, pp. 330\u2013341 (2004)","key":"22_CR23","DOI":"10.1145\/982962.964029"},{"doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Carbonell, E., Kapur, D.: Automatic generation of polynomial loop invariants for imperative programs. Technical Report TR-CS-2003-39, University of New Mexico (2003)","key":"22_CR24","DOI":"10.1145\/1005285.1005324"},{"doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Non-linear loop invariant generation using Gr\u00f6bner bases. In: Jones, N.D., Leroy, X. (eds.) 31st ACM Symposium on Principles of Programming Languages, pp. 318\u2013329 (2004)","key":"22_CR25","DOI":"10.1145\/982962.964028"},{"key":"22_CR26","volume-title":"Linear Algebra and Its Applications","author":"G. Strang","year":"1988","unstructured":"Strang, G.: Linear Algebra and Its Applications. Harcourt Brace Jovanovich, San Diego (1988)"},{"issue":"3","key":"22_CR27","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1109\/TSE.1975.6312852","volume":"SE-1","author":"B. Wegbreit","year":"1975","unstructured":"Wegbreit, B.: Property extraction in well-founded property sets. IEEE Transactions on Software Engineering\u00a0SE-1(3), 270\u2013285 (1975)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"1","key":"22_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0747-7171(08)80138-1","volume":"12","author":"C.K. Yap","year":"1991","unstructured":"Yap, C.K.: A new lower bound construction for the word problem for commutative Thue systems. Journal of Symbolic Computation\u00a012(1), 1\u201328 (1991)","journal-title":"Journal of Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27864-1_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T14:41:43Z","timestamp":1711809703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27864-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540227915","9783540278641"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27864-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}