artículo de publicación periódica.page.titleprefix Automated workarounds from Java program specifications based on SAT solving
| dc.contributor.author | Uva, Marcelo | |
| dc.contributor.author | Ponzio, Pablo | |
| dc.contributor.author | Regis, Germán | |
| dc.contributor.author | Aguirre, Nazareno | |
| dc.contributor.author | Frías, Marcelo | |
| dc.date.accessioned | 2019-07-11T14:35:28Z | |
| dc.date.available | 2019-07-11T14:35:28Z | |
| dc.date.issued | 2018-11 | |
| 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. Existing approaches to workaround-based system recovery consider workarounds that are produced from equivalent method sequences, utomatically computed from user-provided abstract models, or directly produced from user-provided equivalent sequences of operations. In this paper, we present two techniques for computing workarounds from Java code equipped with formal specifications, that improve previous approaches in two respects. First, the particular state where the failure originated is actively involved in computing workarounds, thus leading to repairs that are more state specific. Second, our techniques automatically compute workarounds on concrete program state characterizations, avoiding abstract software models and user-provided equivalences. The first technique uses SAT solving to compute a sequence of methods that is equivalent to a failing method on a specific failing state, but which can also be generalized to schemas for workaround reuse. The second technique directly exploits SAT to circumvent a failing method, building a state that mimics the (correct) behaviour of a failing routine, from a specific program state too. We perform an experimental evaluation based on case studies involving implementations of collections and a library for date arithmetic, showing 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. Our results also show that our state-specific workarounds enable us to produce repairs in many cases where previous workaround-based approaches are inapplicable." | en |
| dc.identifier.issn | 1433-2779 | |
| dc.identifier.uri | http://ri.itba.edu.ar/handle/123456789/1642 | |
| dc.language.iso | en | en |
| dc.relation | info:eu-repo/semantics/altIdentifier/doi/10.1007/s10009-018-0503-8 | |
| dc.subject | ANALISIS DE FALLAS | es |
| dc.subject | SOFTWARE | en |
| dc.subject | ESPECIFICACIONES | es |
| dc.subject | JAVA | en |
| dc.subject | DEPURACION DE PROGRAMAS | es |
| dc.subject | LENGUAJES DE PROGRAMACION | es |
| dc.title | Automated workarounds from Java program specifications based on SAT solving | en |
| dc.type | Artículos de Publicaciones Periódicas | es |
| dc.type | info:eu-repo/semantics/acceptedVersion | |
| dspace.entity.type | Artículo de Publicación Periódica | |
| itba.description.filiation | Fil: Uva, Marcelo. Universidad Nacional de Río Cuarto; Argentina. | |
| itba.description.filiation | Fil: Ponzio, Pablo. Universidad Nacional de Río Cuarto; Argentina. | |
| itba.description.filiation | Fil: Ponzio, Pablo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. | |
| itba.description.filiation | Fil: Regis, Germán. Universidad Nacional de Río Cuarto; Argentina. | |
| itba.description.filiation | Fil: Aguirre, Nazareno. Universidad Nacional de Río Cuarto; Argentina. | |
| itba.description.filiation | Fil: Aguirre, Nazareno. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. | |
| itba.description.filiation | Fil: Frías, Marcelo. Instituto Tecnológico de Buenos Aires; Argentina. | |
| itba.description.filiation | Fil: Frías, Marcelo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. |