{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:42:01Z","timestamp":1775868121737,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540749141","type":"print"},{"value":"9783540749158","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_6","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"23-40","source":"Crossref","is-referenced-by-count":21,"title":["Precise Relational Invariants Through Strategy Iteration"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Gawlitza","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"GNU Linear Programming Kit, http:\/\/www.gnu.org\/software\/glpk"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/978-3-540-39866-0_38","volume-title":"Perspectives of System Informatics","author":"H. Bjorklund","year":"2004","unstructured":"Bjorklund, H., Sandberg, S., Vorobyov, S.: Complexity of Model Checking by Iterative Improvement: the Pseudo-Boolean Framework. In: Broy, M., Zamulin, A.V. (eds.) PSI 2003. LNCS, vol.\u00a02890, pp. 381\u2013394. Springer, Heidelberg (2004)"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1080\/026811199281967","volume":"14","author":"J. Cochet-Terrasson","year":"1999","unstructured":"Cochet-Terrasson, J., Gaubert, S., Gunawardena, J.: A Constructive Fixed Point Theorem for Min-Max Functions. Dynamics and Stability of Systems\u00a014(4), 407\u2013433 (1999)","journal-title":"Dynamics and Stability of Systems"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/11513988_46","volume-title":"Computer Aided Verification","author":"A. Costan","year":"2005","unstructured":"Costan, A., Gaubert, S., Goubault, E., Martel, M., Putot, S.: A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 462\u2013475. Springer, Heidelberg (2005)"},{"key":"6_CR5","first-page":"237","volume-title":"IFIP Conf. on Formal Description of Programming Concepts","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Static Determination of Dynamic Properties of Recursive Procedures. In: Neuhold, E.J. (ed.) IFIP Conf. on Formal Description of Programming Concepts, pp. 237\u2013277. North-Holland, Amsterdam (1977)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic Design of Program Analysis Frameworks. In: 6th ACM Symp. on Principles of Programming Languages (POPL), pp. 238\u2013352 (1979)","DOI":"10.1145\/567752.567778"},{"key":"6_CR7","unstructured":"Cousot, P., Cousot, R.: Static Determination of Dynamic Properties of Programs. In: Second Int. Symp. on Programming, Dunod, Paris, France, pp. 106\u2013130 (1976)"},{"key":"6_CR8","unstructured":"Cousot, P., Cousot, R.: Comparison of the Galois Connection and Widening\/Narrowing Approaches to Abstract Interpretation. In: JTASPEFL 1991, Bordeaux. BIGRE, vol.\u00a074, pp. 107\u2013110 (1991)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Ern\u00e9, M., Koslowski, J., Melton, A., Strecker, G.E.: A Primer On Galois Connections (1992)","DOI":"10.1111\/j.1749-6632.1993.tb52513.x"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/978-3-540-71316-6_17","volume-title":"ESOP 2007","author":"S. Gaubert","year":"2007","unstructured":"Gaubert, S., Goubault, E., Taly, A., Zennou, S.: Static Analysis by Policy Iteration on Relational Domains. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 237\u2013252. Springer, Heidelberg (2007)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/978-3-540-71316-6_21","volume-title":"ESOP 2007","author":"T. Gawlitza","year":"2007","unstructured":"Gawlitza, T., Seidl, H.: Precise Fixpoint Computation Through Strategy Iteration. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 300\u2013315. Springer, Heidelberg (2007)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1287\/mnsc.12.5.359","volume":"12","author":"A.J. Hoffman","year":"1966","unstructured":"Hoffman, A.J., Karp, R.M.: On Nonterminating Stochastic Games. Management Sci.\u00a012, 359\u2013370 (1966)","journal-title":"Management Sci."},{"key":"6_CR13","volume-title":"Dynamic Programming and Markov Processes","author":"R. Howard","year":"1960","unstructured":"Howard, R.: Dynamic Programming and Markov Processes. Wiley, New York (1960)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Megiddo, N.: On the Complexity of Linear Programming. In: Bewley, T. (ed.). Advances in Economic Theory: 5th World Congress, pp. 225\u2013268. Cambridge University Press, Cambridge (1987)","DOI":"10.1017\/CCOL0521340446.006"},{"key":"6_CR15","first-page":"310","volume-title":"IEEE Working Conf. on Reverse Engineering","author":"A. Min\u00e9","year":"2001","unstructured":"Min\u00e9, A.: The Octagon Abstract Domain in Analysis, Slicing and Transformation. In: IEEE Working Conf. on Reverse Engineering, pp. 310\u2013319. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-44978-7_10","volume-title":"Programs as Data Objects","author":"A. Min\u00e9","year":"2001","unstructured":"Min\u00e9, A.: A new numerical abstract domain based on difference-bound matrices. In: Danvy, O., Filinski, A. (eds.) PADO 2001. LNCS, vol.\u00a02053, pp. 155\u2013172. Springer, Heidelberg (2001)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Precise Interprocedural Analysis through Linear Algebra. In: 31st ACM Symp. on Principles of Programming Languages (POPL), pp. 330\u2013341 (2004)","DOI":"10.1145\/982962.964029"},{"key":"6_CR18","unstructured":"Puri, A.: Theory of Hybrid and Discrete Systems. PhD thesis, University of California, Berkeley (1995)"},{"key":"6_CR19","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"M.L. Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York (1994)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-540-30579-8_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S. Sankaranarayanan","year":"2005","unstructured":"Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Scalable analysis of linear systems using mathematical programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol.\u00a03385, pp. 25\u201341. Springer, Heidelberg (2005)"},{"key":"6_CR21","volume-title":"Theory of linear and integer programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons, New York, NY, USA (1986)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/10722167_18","volume-title":"Computer Aided Verification","author":"J. V\u00f6ge","year":"2000","unstructured":"V\u00f6ge, J., Jurdzinski, M.: A Discrete Strategy Improvement Algorithm for Solving Parity Games. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 202\u2013215. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:45:58Z","timestamp":1619520358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}