Overify: optimizing programs for fast verification

Authors:
Jonas Wagner;Volodymyr Kuznetsov;George Candea
Affiliations:
School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne, Switzerland;School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne, Switzerland;School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne, Switzerland
Venue:
HotOS'13 Proceedings of the 14th USENIX conference on Hot Topics in Operating Systems
Year:
2013

Citing 14
Cited 1

CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs

CC '02 Proceedings of the 11th International Conference on Compiler Construction
LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation

Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
VCC: A Practical System for Verifying Concurrent C

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Pex: white box test generation for .NET

TAP'08 Proceedings of the 2nd international conference on Tests and proofs
KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs

OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
S2E: a platform for in-vivo multi-path analysis of software systems

Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
Parallel symbolic execution for automated real-world software testing

Proceedings of the sixth conference on Computer systems
Symbolic crosschecking of floating-point and SIMD code

Proceedings of the sixth conference on Computer systems
KLOVER: a symbolic execution and automatic test generation tool for C++ programs

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
A polymorphic intermediate verification language: design and logical encoding

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
LLBMC: bounded model checking of C and C++ programs using a compiler IR

VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
Efficient state merging in symbolic execution

Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Predator: a verification tool for programs with dynamic linked data structures

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
UFO: a framework for abstractionand interpolation-based software verification

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification

Prototyping symbolic execution engines for interpreted languages

Proceedings of the 19th international conference on Architectural support for programming languages and operating systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Developers rely on automated testing and verification tools to gain confidence in their software. The input to such tools is often generated by compilers that have been designed to generate code that runs fast, not code that can be verified easily and quickly. This makes the verification tool's task unnecessarily hard. We propose that compilers support a new kind of switch, -OVERIFY, that generates code optimized for the needs of verification tools. We implemented this idea for one class of verification (symbolic execution) and found that, when run on the Coreutils suite of UNIX utilities, it reduces verification time by up to 95×.