{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T19:29:01Z","timestamp":1726428541325},"reference-count":36,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1051\/ita\/2011009","type":"journal-article","created":{"date-parts":[[2011,3,15]],"date-time":"2011-03-15T09:59:59Z","timestamp":1300183199000},"page":"3-33","source":"Crossref","is-referenced-by-count":8,"title":["Idealized coinductive type systems for imperative object-oriented programs"],"prefix":"10.1051","volume":"45","author":[{"given":"Davide","family":"Ancona","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Lagorio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,3,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-49538-X_2","volume":"952","author":"Agesen","year":"1995","journal-title":"Lecture Notes in Computer Science"},{"key":"R2","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/155183.155231","volume":"15","author":"Amadio","year":"1993","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"R3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/978-3-642-03013-0_2","volume":"5653","author":"Ancona","year":"2009","journal-title":"Lecture Notes in Computer Science"},{"key":"R4","doi-asserted-by":"crossref","first-page":"214","DOI":"10.4204\/EPTCS.25.20","volume":"25","author":"Ancona","year":"2010","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"D. Ancona and G. Lagorio, Complete coinductive subtyping for abstract compilation of object-oriented languages, inFormal Techniques for Java-like Programs (FTfJP10), ACM Digital Library (2010).","DOI":"10.1145\/1924520.1924521"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"D. Ancona, G. Lagorio and E. Zucca, Type inference for polymorphic methods in Java-like languages, inICTCS'07 \u2013 Italian Conf. on Theoretical Computer Science, edited by G.F. Italiano, E. Moggi and L. Laura, eProceedings. World Scientific (2007).","DOI":"10.1142\/9789812770998_0014"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"D. Ancona, G. Lagorio and E. Zucca, Type inference by coinductive logic programming, inPost-Proceedings of TYPES'08.Lecture Notes in Computer Science5497(2009).","DOI":"10.1007\/978-3-642-02444-3_1"},{"key":"R8","unstructured":"D. Ancona, A. Corradi, G. Lagorio and F. Damiani,Abstract compilation of object-oriented languages into coinductive CLP(X): when type inference meets verification. Technical report, Karlsruhe Institute of Technology (2010). Formal Verification of Object-Oriented Software. Papers presented at the International Conference, Paris, France (2010)."},{"key":"R9","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/11531142_19","volume":"3586","author":"Anderson","year":"2005","journal-title":"Lecture Notes in Computer Science"},{"key":"R10","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1006\/inco.1995.1086","volume":"119","author":"Barbanera","year":"1995","journal-title":"Inform. Comput."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"W.R. Cook, W.L. Hill and P.S. Canning, Inheritance is not subtyping, inACM Symp. on Principles of Programming Languages 1990. ACM Press (1990), 125\u2013135.","DOI":"10.1145\/96709.96721"},{"key":"R12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"Courcelle","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"P. Cousot, Types as abstract interpretations, inACM Symp. on Principles of Programming Languages(1997), 316\u2013331.","DOI":"10.1145\/263699.263744"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, inACM Symp. on Principles of Programming Languages 1977. ACM Press (1977), 238\u2013252.","DOI":"10.1145\/512950.512973"},{"key":"R15","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"Cytron","year":"1991","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"R16","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1145\/1065887.1065890","volume":"27","author":"Das","year":"2005","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"M. Furr, J. An, J.S. Foster and M. Hicks, Static type inference for Ruby, inSAC '09: Proceedings of the 2009 ACM symposium on Applied computing. ACM Press (2009).","DOI":"10.1145\/1529282.1529700"},{"key":"R18","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-642-14107-2_10","volume":"6183","author":"Heidegger","year":"2010","journal-title":"Lecture Notes in Computer Science"},{"key":"R19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.5381\/jot.2007.6.2.a3","volume":"6","author":"Igarashi","year":"2007","journal-title":"JOT"},{"key":"R20","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/503502.503505","volume":"23","author":"Igarashi","year":"2001","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"R21","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.ic.2007.12.004","volume":"207","author":"Leroy","year":"2009","journal-title":"Inform. Comput."},{"key":"R22","unstructured":"R. Min and G. Gupta, Coinductive logic programming and its application to boolean sat, inFLAIRS Conference(2009)."},{"key":"R23","doi-asserted-by":"crossref","unstructured":"R. Min and G. Gupta, Coinductive logic programming with negation, inLOPSTR(2009), 97\u2013112.","DOI":"10.1007\/978-3-642-12592-8_8"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"N. Oxh\u00f8j, J. Palsberg and M.I. Schwartzbach, Making type inference practical, inECOOP'92 \u2013 European Conference on Object-Oriented Programming(1992), 329\u2013349.","DOI":"10.1007\/BFb0053045"},{"key":"R25","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1002\/(SICI)1096-9942(199901\/03)5:1<35::AID-TAPO4>3.0.CO;2-4","volume":"5","author":"Odersky","year":"1999","journal-title":"Theory Pract. Obj. Syst."},{"key":"R26","doi-asserted-by":"crossref","unstructured":"J. Palsberg and M.I. Schwartzbach, Object-oriented type inference, inACM Symp. on Object-Oriented Programming: Systems, Languages and Applications 1991.ACM Press (1991), 146\u2013161.","DOI":"10.1145\/118014.117965"},{"key":"R27","unstructured":"J. Palsberg and M.I. Schwartzbach,Object-Oriented Type Systems. John Wiley & Sons (1994)."},{"key":"R28","doi-asserted-by":"crossref","unstructured":"J. Plevyak and A. Chien, Precise concrete type inference for object-oriented languages, inNinth Annual ACM Conference on Object-Oriented Programming Systems, Languages, and Applications. ACM Press (1994), 324\u2013340.","DOI":"10.1145\/191081.191130"},{"key":"R29","doi-asserted-by":"crossref","unstructured":"N. Saeedloei and G. Gupta, Verifying complex continuous real-time systems with coinductive CLP(R), inProc. of LATA 2010.Lecture Notes in Computer Science(2010).","DOI":"10.1007\/978-3-642-13089-2_45"},{"key":"R30","doi-asserted-by":"crossref","unstructured":"L. Simon, A. Mallya, A. Bansal and G. Gupta, Coinductive logic programming, inLogic Programming, 22nd International Conference, ICLP(2006), 330\u2013345.","DOI":"10.1007\/11799573_25"},{"key":"R31","doi-asserted-by":"crossref","unstructured":"L. Simon, A. Bansal, A. Mallya and G. Gupta, Co-logic programming: Extending logic programming with coinduction, inAutomata, Languages and Programming, 34th International Colloquium, ICALP(2007), 472\u2013483.","DOI":"10.1007\/978-3-540-73420-8_42"},{"key":"R32","unstructured":"J. Singer,Static Program Analysis based on Virtual Register Renaming, Ph.D. thesis, Computer Laboratory, University of Cambridge (2006)."},{"key":"R33","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1017\/S0956796807006569","volume":"18","author":"Sulzmann","year":"2008","journal-title":"J. Funct. Program."},{"key":"R34","doi-asserted-by":"crossref","unstructured":"T. Wang and S.F. Smith, Precise constraint-based type inference for Java, inECOOP'01 \u2013 European Conference on Object-Oriented Programming2072(2001) 99\u2013117.","DOI":"10.1007\/3-540-45337-7_6"},{"key":"R35","unstructured":"T. Wang and S. Smith,Polymorphic constraint-based type inference for objects.Technical report, The Johns Hopkins University (2008), submitted for publication."},{"key":"R36","doi-asserted-by":"crossref","unstructured":"T. Zhao, Type inference for scripting languages with implicit extension, inFOOL 2010 \u2013 Intl. Workshop on Foundations of Object-Oriented Languages(2010).","DOI":"10.1145\/2047849.2047855"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2011009\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T03:37:37Z","timestamp":1560051457000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2011009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1]]},"references-count":36,"journal-issue":{"issue":"1"},"alternative-id":["ita100051"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2011009","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"type":"print","value":"0988-3754"},{"type":"electronic","value":"1290-385X"}],"subject":[],"published":{"date-parts":[[2011,1]]}}}