Reconstruction of algorithms from memory snapshots of their execution

ACM '76 Pub Date : 1976-10-20 DOI:10.1145/800191.805659
F. Petry, A. Biermann
{"title":"Reconstruction of algorithms from memory snapshots of their execution","authors":"F. Petry, A. Biermann","doi":"10.1145/800191.805659","DOIUrl":null,"url":null,"abstract":"A system is described which utilizes a trace of memory snapshots taken during the execution of an algorithm. With such traces and a description of the environment in which the algorithm was executed, the algorithm can be reconstructed. In the first phase, decomputation of the results which appear in the snapshots is performed. Decomputation is the process which produces, for each result in the trace, the set of possible instructions which could have been its cause. The construction phase then uses static and dynamic information obtained from the trace to aid in synthesizing the algorithm. A number of experiments which have been performed with system are also described.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"518 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1976-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '76","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800191.805659","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

A system is described which utilizes a trace of memory snapshots taken during the execution of an algorithm. With such traces and a description of the environment in which the algorithm was executed, the algorithm can be reconstructed. In the first phase, decomputation of the results which appear in the snapshots is performed. Decomputation is the process which produces, for each result in the trace, the set of possible instructions which could have been its cause. The construction phase then uses static and dynamic information obtained from the trace to aid in synthesizing the algorithm. A number of experiments which have been performed with system are also described.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
根据算法执行的内存快照重建算法
描述了一种利用在算法执行期间所拍摄的内存快照的跟踪的系统。有了这样的轨迹和对算法执行环境的描述,就可以重构算法。在第一阶段,执行快照中出现的结果的解算。解算是为跟踪中的每个结果产生一组可能的指令的过程,这些指令可能是导致该结果的原因。然后,构造阶段使用从跟踪中获得的静态和动态信息来帮助合成算法。文中还介绍了用该系统进行的一些实验。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
SIGCUE (Paper and Panel Session) SIGBIO (Paper Session) An efficient sparse minor expansion algorithm Parallel processing and data driven implementation of a relational data base system Computer-based educational communications at the University of Michigan
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1