Debugging temporal specifications with concept analysis

Author:

Ammons Glenn1,Mandelin David2,Bodík Rastislav3,Larus James R.4

Affiliation:

1. University of Wisconsin, Madison, Wisconsin and IBM T.J. Watson Research Center, Hawthorne, New York

2. University of California, Berkeley, California

3. University of California, Berkeley, California and IBM T.J. Watson Research Center, Hawthorne, New York

4. Microsoft Research, Redmond, Washington

Abstract

Program verification tools (such as model checkers and static analyzers) can find many errors in programs. These tools need formal specifications of correct program behavior, but writing a correct specification is difficult, just as writing a correct program is difficult. Thus, just as we need methods for debugging programs, we need methods for debugging specifications.This paper describes a novel method for debugging formal, temporal specifications. Our method exploits the short program execution traces that program verification tools generate from specification violations and that specification miners extract from programs. Manually examining these traces is a straightforward way to debug a specification, but this method is tedious and error-prone because there may be hundreds or thousands of traces to inspect. Our method uses concept analysis to automatically group the traces into highly similar clusters. By examining clusters instead of individual traces, a person can debug a specification with less work.To test our method, we implemented a tool, Cable, for debugging specifications. We have used Cable to debug specifications produced by Strauss, our specification miner. We found that using Cable to debug these specifications requires, on average, less than one third as many user decisions as debugging by examining all traces requires. In one case, using Cable required only 28 decisions, while debugging by examining all traces required 224.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Graphics and Computer-Aided Design,Software

Reference20 articles.

Cited by 20 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Synthesizing Legacy String Code for FPGAs Using Bounded Automata Learning;IEEE Micro;2022-09-01

2. General past-time linear temporal logic specification mining;CCF Transactions on High Performance Computing;2021-10-19

3. Accelerating Legacy String Kernels via Bounded Automata Learning;Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems;2020-03-09

4. Formal Requirement Debugging for Testing and Verification of Cyber-Physical Systems;ACM Transactions on Embedded Computing Systems;2018-03-31

5. Bayesian specification learning for finding API usage errors;Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering;2017-08-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3