Diversity-Driven Automated Formal Verification

保存先:
書誌詳細
出版年:The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Conference Proceedings (2022)
第一著者: First, Emily
その他の著者: Brun, Yuriy
出版事項:
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
主題:
オンライン・アクセス:Citation/Abstract
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!

MARC

LEADER 00000nab a2200000uu 4500
001 2679398038
003 UK-CbPIL
024 7 |a 10.1145/3510003.3510138  |2 doi 
035 |a 2679398038 
045 2 |b d20220101  |b d20221231 
084 |a 228229  |2 nlm 
100 1 |a First, Emily  |u University of Massachusetts Amherst,Amherst,MA,USA 
245 1 |a Diversity-Driven Automated Formal Verification 
260 |b The Institute of Electrical and Electronics Engineers, Inc. (IEEE)  |c 2022 
513 |a Conference Proceedings 
520 3 |a Conference Title: 2022 IEEE/ACM 44th International Conference on Software Engineering (ICSE)Conference Start Date: 2022, May 25 Conference End Date: 2022, May 27 Conference Location: Pittsburgh, PA, USAFormally verified correctness is one of the most desirable properties of software systems. But despite great progress made via interactive theorem provers, such as Coq, writing proof scripts for verification remains one of the most effort-intensive (and often prohibitively difficult) software development activities. Recent work has created tools that automatically synthesize proofs or proof scripts. For example, CoqHammer can prove 26.6% of theorems completely automatically by reasoning using precomputed facts, while TacTok and ASTactic, which use machine learning to model proof scripts and then perform biased search through the proof-script space, can prove 12.9% and 12.3% of the theorems, respectively. Further, these three tools are highly complementary; together, they can prove 30.4% of the theorems fully automatically. Our key insight is that control over the learning process can produce a diverse set of models, and that, due to the unique nature of proof synthesis (the existence of the theorem prover, an oracle that infallibly judges a proof's correctness), this diversity can significantly improve these tools' proving power. Accordingly, we develop Diva, which uses a diverse set of models with TacTok's and ASTactic's search mech-anism to prove 21.7% of the theorems. That is, Diva proves 68% more theorems than TacTok and 77% more than ASTactic. Complementary to CoqHammer, Diva proves 781 theorems (27% added value) that CoqHammer does not, and 364 theorems no existing tool has proved automatically. Together with CoqHammer, Diva proves 33.8% of the theorems, the largest fraction to date. We explore nine dimensions for learning diverse models, and identify which dimensions lead to the most useful diversity. Further, we develop an optimization to speed up Diva's execution by 40×. Our study introduces a completely new idea for using diversity in machine learning to improve the power of state-of-the-art proof-script synthesis techniques, and empirically demonstrates that the improvement is significant on a dataset of 68K theorems from 122 open-source software projects. 
653 |a Scripts 
653 |a Machine learning 
653 |a Verification 
653 |a Software engineering 
653 |a Theorem proving 
653 |a Synthesis 
653 |a Open source software 
653 |a Software development 
653 |a Existence theorems 
653 |a Optimization 
653 |a Economic 
700 1 |a Brun, Yuriy  |u University of Massachusetts Amherst,Amherst,MA,USA 
773 0 |t The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Conference Proceedings  |g (2022) 
786 0 |d ProQuest  |t Science Database 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/2679398038/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch