Ponencia en Congreso:
Automated workarounds from Java Program specifications based on SAT solving

Vista sencilla de ítem
dc.contributor.authorUva, Marcelo
dc.contributor.authorPonzio, Pablo
dc.contributor.authorRegis, Germán
dc.contributor.authorAguirre, Nazareno
dc.contributor.authorFrías, Marcelo
dc.date.accessioned2020-09-28T18:49:14Z
dc.date.available2020-09-28T18:49:14Z
dc.date.issued2017
dc.description.abstract"The failures that bugs in software lead to can sometimes be bypassed by the so called workarounds: when a (faulty) routine fails, alternative routines that the system offers can be used in place of the failing one, to circumvent the failure. Previous works have exploited this workarounds notion to automatically recover from runtime failures in some application domains. However, existing approaches that compute workarounds automatically either require the user to manually build an abstract model of the software under consideration, or to provide equivalent sequences of operations from which workarounds are computed, diminishing the automation of workaround-based system recovery. In this paper, we present two techniques that automatically compute workarounds from Java code equipped with formal specifications, avoiding abstract software models and user provided equivalences. These techniques employ SAT solving to compute workarounds on concrete program state characterizations. The first employs SAT solving to compute traditional workarounds, while the second directly exploits SAT solving to circumvent a failing method, building a state that mimics the (correct) behaviour of this failing routine. Our experiments, based on case studies involving implementations of collections and a library for date arithmetic, enable us to show that the techniques can effectively compute workarounds from complex contracts in an important number of cases, in time that makes them feasible to be used for run time repairs."en
dc.identifier.issn1433-2787
dc.identifier.urihttp://ri.itba.edu.ar/handle/123456789/3066
dc.language.isoenes
dc.relationinfo:eu- repo/semantics/reference/doi.org/10.1007/s10009-018-0503-8
dc.subjectANALISIS DE FALLASes
dc.subjectSOFTWAREen
dc.subjectESPECIFICACIONESes
dc.subjectJAVAen
dc.subjectDEPURACION DE PROGRAMASes
dc.subjectLENGUAJES DE PROGRAMACIONes
dc.titleAutomated workarounds from Java Program specifications based on SAT solvingen
dc.typePonencias en Congresoses
dc.typeinfo:eu-repo/semantics/publishedVersion
dspace.entity.typePonencia en Congreso
itba.description.filiationFil: Uva, Marcelo. Universidad Nacional de Río Cuarto; Argentina.
itba.description.filiationFil: Ponzio, Pablo. Universidad Nacional de Río Cuarto; Argentina.
itba.description.filiationFil: Ponzio, Pablo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina.
itba.description.filiationFil: Regis, Germán. Universidad Nacional de Río Cuarto; Argentina.
itba.description.filiationFil: Aguirre, Nazareno. Universidad Nacional de Río Cuarto; Argentina.
itba.description.filiationFil: Aguirre, Nazareno. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina.
itba.description.filiationFil: Frías, Marcelo. Instituto Tecnológico de Buenos Aires; Argentina.
itba.description.filiationFil: Frías, Marcelo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina.

Archivos

Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
Uva_2017_ING_INFORMATICA_PONENCIA.pdf
Tamaño:
1.26 MB
Formato:
Adobe Portable Document Format
Descripción:
Ponencia_Uva
Descargar
Bloque de licencias
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
license.txt
Tamaño:
1.6 KB
Formato:
Item-specific license agreed upon to submission
Descripción:
Descargar

Colecciones

Ingeniería Informática