default search action
18. VMCAI 2017: Paris, France
- Ahmed Bouajjani, David Monniaux
:
Verification, Model Checking, and Abstract Interpretation - 18th International Conference, VMCAI 2017, Paris, France, January 15-17, 2017, Proceedings. Lecture Notes in Computer Science 10145, Springer 2017, ISBN 978-3-319-52233-3 - Zara Ahmed, David Benqué, Sergey Berezin, Anna Caroline E. Dahl, Jasmin Fisher
Bringing LTL Model Checking to Biologists. 1-13 - Pascal Cuoq, Loïc Runarvot, Alexander Cherepanov:
Detecting Strict Aliasing Violations in the Wild. 14-33 - Iago Abal, Claus Brabrand, Andrzej Wasowski
Effective Bug Finding in C Programs with Shape and Effect Abstractions. 34-54 - Roderick Bloem, Hana Chockler
Synthesizing Non-Vacuous Systems. 55-72 - Vincent Botbol, Emmanuel Chailloux, Tristan Le Gall:
Static Analysis of Communicating Processes Using Symbolic Transducers. 73-90 - Hadrien Bride, Olga Kouchnarenko
Reduction of Workflow Nets for Generalised Soundness Verification. 91-111 - Sandrine Blazy, David Bühler, Boris Yakobowski:
Structuring Abstract Interpreters Through State and Value Abstractions. 112-130 - Supratik Chakraborty
Matching Multiplications in Bit-Vector Formulas. 131-150 - Vijay Victor D'Silva, Daniel Kroening
Independence Abstractions and Models of Concurrency. 151-168 - Vijay Victor D'Silva, Marcelo Sousa:
Complete Abstractions and Subclassical Modal Logics. 169-186 - Pietro Ferrara
Using Abstract Interpretation to Correct Synchronization Faults. 187-208 - Asya Frumkin, Yotam M. Y. Feldman
Property Directed Reachability for Proving Absence of Concurrent Modification Errors. 209-227 - Yijia Gu, Thomas Wahl:
Stabilizing Floating-Point Programs Using Provenance Analysis. 228-245 - Henning Günther, Alfons Laarman
Dynamic Reductions for Model Checking Concurrent Software. 246-265 - Ernst Moritz Hahn, Sven Schewe
Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games. 266-287 - Lukás Holík
Counterexample Validation and Interpolation-Based Refinement for Forest Automata. 288-309 - Jiahong Jiang, Liqian Chen, Xueguang Wu, Ji Wang:
Block-Wise Abstract Interpretation by Combining Abstract Domains with SMT. 310-329 - Dejan Jovanovic:
Solving Nonlinear Integer Arithmetic with MCSAT. 330-346 - Igor V. Konnov
Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms. 347-366 - Alexandre Maréchal, Michaël Périn:
Efficient Elimination of Redundancies in Polyhedra by Raytracing. 367-385 - Raphaël Monat, Antoine Miné:
Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions. 386-404 - Suvam Mukherjee, Arun Kumar, Deepak D'Souza:
Detecting All High-Level Dataraces in an RTOS Kernel. 405-423 - Anca Muscholl, Helmut Seidl, Igor Walukiewicz:
Reachability for Dynamic Parametric Processes. 424-441 - Or Ozeri, Oded Padon, Noam Rinetzky, Mooly Sagiv:
Conjunctive Abstract Interpretation Using Paramodulation. 442-461 - Andrew Reynolds, Radu Iosif, Cristina Serban:
Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic. 462-482 - Yassamine Seladji:
Finding Relevant Templates via the Principal Component Analysis. 483-499 - Tushar Sharma, Thomas W. Reps:
Sound Bit-Precise Numerical Domains. 500-520 - Yakir Vizel, Arie Gurfinkel
IC3 - Flipping the E in ICE. 521-538 - Wei Wang, Clark W. Barrett
Partitioned Memory Models for Program Analysis. 539-558
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-11-15 19: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: