default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th VMCAI 2019: Cascais, Portugal
- Constantin Enea, Ruzica Piskac:
Verification, Model Checking, and Abstract Interpretation - 20th International Conference, VMCAI 2019, Cascais, Portugal, January 13-15, 2019, Proceedings. Lecture Notes in Computer Science 11388, Springer 2019, ISBN 978-3-030-11244-8 - Azalea Raad, Ori Lahav
, Viktor Vafeiadis:
On the Semantics of Snapshot Isolation. 1-23 - Calvin Smith, Aws Albarghouthi:
Program Synthesis with Equivalence Reduction. 24-47 - Jad Hamza, Viktor Kuncak:
Minimal Synthesis of String to String Functions from Examples. 48-69 - Thanh-Toan Nguyen, Quang-Trung Ta, Wei-Ngan Chin:
Automatic Program Repair Using Formal Verification and Expression Templates. 70-91 - Grigory Fedyukovich, Arie Gurfinkel, Aarti Gupta:
Lazy but Effective Functional Synthesis. 92-113 - Clément Ballabriga, Julien Forget, Laure Gonnord, Giuseppe Lipari, Jordy Ruiz:
Static Analysis of Binary Code with Memory Indirections Using Polyhedra. 114-135 - Rémy Boutonnet, Nicolas Halbwachs:
Disjunctive Relational Abstract Interpretation for Interprocedural Program Analysis. 136-159 - Quentin Bouillaguet, François Bobot, Mihaela Sighireanu, Boris Yakobowski:
Exploiting Pointer Analysis in Memory Models for Deductive Verification. 160-182 - Anja F. Karl, Robert Schilling, Roderick Bloem, Stefan Mangard:
Small Faults Grow Up - Verification of Error Masking Robustness in Arithmetically Encoded Programs. 183-204 - Kimball Germane, Matthew Might:
Relatively Complete Pushdown Analysis of Escape Continuations. 205-225 - Kimball Germane, Jay McCarthy, Michael D. Adams, Matthew Might:
Demand Control-Flow Analysis. 226-246 - Jens Nicolay, Quentin Stiévenart, Wolfgang De Meuter, Coen De Roover:
Effect-Driven Flow Analysis. 247-274 - Tianhan Lu, Pavol Cerný, Bor-Yuh Evan Chang, Ashutosh Trivedi:
Type-Directed Bounding of Collections in Reactive Programs. 275-296 - Jochen Hoenicke, Tanja Schindler:
Solving and Interpolating Constant Arrays Based on Weak Equivalences. 297-317 - Xiaokang Qiu, Yanjun Wang:
A Decidable Logic for Tree Data-Structures with Measurements. 318-341 - Charlie Murphy, Zachary Kincaid:
A Practical Algorithm for Structure Embedding. 342-362 - Denis Bueno, Karem A. Sakallah:
euforia: Complete Software Model Checking with Uninterpreted Functions. 363-385 - Nuno P. Lopes, Andrey Rybalchenko:
Fast BGP Simulation of Large Datacenters. 386-408 - Étienne André, Laurent Fribourg, Jean-Marc Mota, Romain Soulat:
Verification of an Industrial Asynchronous Leader Election Algorithm Using Abstractions and Parametric Model Checking. 409-424 - Tomoya Yamaguchi, Martin Brain, Chirs Ryder, Yosikazu Imai, Yoshiumi Kawamura:
Application of Abstract Interpretation to the Automotive Electronic Control System. 425-445 - Gereon Fox, Daniel Stan, Holger Hermanns:
Syntactic Partial Order Compression for Probabilistic Reachability. 446-467 - Hongfei Fu, Krishnendu Chatterjee:
Termination of Nondeterministic Probabilistic Programs. 468-490 - Étienne André, Benoît Delahaye, Paulin Fournier, Didier Lime:
Parametric Timed Broadcast Protocols. 491-512 - Normann Decker, Anton Pirogov:
Flat Model Checking for Counting LTL Using Quantifier-Free Presburger Arithmetic. 513-534 - Richard Huybers, Alfons Laarman:
A Parallel Relation-Based Algorithm for Symbolic Bisimulation Minimization. 535-554 - Stefan Haar, Juraj Kolcák, Loïc Paulevé:
Combining Refinement of Parametric Models with Goal-Oriented Reduction of Dynamics. 555-576 - Viorel Preoteasa, Iulia Dragomir, Stavros Tripakis:
Mechanically Proving Determinacy of Hierarchical Block Diagram Translations. 577-600
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 2024-12-19 22:20 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:
