Achieving Abstract Machine Reachability with Learning-Based Model Fulfilment
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cai, Cheong hao | - |
dc.contributor.author | Sun, Jing sun | - |
dc.contributor.author | Dobbie, Gillian | - |
dc.contributor.author | Lee, Scott Uk jin | - |
dc.date.accessioned | 2021-06-22T11:02:21Z | - |
dc.date.available | 2021-06-22T11:02:21Z | - |
dc.date.issued | 2019-12 | - |
dc.identifier.issn | 1530-1362 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/4622 | - |
dc.description.abstract | This paper proposes a probabilistic reachability repair solution that enables abstract machines to automatically evolve and satisfy desired requirements. The solution is a combination of the B-method, machine learning and program synthesis. The B-method is used to formally specify an abstract machine and analyse the reachability of the abstract machine. Machine learning models are used to approximate features hidden in the semantics of the abstract machine. When the abstract machine fails to reach a desired state, the machine learning models are used to discover missing transitions to the state. Inserting the discovered transitions into the original abstract machine will lead to a repaired abstract machine that is capable of achieving the state. To obtain the repaired abstract machine, a set of insertion repairs are synthesised from the discovered transitions and are simplified using context-free grammars. Experimental results reveal that the reachability repair solution is applicable to a wide range of abstract machines and can accurately discover transitions that satisfy the requirements of reachability. Moreover, the results demonstrate that random forests are efficient machine learning models on transition discovery tasks. Additionally, we argue that the automated reachability repair process can improve the efficiency of software development. © 2019 IEEE. | - |
dc.format.extent | 8 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE | - |
dc.title | Achieving Abstract Machine Reachability with Learning-Based Model Fulfilment | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/APSEC48747.2019.00043 | - |
dc.identifier.scopusid | 2-s2.0-85078190938 | - |
dc.identifier.wosid | 000517102200033 | - |
dc.identifier.bibliographicCitation | Proceedings - Asia-Pacific Software Engineering Conference, APSEC, v.2019-December, pp 260 - 267 | - |
dc.citation.title | Proceedings - Asia-Pacific Software Engineering Conference, APSEC | - |
dc.citation.volume | 2019-December | - |
dc.citation.startPage | 260 | - |
dc.citation.endPage | 267 | - |
dc.type.docType | Conference Paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Software Engineering | - |
dc.relation.journalWebOfScienceCategory | Engineering | - |
dc.relation.journalWebOfScienceCategory | Electrical & Electronic | - |
dc.subject.keywordPlus | Automatic programming | - |
dc.subject.keywordPlus | Computer debugging | - |
dc.subject.keywordPlus | Context free grammars | - |
dc.subject.keywordPlus | Decision trees | - |
dc.subject.keywordPlus | Formal verification | - |
dc.subject.keywordPlus | Machine learning | - |
dc.subject.keywordPlus | Repair | - |
dc.subject.keywordPlus | Semantics | - |
dc.subject.keywordPlus | Software design | - |
dc.subject.keywordPlus | Abstract machines | - |
dc.subject.keywordPlus | Approximate features | - |
dc.subject.keywordPlus | Learning Based Models | - |
dc.subject.keywordPlus | Machine learning models | - |
dc.subject.keywordPlus | Program synthesis | - |
dc.subject.keywordPlus | Reachability analysis | - |
dc.subject.keywordPlus | Repair process | - |
dc.subject.keywordPlus | Repair solution | - |
dc.subject.keywordPlus | Model checking | - |
dc.subject.keywordAuthor | automatic programming | - |
dc.subject.keywordAuthor | debugging | - |
dc.subject.keywordAuthor | formal verification | - |
dc.subject.keywordAuthor | model checking | - |
dc.subject.keywordAuthor | reachability analysis | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/8945715 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.