{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:48:57Z","timestamp":1778298537313,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540420682","type":"print"},{"value":"9783540449782","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44978-7_7","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:46:22Z","timestamp":1184600782000},"page":"103-116","source":"Crossref","is-referenced-by-count":8,"title":["Combining Forward And Backward Analyses of Temporal Properties"],"prefix":"10.1007","author":[{"given":"Damien","family":"Mass\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,4,25]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 100\u2013109. IEEE Computer Society Press, 1997.","DOI":"10.1109\/SFCS.1997.646098"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"F. Bourdoncle. Abstract debugging of higher-order imperative languages. In Proceedings of SIGPLAN\u2019 93 Conference on Programming Language Design and Implementation, pages 46\u201355, 1993.","DOI":"10.1145\/155090.155095"},{"key":"7_CR3","unstructured":"E.M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. MIT press, 1999."},{"key":"7_CR4","unstructured":"P. Cousot. M\u00e9thodes it\u00e9ratives de construction et d\u2019approximation de point fixes d\u2019op\u00e9rateurs monotones sur un treillis, analyse s\u00e9mantique des programmes. Th\u00e8se \u00e8s sciences math\u00e9matiques, University of Grenoble, March 1978."},{"key":"7_CR5","first-page":"303","volume-title":"Program Flow Analysis: Theory and Applications","author":"P. Cousot","year":"1981","unstructured":"P. Cousot. Semantic foundations of program analysis. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 10, pages 303\u2013342. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1981."},{"key":"7_CR6","unstructured":"P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In Proceedings of the Second International Symposium on Programming, pages 106\u2013130. Dunod, Paris, France, 1976."},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1145\/512950.512973","volume-title":"Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"P. Cousot","year":"1977","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 238\u2013252, Los Angeles, California, 1977. ACM Press, New York, NY."},{"issue":"1","key":"7_CR8","doi-asserted-by":"crossref","first-page":"43","DOI":"10.2140\/pjm.1979.82.43","volume":"82","author":"P. Cousot","year":"1979","unstructured":"P. Cousot and R. Cousot. Constructive versions of Tarski\u2019s fixed point theorems. Pacific Journal of Mathematics, 82(1):43\u201357, 1979.","journal-title":"Pacific Journal of Mathematics"},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1145\/567752.567778","volume-title":"Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"P. Cousot","year":"1979","unstructured":"P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 269\u2013282, San Antonio, Texas, 1979. ACM Press, New York, NY."},{"key":"7_CR10","first-page":"12","volume-title":"Conference Record of the Twentyseventh Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"P. Cousot","year":"2000","unstructured":"P. Cousot and R. Cousot. Temporal abstract interpretation. In Conference Record of the Twentyseventh Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 12\u201325, Boston, Mass., 2000. ACM Press, New York, NY."},{"key":"7_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-56287-7_95","volume-title":"Foundations of Software Technology and Theoretical Computer Science, 12th conference, New Dehli, India","author":"P. Granger","year":"1992","unstructured":"P. Granger. Improving the results of static analyses of programs by local decreasing iterations. In R. K. Shyamasundar, editor, Foundations of Software Technology and Theoretical Computer Science, 12th conference, New Dehli, India, volume 652 of Lecture Notes in Computer Science, pages 68\u201379. Springer-Verlag, 1992."},{"key":"7_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BFb0028745","volume-title":"CAV 98: Computeraided Verification","author":"T.A. Henzinger","year":"1998","unstructured":"T.A. Henzinger, O. Kupferman, and S. Qadeer. From prehistoric to postmodern symbolic model checking. In A.J. Hu and M.Y. Vardi, editors, CAV 98: Computeraided Verification, volume 1427 of Lecture Notes in Computer Science, pages 195\u2013206. Springer-Verlag, 1998."},{"key":"7_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-540-45099-3_12","volume-title":"SAS 00: Static Analysis","author":"T.A. Henzinger","year":"2000","unstructured":"T.A. Henzinger, R. Majumdar, F.Y.C. Mang, and J.-F. Raskin. Abstract interpretation of game properties. In J. Palsberg, editor, SAS 00: Static Analysis, volume 1824 of Lecture Notes in Computer Science, pages 220\u2013239. Springer-Verlag, 2000."}],"container-title":["Lecture Notes in Computer Science","Programs as Data Objects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44978-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T00:17:17Z","timestamp":1550449037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44978-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540420682","9783540449782"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44978-7_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}