{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:49Z","timestamp":1725664969709},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_43","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:18:57Z","timestamp":1330276737000},"page":"205-219","source":"Crossref","is-referenced-by-count":1,"title":["Inferring program specifications in polynomial-time"],"prefix":"10.1007","author":[{"given":"Robert","family":"Givan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"A. Aiken and E. Wimmers. Soft typing with conditional types. In ACM Symposium on Principles of Programming Languges, pages 163\u2013173, 1994.","DOI":"10.1145\/174675.177847"},{"key":"15_CR2","unstructured":"Alexander Aiken and Edward Wimmers. Type inference with set constraints. Research Report 8956, IBM, 1992."},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0304-3975(80)90069-9","volume":"10","author":"J. A. Brzozowski","year":"1980","unstructured":"J. A. Brzozowski and E. Leiss. On equations for regular languages, finite automata, and sequential networks. Theoretical Computer Science, 10:19\u201335, 1980.","journal-title":"Theoretical Computer Science"},{"key":"15_CR4","unstructured":"R. L. Constable et. al. Implementing Mathematics with the Nuprl Development system. Prentice-Hall, 1986."},{"key":"15_CR5","unstructured":"Robert Givan. Automatically Inferring Properties of Computer Programs. PhD thesis, Massachusetts Institute of Technology, 1996. http:\/\/www.ai.mit.edu-\/people\/rlg\/papers\/thesis.ps."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"P. Jouvelot and D. Gifford. Algebraic reconstruction of types and effects. In Proceedings of ACM Conference on Principles of Programming Languages, 1991.","DOI":"10.1145\/99583.99623"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"D. McAllester and K. Arkoudas. Walther recursion. Submitted to CADE-13, available at http:\/\/www.ai.mit.edu\/people\/dam\/termination.html, 1996.","DOI":"10.1007\/3-540-61511-3_119"},{"issue":"2","key":"15_CR8","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/151261.151264","volume":"40","author":"D. McAllester","year":"1993","unstructured":"D. McAllester and R. Givan. Taxonomic syntax for first order inference. JACM, 40(2):246\u2013283, April 1993. internet file ftp.ai.mit.edu:\/pub\/users\/dam\/jacml.ps.","journal-title":"JACM"},{"key":"15_CR9","unstructured":"J. McCarthy. A basis for a math. theory of computation. P. Braffort & D. Hirschberg, eds., Computer Programing & Formal Systems. North-Holland, 1967."},{"key":"15_CR10","first-page":"348","volume":"17","author":"R. Milner","year":"1978","unstructured":"Robin Milner. Type polymorphism in programming. JCSS, 17:348\u2013375, 1978.","journal-title":"JCSS"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"John C. Mitchell. A type inference appproach to reduction properties and semantics of polymorphic expressions. In Proceedings 1986 ACM Symposium on Lisp and Functional Programming, pages 308\u2013319, 1986.","DOI":"10.1145\/319838.319872"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"P. Mishra and U. S. Reddy. Declaration-free type checking. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 7\u201321. ACM, 1985.","DOI":"10.1145\/318593.318603"},{"key":"15_CR13","unstructured":"John C. Reynolds. Towards a theory of type structure. In Proceedings Colloque sur la Programmation. Springer-Verlag, 1974."},{"key":"15_CR14","unstructured":"J.W. Thatcher. Tree automata: an informal survey. In A. V. Aho, editor, Currents in Theory of Computation, pages 143\u2013172. Prentice-Hall, 1973."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In Handbook of Theoretical Computer Science, Volume B, Formal Methods and Semantics, pp. 133\u2013164. MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"}],"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_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:10:07Z","timestamp":1605629407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61739-6_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617396","9783540706748"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-61739-6_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}