Diversity-Driven Automated Formal VerificationDistinguished Paper Award
Wed 11 May 2022 20:25 - 20:30 at ICSE room 3-even hours - Validation and Verification 5 Chair(s): Saba Alimadadi
Wed 25 May 2022 09:35 - 09:40 at Room 306+307 - Papers 4: Verification and Analysis Chair(s): Gregory Gay
Formally 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 mechanism 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 Coq-Hammer 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 40X. 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.
Tue 10 MayDisplayed time zone: Eastern Time (US & Canada) change
Wed 11 MayDisplayed time zone: Eastern Time (US & Canada) change
Wed 25 MayDisplayed time zone: Eastern Time (US & Canada) change
09:30 - 10:30 | Papers 4: Verification and AnalysisTechnical Track / Journal-First Papers at Room 306+307 Chair(s): Gregory Gay Chalmers and the University of Gothenburg | ||
09:30 5mTalk | Static Stack-Preserving Intra-Procedural Slicing of WebAssembly BinariesBest Artifact Award Technical Track Quentin Stiévenart Vrije Universiteit Brussel, David Binkley Loyola University Maryland, Coen De Roover Vrije Universiteit Brussel DOI Pre-print Media Attached | ||
09:35 5mTalk | Diversity-Driven Automated Formal VerificationDistinguished Paper Award Technical Track DOI Pre-print Media Attached | ||
09:40 5mTalk | Control and Discovery of Environment Behaviour Journal-First Papers Maureen Keegan Intercom, Nicolás D’Ippolito Dept. of Computer Science FCEyN, University of Buenos Aires, Víctor Braberman ICC (UBA-CONICET), Nir Piterman University of Gothenberg, Sebastian Uchitel Universidad de Buenos Aires / Imperial College Link to publication DOI Pre-print Media Attached | ||
09:45 5mTalk | Learning Lenient Parsing & Typing via Indirect Supervision Journal-First Papers Toufique Ahmed University of California at Davis, Prem Devanbu Department of Computer Science, University of California, Davis, Vincent J. Hellendoorn Carnegie Mellon University Link to publication DOI Pre-print Media Attached | ||
09:50 5mTalk | Striking a Balance: Pruning False-Positives from Static Call GraphsNominated for Distinguished Paper Technical Track Akshay Utture University of California, Los Angeles (UCLA), Shuyang Liu University of California, Los Angeles, Christian Gram Kalhauge Technical University of Denmark, Jens Palsberg University of California at Los Angeles DOI Pre-print Media Attached | ||
09:55 5mTalk | SugarC: Scalable Desugaring of Real-World Preprocessor Usage into Pure C Technical Track Zachary Patterson University of Texas at Dallas, Zenong Zhang The University of Texas at Dallas, Brent Pappas University of Central Florida, Shiyi Wei University of Texas at Dallas, Paul Gazzillo University of Central Florida Pre-print Media Attached |