Data-driven equivalence checking

Sharma, Rahul; Schkufza, Eric; Churchill, Berkeley; Aiken, Alex

doi:10.1145/2509136.2509509

Cited by 68 publications

(15 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A formal verification of the scheduling phase of HLS using the FSMD model is reported in Ref. [23]. The method presented herein fails if the scheduler applies the non‐uniform code motion transformations.…”

Section: Related Workmentioning

confidence: 99%

VP_TT: A value propagation based equivalence checker for testability transformations

2021

View full text Add to dashboard Cite

Testability transformation (TT) is a source-to-source programme transformation that aims to improve the ability of a given test generation method to generate test data for the original programme. Herein, the correctness of testability transformations is shown. Translation validation is the process of proving that the transformed programme is a correct translation of the source programme being compiled. It is widely used to verify the correctness of various compiler optimizations and transformations during scheduling. The value propagation based equivalence checking (VP) method is an efficient translation validation approach proposed to verify the correctness of various compiler optimization applied during scheduling in high-level synthesis. VP-based translation validation of testability transformations is proposed. In particular, it is identified that the existing VP method fails to show the equivalence for some of the TTs. A dynamic cutpoint selection scheme and an enhancement to the VP method to overcome these limitations are shown. The enhanced VP method, called VP_TT, successfully shows the equivalence for the TTs where the VP method fails. Experimental results confirm the usefulness of VP_TT in the verification of testability transformations.This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

show abstract

Section: Related Workmentioning

confidence: 99%

VP_TT: A value propagation based equivalence checker for testability transformations

2021

View full text Add to dashboard Cite

show abstract

“…Proving program equivalence is useful in many domains ranging from translation validation [26,30,34,36,41], regression verification [18,19], automatic merging [45], semantic differencing [14], and cross-version verification [23,27].…”

Section: Programmentioning

confidence: 99%

Computing summaries of string loops in C for better testing and refactoring

Kapus

Ish-Shalom

Itzhaky

et al. 2019

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

Analysing and comprehending C programs that use strings is hard: Using standard library functions for manipulating strings is not enforced and programs often use complex loops for the same purpose. We introduce the notion of memoryless loops that capture some of these string loops and present a counterexample-guided inductive synthesis approach to summarise memoryless string loops using C standard library functions, which has applications to testing, optimization and refactoring.We prove our summarization is correct for arbitrary input strings and evaluate it on a database of loops we gathered from a set of 13 open-source programs. Our approach can summarize over two thirds of memoryless loops in less than 5 minutes of computation time per loop. We then show that these summaries can be used to (1) enhance symbolic execution testing, where we observed median speedups of 79x when employing a string constraint solver, (2) optimize native code, where certain summarizations led to significant performance gains, and (3) refactor code, where we had several patches accepted in the codebases of popular applications such as patch and wget.

show abstract

“…Inferring program properties. There has been work inferring program invariants from executions [30], including approaches using machine learning [35][36][37]. The most closely related work is [11], which uses an active learning strategy to infer program input grammars for blackbox code.…”

Section: Related Workmentioning

confidence: 99%

Active learning of points-to specifications

Bastani

Sharma

Aiken

et al. 2018

Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation

Self Cite

View full text Add to dashboard Cite

When analyzing programs, large libraries pose significant challenges to static points-to analysis. A popular solution is to have a human analyst provide points-to specifications that summarize relevant behaviors of library code, which can substantially improve precision and handle missing code such as native code. We propose Atlas, a tool that automatically infers points-to specifications. Atlas synthesizes unit tests that exercise the library code, and then infers points-to specifications based on observations from these executions. Atlas automatically infers specifications for the Java standard library, and produces better results for a client static information flow analysis on a benchmark of 46 Android apps compared to using existing handwritten specifications.

show abstract

Data-driven equivalence checking

Cited by 68 publications

References 51 publications

VP_TT: A value propagation based equivalence checker for testability transformations

VP_TT: A value propagation based equivalence checker for testability transformations

Computing summaries of string loops in C for better testing and refactoring

Active learning of points-to specifications

Contact Info

Product

Resources

About