- -

Precise explanation of success typing errors

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Precise explanation of success typing errors

Show simple item record

Files in this item

dc.contributor.author Sagonas, Konstantinos es_ES
dc.contributor.author Silva Galiana, Josep Francesc es_ES
dc.contributor.author Tamarit Muñoz, Salvador es_ES
dc.date.accessioned 2015-10-06T07:08:11Z
dc.date.available 2015-10-06T07:08:11Z
dc.date.issued 2013-01-21
dc.identifier.isbn 978-1-4503-1842-6
dc.identifier.uri http://hdl.handle.net/10251/55605
dc.description.abstract Nowadays, many dynamic languages come with (some sort of) type inference in order to detect type errors statically. Often, in order not to unnecessarily reject programs which are allowed under a dynamic type discipline, their type inference algorithms are based on non-standard (i.e., not unification based) type inference algorithms. Instead, they employ aggressive forwards and backwards propagation of subtype constraints. Although such analyses are effective in locating actual programming errors, the errors they report are often extremely difficult for programmers to follow and convince themselves of their validity. We have observed this phenomenon in the context of Erlang: for a number of years now its implementation comes with a static analysis tool called Dialyzer which, among other software discrepancies, detects definite type errors (i.e., code points that will result in a runtime error if executed) by inferring success typings. In this work, we extend the analysis that infers success typings, with infrastructure that maintains additional information that can be used to provide precise (i.e., minimal) explanations about the cause of a discrepancy reported by Dialyzer using program slicing. We have implemented the techniques we describe in a publicly available development branch of Dialyzer es_ES
dc.language Inglés es_ES
dc.publisher Association for Computing Machinery (ACM) es_ES
dc.relation.ispartof Proceeding PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Studies of Program Constructs es_ES
dc.subject Algorithms es_ES
dc.subject Languages es_ES
dc.subject Theory es_ES
dc.subject Type inference es_ES
dc.subject Program slicing es_ES
dc.subject Erlang es_ES
dc.subject.classification LENGUAJES Y SISTEMAS INFORMATICOS es_ES
dc.title Precise explanation of success typing errors es_ES
dc.type Capítulo de libro es_ES
dc.identifier.doi 10.1145/2426890.2426897
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Área de Sistemas de Información y Comunicaciones - Àrea de Sistemes d'Informació i Comunicacions es_ES
dc.description.bibliographicCitation Sagonas, K.; Silva Galiana, JF.; Tamarit Muñoz, S. (2013). Precise explanation of success typing errors. En Proceeding PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation. Association for Computing Machinery (ACM). 33-42. doi:10.1145/2426890.2426897 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1145/2426890.2426897 es_ES
dc.description.upvformatpinicio 33 es_ES
dc.description.upvformatpfin 42 es_ES
dc.relation.senia 249214 es_ES


This item appears in the following Collection(s)

Show simple item record