![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
13th VSTTE 2022: Trento, Italy
- Akash Lal, Stefano Tonetta
:
Verified Software. Theories, Tools and Experiments - 14th International Conference, VSTTE 2022, Trento, Italy, October 17-18, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13800, Springer 2023, ISBN 978-3-031-25802-2 - Suguman Bansal, Giuseppe De Giacomo, Antonio Di Stasio
, Yong Li, Moshe Y. Vardi, Shufang Zhu
:
Compositional Safety LTL Synthesis. 1-19 - Pedro Barroso, Mário Pereira
, António Ravara
:
Leroy and Blazy Were Right: Their Memory Model Soundness Proof is Automatable. 20-32 - Christopher K. Chen
, Margo I. Seltzer
, Mark R. Greenstreet
:
Shellac: A Compiler Synthesizer for Concurrent Programs. 33-51 - Cezara Dragoi, Patricio Inzaghi Pronesti
:
A Sequentialization Procedure for Fault-Tolerant Protocols. 52-71 - Philipp Körner
, Michael Leuschel
:
Towards Practical Partial Order Reduction for High-Level Formalisms. 72-91 - Iason Marmanis
, Viktor Vafeiadis:
SMT-Based Verification of Persistency Invariants of Px86 Programs. 92-110 - Nico Naus
, Freek Verbeek
, Dale Walker, Binoy Ravindran
:
A Formal Semantics for P-Code. 111-128 - Gerhard Schellhorn, Stefan Bodenmüller
, Martin Bitterlich, Wolfgang Reif:
Separating Separation Logic - Modular Verification of Red-Black Trees. 129-147 - Chukri Soueidi
, Yliès Falcone
:
Residual Runtime Verification via Reachability Analysis. 148-166
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.