Data Structure Repair Using Goal-Directed Reasoning
Author(s)
Demsky, Brian; Rinard, Martin![Thumbnail](/bitstream/handle/1721.1/30474/MIT-CSAIL-TR-2004-035.pdf.jpg?sequence=4&isAllowed=y)
DownloadMIT-CSAIL-TR-2004-035.ps (32.75Mb)
Additional downloads
Other Contributors
Computer Architecture
Metadata
Show full item recordAbstract
Model-based data structure repair is a promising techniquefor enabling programs to continue to execute successfullyin the face of otherwise fatal data structure corruption errors.Previous research in this eld relied on the developerto write a speci cation to explicitly translate model repairsinto concrete data structure repairs, raising the possibilityof 1) incorrect translations causing the supposedly repairedconcrete data structures to be inconsistent, and 2) repairedmodels with no corresponding concrete data structure representation.We present a new repair algorithm that uses goal-directedreasoning to automatically translate model repairs into concretedata structure repairs. This new repair algorithm eliminatesthe possibility of incorrect translations and repairedmodels with no corresponding representation as concretedata structures. Unlike our old algorithm, our new algorithmcan also repair linked data structures such as a list ora tree.
Date issued
2004-05-18Other identifiers
MIT-CSAIL-TR-2004-035
MIT-LCS-TR-950
Series/Report no.
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory