default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10th VSTTE 2018: Oxford, UK
- Ruzica Piskac, Philipp Rümmer:
Verified Software. Theories, Tools, and Experiments - 10th International Conference, VSTTE 2018, Oxford, UK, July 18-19, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11294, Springer 2018, ISBN 978-3-030-03591-4 - Jochen Hoenicke, Alexander Nutz, Andreas Podelski:
A Tree-Based Approach to Data Flow Proofs. 1-16 - Jeffrey Gennari, Arie Gurfinkel
, Temesghen Kahsai, Jorge A. Navas, Edward J. Schwartz:
Executable Counterexamples in Software Model Checking. 17-37 - Pritom Rajkhowa, Fangzhen Lin:
Extending VIAP to Handle Array Programs. 38-49 - Karine Even-Mendoza, Sepideh Asadi, Antti E. J. Hyvärinen, Hana Chockler, Natasha Sharygina:
Lattice-Based Refinement in Bounded Model Checking. 50-68 - Milad K. Ghale, Dirk Pattinson, Ramana Kumar, Michael Norrish:
Verified Certificate Checking for Counting Votes. 69-87 - Hugo Férée, Johannes Åman Pohjola, Ramana Kumar, Scott Owens, Magnus O. Myreen, Son Ho:
Program Verification in the Presence of I/O - Semantics, Verified Library Routines, and Verified Applications. 88-111 - Rose Bohrer, Karl Crary:
TWAM: A Certifying Abstract Machine for Logic Programs. 112-134 - Patryk Czarnik, Jacek Chrzaszcz, Aleksy Schubert:
A Java Bytecode Formalisation. 135-154 - Paolo Torrini, David Nowak, Narjes Jomaa, Mohamed Sami Cherif:
Formalising Executable Specifications of Low-Level Systems. 155-176 - Alessandro Coglio:
A Formalization of the ABNF Notation and a Verified Parser of ABNF Grammars. 177-195 - Robin Adams, Sibylle Schupp:
Constructing Independently Verifiable Privacy-Compliant Type Systems for Message Passing Between Black-Box Components. 196-214 - Konstantinos Athanasiou, Byron Cook, Michael Emmi, Colm MacCárthaigh, Daniel Schwartz-Narbonne, Serdar Tasiran:
SideTrail: Verifying Time-Balancing of Cryptosystems. 215-228 - Jakub Zakrzewski:
Towards Verification of Ethereum Smart Contracts: A Formalization of Core of Solidity. 229-247 - Bernhard Beckert, Timo Bingmann, Moritz Kiefer, Peter Sanders, Mattias Ulbrich, Alexander Weigl:
Relational Equivalence Proofs Between Imperative and MapReduce Algorithms. 248-266 - David R. Cok, Serdar Tasiran:
Practical Methods for Reasoning About Java 8's Functional Programming Features. 267-278 - Chih-Hong Cheng, Georg Nührenberg, Chung-Hao Huang, Harald Ruess:
Verification of Binarized Neural Networks via Inter-neuron Factoring - (Short Paper). 279-290 - Daniel Dietsch, Matthias Heizmann, Jochen Hoenicke, Alexander Nutz, Andreas Podelski:
The Map Equality Domain. 291-308 - Naoki Nishida, Sarah Winkler:
Loop Detection by Logically Constrained Term Rewriting. 309-321 - Jonas Oberhauser:
Store Buffer Reduction in the Presence of Mixed-Size Accesses and Misalignment. 322-344
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.
last updated on 2026-02-13 00:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
