论文信息 - Let’s verify this with Why3

Let’s verify this with Why3

We present solutions to the three challenges of the VerifyThis competition held at the 18th FM symposium in August 2012. These solutions use the Why3 environment for deductive program verification.

[1] Christoph Weidenbach,et al. SPASS Version 3.5 , 2009, CADE.

[2] Ganesh Gopalakrishnan,et al. Proceedings of the 23rd international conference on Computer aided verification , 2011 .

[3] Holger Hermanns,et al. Proceedings of the 19th international conference on Computer aided verification , 2007 .

[4] T. Tammet. 10th international conference on automated deduction , 1991 .

[5] Stephan Schulz,et al. System Description: E 0.81 , 2004, IJCAR.

[6] Nikolaj Bjørner,et al. Z3: An Efficient SMT Solver , 2008, TACAS.

[7] François Bobot,et al. Why3: Shepherd Your Herd of Provers , 2011 .

[8] Jean-Christophe Filliâtre,et al. Why3 - Where Programs Meet Provers , 2013, ESOP.

[9] Peter Müller,et al. Freedom before commitment: a lightweight type system for object initialisation , 2011, OOPSLA '11.

[10] François Bobot,et al. Preserving User Proofs across Specification Changes , 2013, VSTTE.

[11] Gwynedd Pickett. Vampire , 2006, Canadian Medical Association Journal.

[12] Pierre Castéran,et al. Interactive Theorem Proving and Program Development , 2004, Texts in Theoretical Computer Science An EATCS Series.

[13] Natarajan Shankar,et al. PVS: A Prototype Verification System , 1992, CADE.

[14] Gérard P. Huet,et al. The Zipper , 1997, Journal of Functional Programming.

[15] Evelyne Contejean,et al. Software - The Alt-Ergo theorem prover , 2010 .