Proof Pearl: The KeY to Correct and Stable Sorting
暂无分享,去创建一个
[1] Wojciech Mostowski,et al. Formalisation and Verification of Java Card Security Properties in Dynamic Logic , 2005, FASE.
[2] Wojciech Mostowski,et al. Fully Verified Java Card API Reference Implementation , 2007, VERIFY.
[3] Bernhard Beckert,et al. Verification of Object-Oriented Software. The KeY Approach - Foreword by K. Rustan M. Leino , 2007, The KeY Approach.
[4] Michael D. Ernst,et al. An overview of JML tools and applications , 2003, International Journal on Software Tools for Technology Transfer.
[5] C. A. R. Hoare,et al. Proof of a Recursive Program: Quicksort , 1971, Comput. J..
[6] Ernst-Rüdiger Olderog,et al. Verification of Sequential and Concurrent Programs , 1991, Texts and Monographs in Computer Science.
[7] Bernhard Beckert,et al. Secure Information Flow for Java. A Dynamic Logic Approach. Extended Version , 2013 .
[8] Gabriele Paganelli,et al. Real-time Java API specifications for high coverage test generation , 2012, JTRES '12.
[9] Frank S. de Boer,et al. Verification of object-oriented programs: A transformational approach , 2010, J. Comput. Syst. Sci..
[10] Christian Sternagel. Proof Pearl—A Mechanized Proof of GHC’s Mergesort , 2012, Journal of Automated Reasoning.
[11] Klaus Schneider,et al. Theorem Proving in Higher Order Logics - Emerging Trends , 2007 .