{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:15:05Z","timestamp":1725560105713},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221746"},{"type":"electronic","value":"9783540259381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25938-1_6","type":"book-chapter","created":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T08:45:52Z","timestamp":1280047552000},"page":"59-74","source":"Crossref","is-referenced-by-count":3,"title":["Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables"],"prefix":"10.1007","author":[{"given":"Rudolf","family":"Berghammer","sequence":"first","affiliation":[]},{"given":"Markus","family":"M\u00fcller-Olm","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4376-0","volume-title":"Verification of sequential and concurrent programs","author":"K.R. Apt","year":"1991","unstructured":"Apt, K.R., Olderog, E.-R.: Verification of sequential and concurrent programs. Springer, Heidelberg (1991)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0167-6423(03)00011-X","volume":"48","author":"R. Berghammer","year":"2003","unstructured":"Berghammer, R., Reuter, F.: A linear approximation algorithm for bin packing with absolute approximation factor \n                    \n                      \n                    \n                    $\\frac{3} {2}$\n                  . Science of Computer Programming\u00a048, 67\u201380 (2003)","journal-title":"Science of Computer Programming"},{"key":"6_CR3","volume-title":"Introduction to algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press, Cambridge (1990)"},{"key":"6_CR4","unstructured":"Coffmann Jr., E.G., Garay, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survery. In: Hochbaum, D.S. (ed.) Approximation algorithms for NP hard problems, pp. 46\u201393. PWS Publishers (1996)"},{"key":"6_CR5","first-page":"841","volume-title":"Handbook of Theoretical Computer Science","author":"P. Cousot","year":"1990","unstructured":"Cousot, P.: Methods and logics for proving programs. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 841\u2013993. Elsevier, Amsterdam (1990)"},{"key":"6_CR6","volume-title":"A discipline of programming","author":"E.W. Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A discipline of programming. Prentice-Hall, Englewood Cliffs (1976)"},{"key":"6_CR7","first-page":"19","volume-title":"Proc. Symp. on Applied Mathematics 19","author":"R.W. Floyd","year":"1967","unstructured":"Floyd, R.W.: Assigning meanings to programs. In: Schwartz, J.T. (ed.) Proc. Symp. on Applied Mathematics 19, pp. 19\u201332. American Mathematical Society, Providence (1967)"},{"key":"6_CR8","volume-title":"Program Verification","author":"N. Francez","year":"1992","unstructured":"Francez, N.: Program Verification. Addison-Wesley, Reading (1992)"},{"key":"6_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5983-1","volume-title":"The science of computer programming","author":"D. Gries","year":"1981","unstructured":"Gries, D.: The science of computer programming. Springer, Heidelberg (1981)"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis of computer programming. Comm. ACM\u00a012, 576\u2013583 (1969)","journal-title":"Comm. ACM"},{"key":"6_CR11","unstructured":"Hochbaum D.S. (ed.): Approximation algorithms for NP-hard problems. PWS Publishers (1996)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/BF01213604","volume":"6A","author":"J. Hooman","year":"1994","unstructured":"Hooman, J.: Extending Hoare Logic to Real-Time. Formal Aspects of Computing\u00a06A, 801\u2013825 (1994)","journal-title":"Formal Aspects of Computing"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s001650050057","volume":"11","author":"T. Kleymann","year":"1999","unstructured":"Kleymann, T.: Hoare logic and auxiliary variables. Formal Aspects of Computing\u00a011, 541\u2013566 (1999)","journal-title":"Formal Aspects of Computing"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0020-0190(88)90227-X","volume":"29","author":"C. Morgan","year":"1988","unstructured":"Morgan, C.: Auxiliary variables in data refinement. Information Processing Letters\u00a029, 293\u2013296 (1988)","journal-title":"Information Processing Letters"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0027453","volume-title":"Modular Compiler Verification","author":"M. M\u00fcller-Olm","year":"1997","unstructured":"M\u00fcller-Olm, M.: Modular Compiler Verification. In: M\u00fcller-Olm, M. (ed.) Modular Compiler Verification. LNCS, vol.\u00a01283, Springer, Heidelberg (1997)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0167-6423(87)90029-3","volume":"9","author":"H.R. Nielson","year":"1987","unstructured":"Nielson, H.R.: A Hoare-like Proof System for Run-time Analysis of Programs. Science of Computer Programming\u00a09, 107\u2013136 (1987)","journal-title":"Science of Computer Programming"},{"key":"6_CR17","unstructured":"Reuter, F.: On the formal specification and derivation of approximation algorithms using assertions. Diploma thesis, Inst. f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel (2000) (in German)"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D. Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst-case results for the bin packing problem. Naval Research Logistics\u00a041, 479\u2013485 (1994)","journal-title":"Naval Research Logistics"},{"key":"6_CR19","first-page":"11217","volume":"81-","author":"V.K. Wei","year":"1981","unstructured":"Wei, V.K.: A lower bound for the stability number of a simple graph. Bell Lab. Tech. Memor. 81-11217-9 (1981)","journal-title":"Bell Lab. Tech. Memor."}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25938-1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:58:57Z","timestamp":1605743937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25938-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221746","9783540259381"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25938-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}