Busque entre los 169459 recursos disponibles en el repositorio
Mostrar el registro sencillo del ítem
dc.date.accessioned | 2022-08-11T16:33:05Z | |
dc.date.available | 2022-08-11T16:33:05Z | |
dc.date.issued | 2021 | |
dc.identifier.uri | http://sedici.unlp.edu.ar/handle/10915/140426 | |
dc.description.abstract | The rising popularity of declarative languages and the hard to debug nature thereof have motivated the need for applicable, automated repair techniques for such languages. However, despite significant advances in program repair for imperative languages, there is a dearth of repair techniques for declarative languages. We present BeAFix, an automated repair technique for faulty models written in Alloy, a first-order relational logic language. BeAFix has a number of distinguishing features. Firstly, it supports any kind of oracle, including assertions typically found in formal specifications, as well as “specification tests”. This is important since unit tests, widely available for programs, are not typically found in formal specifications. Secondly, given a defined set of mutation operations, a set of suspicious expressions and a maximum number of mutations to apply per expression, BeAFix's bounded-exhaustive approach will either find a fix, or guarantee that such a fix is not possible, within the provided bounds. With respect to fault localization, BeAFix is not tightly integrated to any specific technique. In fact, our technique is independent of the fault localization technique used, and the fault localization is run only once before the repair process begins. To support a bounded-exhaustive approach while keeping repair times reasonable, sound state pruning techniques (i.e., those that guarantee that no valid fixes are removed) are introduced. When a faulty model has more than one suspicious expression, we use both syntactic analysis and dynamically generated scenario-based assertions to check the feasibility of a particular repair candidate. A failing check will determine that this candidate would never lead to a fully repaired model, allowing BeAFix to prune significant parts of the search space. We evaluated our technique on two Alloy benchmarks, including one previously used in a state-of-the-art technique for Alloy repair. The results show that BeAFix is able to repair thousands of real-world faulty models, corroborating its ability to effectively, and efficiently generate correct repairs while also being less prone to overfitting than previous techniques. | en |
dc.format.extent | 81-81 | es |
dc.language | en | es |
dc.subject | Metals | es |
dc.subject | Maintenance engineering | es |
dc.subject | Tools | es |
dc.subject | Syntactics | es |
dc.subject | Software | es |
dc.subject | Space exploration | es |
dc.subject | Task analysis | es |
dc.title | Bounded Exhaustive Search of Alloy Specification Repairs | en |
dc.type | Objeto de conferencia | es |
sedici.identifier.uri | http://50jaiio.sadio.org.ar/pdfs/asse/ASSE-09.pdf | es |
sedici.identifier.issn | 2451-7593 | es |
sedici.creator.person | Gutiérrez Brida, Simón | es |
sedici.creator.person | Regis, Germán | es |
sedici.creator.person | Zheng, Guolong | es |
sedici.creator.person | Bagheri, Hamid | es |
sedici.creator.person | Nguyen, ThanhVu | es |
sedici.creator.person | Aguirre, Nazareno Matías | es |
sedici.creator.person | Frias, Marcelo F. | es |
sedici.subject.materias | Ciencias Informáticas | es |
sedici.description.fulltext | true | es |
mods.originInfo.place | Sociedad Argentina de Informática e Investigación Operativa | es |
sedici.subtype | Resumen | es |
sedici.rights.license | Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) | |
sedici.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | |
sedici.date.exposure | 2021-10 | |
sedici.relation.event | XXII Simposio Argentino de Ingeniería de Software (ASSE 2021) - JAIIO 50 (Modalidad virtual) | es |
sedici.description.peerReview | peer-review | es |
sedici.relation.isRelatedWith | https://ieeexplore.ieee.org/document/9402059 | es |