{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:04Z","timestamp":1725664984178},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617396"},{"type":"electronic","value":"9783540706748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61739-6_41","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:18:43Z","timestamp":1330294723000},"page":"174-188","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of the equality relations for the program terms"],"prefix":"10.1007","author":[{"given":"P. G.","family":"Emelianov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"13_CR1","volume-title":"The theory of parsing, translation and compilation. Vol.1","author":"A. Aho","year":"1972","unstructured":"A.Aho, J.Ullman. The theory of parsing, translation and compilation. Vol.1-Prentice-Hall Inc., Englewood Cliffs, NJ, 1972."},{"key":"13_CR2","first-page":"1","volume-title":"Detecting equality of variables in programs","author":"B. Alpern","year":"1988","unstructured":"B.Alpern, M.N.Wegman, F.K.Zadeck. Detecting equality of variables in programs.-Proc. of the 15\nth Annual ACM Symposium Principles of Programming Languages, San Diego, USA, 1988. CA. ACM Press, New York, USA, pages 1\u201311, 1988."},{"key":"13_CR3","first-page":"129","volume-title":"LNCS 735","author":"F. Bourdoncle","year":"1993","unstructured":"F.Bourdoncle. Efficient chaotic iteration strategies with widenings.-Proc. of the International Conference Formal Methods in Programming and Their Applications, Novosibirsk, Russia, 1993. LNCS 735, Springer-Verlag, Berlin, Germany, pages 129\u2013141, 1993."},{"key":"13_CR4","first-page":"240","volume-title":"LNAI 592","author":"M. Bruynooghe","year":"1992","unstructured":"M.Bruynooghe, G.Janssens. On abstracting the procedural behaviour of logic program.-Proc. of the First and Second Russian Conferences on Logic Programming, Irkutsk (1990) and St.Petersburg (1991), Russia. LNAI 592, Springer-Verlag, Berlin, Germany, pages 240\u2013262, 1992."},{"issue":"2","key":"13_CR5","first-page":"179","volume":"16","author":"A. Cortesi","year":"1995","unstructured":"A.Cortesi,B.Le Charlier,P.Van Hentenryck. Type analysis of Prolog using type graphs.-Journal of Logic Programming, 16(2), pages 179\u2013209, 1995.","journal-title":"Journal of Logic Programming"},{"key":"13_CR6","first-page":"238","volume-title":"Abstract interpretation: a unified lattice model for static analysis of programs by construction of approximation of fixpoints","author":"P. Cousot","year":"1977","unstructured":"P.Cousot, R.Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction of approximation of fixpoints.-Proc. of the 4\nth Annual ACM Symposium Principles of Programming Languages, Los-Angeles, USA, 1977. CA. ACM Press, New York, USA, pages 238\u2013252, 1977."},{"key":"13_CR7","first-page":"269","volume-title":"Systematic design of program analysis frameworks","author":"P. Cousot","year":"1979","unstructured":"Cousot P., Cousot R. Systematic design of program analysis frameworks.-Rec. of the 6\nth ACM Symposium on Principles of Programming Languages, San Antonio, USA, 1979. TX. ACM Press, New York, USA, pages 269\u2013282, 1979."},{"issue":"4","key":"13_CR8","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"P.Cousot, R.Cousot. Abstract interpretation frameworks.-Journal of Logic and Computation, 2(4), pages 511\u2013547, 1992.","journal-title":"Journal of Logic and Computation"},{"key":"13_CR9","first-page":"269","volume-title":"LNCS 631","author":"P. Cousot","year":"1992","unstructured":"P.Cousot, R.Cousot. Comparing the Galois connection and widening\/narrowing approaches to abstract interpretation, invited paper.-Proc. of the 5\nth International Symposium Programming Language Implementation and Logic Programming, Leuven, Belgium, 1992. LNCS 631, Springer-Verlag, Berlin, Germany, pages 269\u2013295, 1992."},{"key":"13_CR10","first-page":"170","volume-title":"Rec. of the Functional Programming Languages and Computer Architecture SIGPLAN-SIGARCH-WG 2.8, La Jolla, USA, 1995","author":"P. Cousot","year":"1995","unstructured":"P.Cousot, R.Cousot. Formal languages, grammar and set-constraint-based program analysis by abstract interpretation.-Rec. of the Functional Programming Languages and Computer Architecture SIGPLAN-SIGARCH-WG 2.8, La Jolla, USA, 1995. CA. ACM Press, New York, USA, pages 170\u2013181, 1995."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"A.Deutsch. A storeless model of aliasing and its abstraction using finite representation of right-regular equivalence relations.-Proc. of the IEEE International Conference on Compiler Languages, pages 2\u201313, 1992.","DOI":"10.1109\/ICCL.1992.185463"},{"issue":"6","key":"13_CR12","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/773473.178263","volume":"29","author":"A. Deutsch","year":"1994","unstructured":"A.Deutsch. Interprocedural may-alias analysis for pointers: beyond k-limiting.-Proc. of the ACM SIGPLAN'94 Conference on Program Language Design and Implementation, SIGPLAN Notices, 29(6), pages 230\u2013241, 1994.","journal-title":"SIGPLAN Notices"},{"issue":"6","key":"13_CR13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0020-0190(93)90079-O","volume":"47","author":"P. Eades","year":"1993","unstructured":"P.Eades, X.Lin, W.F.Smyth. A fast and effective heuristic for the feedback arc set problem.-Information Processing Letters, 47(6), pages 319\u2013323, 1993.","journal-title":"Information Processing Letters"},{"key":"13_CR14","unstructured":"P.Emelianov, V.Sabelfeld. Analyzer of semantic properties of Modula-programs.-Software intellectualization and quality, Novosibirsk, Russia, pages 13\u201321, 1994, in russian."},{"key":"13_CR15","volume-title":"Computers and intractability. A guide to the theory of {ie188-01}-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R.Garey, D.S.Johnson. Computers and intractability. A guide to the theory of {ie188-01}-completeness.-W.H.Freeman and company, New York, USA, 1979."},{"key":"13_CR16","first-page":"103","volume-title":"Abstract Interpretation of Declarative Languages","author":"N.D. Jones","year":"1987","unstructured":"N.D.Jones. Flow analysis of lazy higher-order functional programs.-In Abstract Interpretation of Declarative Languages, (Eds.: S.Abramsky and C.Hankin), Ellis Horwood, Chichester, UK, pages 103\u2013122, 1987."},{"key":"13_CR17","volume-title":"Ph.D. Thesis","author":"N. Heintze","year":"1992","unstructured":"N.Heintze. Set based program analysis.-Ph.D. Thesis, School of Computer Sciences, Carnegie Mellon University, Pittsburg, USA, 1992."},{"key":"13_CR18","first-page":"142","volume-title":"LNCS 735","author":"F. Masdupuy","year":"1993","unstructured":"F.Masdupuy. Semantic analysis of interval congruences.-Proc. of the International Conference Formal Methods in Programming and Their Applications, Novosibirsk, Russia, 1993. LNCS 735, Springer-Verlag, Berlin, Germany, pages 142\u2013155, 1993."},{"issue":"2","key":"13_CR19","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1145\/322186.322198","volume":"27","author":"G. Nelson","year":"1980","unstructured":"G.Nelson, D.C.Oppen. Fast decision procedures based on congruence closure.-Journal of the ACM, 27(2), pages 356\u2013364, 1980.","journal-title":"Journal of the ACM"},{"issue":"2","key":"13_CR20","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/S0020-0190(80)90074-5","volume":"10","author":"V. Sabelfeld","year":"1980","unstructured":"V.Sabelfeld. The logic-termal equivalence is polynomial-time decidable.-Information Processing Letters, 10(2), pages 102\u2013112, 1980.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61739-6_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:36:13Z","timestamp":1619573773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61739-6_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617396","9783540706748"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-61739-6_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}