Verification, Testing and Statistics

Though formal verification has been the holy grail of software validation, practical applications of verification run into two major challenges. The first challenge is in writing detailed specifications, and the second challenge is in scaling verification algorithms to large software. In this short paper, we present possible approaches for these problems. We propose using statistical techniques to raise the level of abstraction, and automate the tedium in writing detailed specifications. We propose combining testing with verification to help scalability.

[1]  Robert J. Simmons,et al.  Proofs from Tests , 2008, IEEE Transactions on Software Engineering.

[2]  Zhe Yang,et al.  Modular checking for buffer overflows in the large , 2006, ICSE.

[3]  Koushik Sen,et al.  DART: directed automated random testing , 2005, PLDI '05.

[4]  Thomas A. Henzinger,et al.  Lazy abstraction , 2002, POPL '02.

[5]  Sriram K. Rajamani,et al.  The YogiProject: Software Property Checking via Static Analysis and Testing , 2009, TACAS.

[6]  Sriram K. Rajamani,et al.  DebugAdvisor: a recommender system for debugging , 2009, ESEC/FSE '09.

[7]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[8]  David Lee,et al.  Online minimization of transition systems (extended abstract) , 1992, STOC '92.

[9]  Dawson R. Engler,et al.  Checking system rules using system-specific, programmer-written compiler extensions , 2000, OSDI.

[10]  Sriram K. Rajamani,et al.  Automatically validating temporal safety properties of interfaces , 2001, SPIN '01.

[11]  Sriram K. Rajamani,et al.  Thorough static analysis of device drivers , 2006, EuroSys.

[12]  Susanne Albers,et al.  On‐Line Algorithms , 2013 .

[13]  Benjamin Livshits,et al.  Merlin: specification inference for explicit information flow problems , 2009, PLDI '09.

[14]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[15]  Sriram K. Rajamani,et al.  Compositional may-must program analysis: unleashing the power of alternation , 2010, POPL '10.

[16]  Thomas A. Henzinger,et al.  SYNERGY: a new algorithm for property checking , 2006, SIGSOFT '06/FSE-14.

[17]  Jon M Kleinberg,et al.  Hubs, authorities, and communities , 1999, CSUR.