default search action
9th VSTTE 2017: Heidelberg, Germany
- Andrei Paskevich, Thomas Wies:
Verified Software. Theories, Tools, and Experiments - 9th International Conference, VSTTE 2017, Heidelberg, Germany, July 22-23, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10712, Springer 2017, ISBN 978-3-319-72307-5 - Nicolas Jeannerod, Claude Marché, Ralf Treinen:
A Formally Verified Interpreter for a Shell-Like Programming Language. 1-18 - Aaron Dutle, Mariano M. Moscato, Laura Titolo, César A. Muñoz:
A Formal Analysis of the Compact Position Reporting Algorithm. 19-34 - Bernhard Beckert, Jonas Schiffl, Peter H. Schmitt, Mattias Ulbrich:
Proving JDK's Dual Pivot Quicksort Correct. 35-48 - Ran Chen, Jean-Jacques Lévy:
A Semi-automatic Proof of Strong Connectivity. 49-65 - Marc Schoolderman:
Verifying Branch-Free Assembly Code in Why3. 66-83 - Raphaël Rieu-Helft, Claude Marché, Guillaume Melquiond:
How to Get an Efficient yet Verified Arbitrary-Precision Integer Library. 84-101 - Clément Fumex, Claude Marché, Yannick Moy:
Automating the Verification of Floating-Point Programs. 102-119 - Saeed Nejati, Jia Hui Liang, Catherine H. Gebotys, Krzysztof Czarnecki, Vijay Ganesh:
Adaptive Restart and CEGAR-Based Solver for Inverting Cryptographic Hash Functions. 120-131 - Alexander Kogtenkov:
Practical Void Safety. 132-151 - Kim G. Larsen, Doron Peled, Sean Sedwards:
Memory-Efficient Tactics for Randomized LTL Model Checking. 152-169 - Tatsuya Abe, Tomoharu Ugawa, Toshiyuki Maeda:
Reordering Control Approaches to State Explosion in Model Checking with Memory Consistency Models. 170-190 - Wytse Oortwijn, Stefan Blom, Dilian Gurov, Marieke Huisman, Marina Zaharieva-Stojanovski:
An Abstraction Technique for Describing Concurrent Program Behaviour. 191-209
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.