.png){kind=icon}
.png){kind=icon}
Return
Static correction of Maude programs with assertions
.png){kind=icon}
OA
AI
DOI：10.1016/j.jss.2019.03.061.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present a novel transformation method for Maude programs featuring both automatic program diagnosis and correction. The input of our method is a reference specification A of the program behavior that is given in the form of assertions together with an overly general program R whose execution might violate the assertions. Our correction technique translates R into a refined program R' in which every computation is also a computation in R, that satisfies the assertions of A. The technique is first formalized for topmost rewrite theories, and then we generalize it to larger classes of rewrite theories that support nested structured configurations. Our technique copes with infinite space states and does not require the knowledge of any failing run. We report experiments that assess the effectiveness of assertion-driven correction. (C) 2019 Elsevier Inc. All rights reserved.
Keywords:
Program repair
Assertion checking
Program transformation
Rewriting logic
Equational rewriting
Maude
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
5.4K
Citations:
8.4K