default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17. VMCAI 2016: St. Petersburg, FL, USA
- Barbara Jobstmann, K. Rustan M. Leino:
Verification, Model Checking, and Abstract Interpretation - 17th International Conference, VMCAI 2016, St. Petersburg, FL, USA, January 17-19, 2016. Proceedings. Lecture Notes in Computer Science 9583, Springer 2016, ISBN 978-3-662-49121-8
Invited Talks
- Thomas W. Reps, Aditya V. Thakur:
Automating Abstract Interpretation. 3-40 - Peter Müller, Malte Schwerhoff, Alexander J. Summers:
Viper: A Verification Infrastructure for Permission-Based Reasoning. 41-62
Abstract Interpretation
- Alexander Bakst
, Ranjit Jhala:
Predicate Abstraction for Linked Data Structures. 65-84 - Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, Peter J. Stuckey:
An Abstract Domain of Uninterpreted Functions. 85-103 - Noam Rinetzky, Sharon Shoham:
Property Directed Abstract Interpretation. 104-123
Abstraction
- Egor George Karpenkov, David Monniaux, Philipp Wendler:
Program Analysis with Local Policy Iteration. 127-146 - Zeinab Ganjei, Ahmed Rezine, Petru Eles, Zebo Peng:
Lazy Constrained Monotonic Abstraction. 147-165 - Alexandre Maréchal, Alexis Fouilhé, Tim King, David Monniaux, Michaël Périn:
Polyhedral Approximation of Multivariate Polynomials Using Handelman's Theorem. 166-184 - Hila Peleg, Sharon Shoham, Eran Yahav:
D^3 : Data-Driven Disjunctive Abstraction. 185-205 - Benjamin Hillery, Eric Mercer, Neha Rungta, Suzette Person:
Exact Heap Summaries for Symbolic Execution. 206-225
Hybrid and Timed Systems
- Kengo Kido, Swarat Chaudhuri, Ichiro Hasuo:
Abstract Interpretation with Infinitesimals - Towards Scalability in Nonstandard Static Analysis. 229-249 - Thomas A. Henzinger, Jan Otop, Roopsha Samanta:
Lipschitz Robustness of Timed I/O Systems. 250-267 - Andrew Sogokon, Khalil Ghorbal, Paul B. Jackson, André Platzer:
A Method for Invariant Generation for Polynomial Continuous Systems. 268-288
Dynamic and Static Verification
- Pavel Parízek:
Hybrid Analysis for Partial Order Reduction of Programs with Arrays. 291-310 - Gerard J. Holzmann:
Cloud-Based Verification of Concurrent Software. 311-327 - Przemyslaw Daca, Ashutosh Gupta, Thomas A. Henzinger:
Abstraction-driven Concolic Testing. 328-347
Probabilistic Systems
- Vahid Hashemi, Holger Hermanns, Lei Song:
Reward-Bounded Reachability Probability for Uncertain Weighted MDPs. 351-371 - Benoît Delahaye, Didier Lime, Laure Petrucci:
Parameter Synthesis for Parametric Interval Markov Chains. 372-390
Concurrent Programs
- Frédéric Haziza, Lukás Holík, Roland Meyer, Sebastian Wolff:
Pointer Race Freedom. 393-412 - Marko Doko, Viktor Vafeiadis:
A Program Logic for C11 Memory Fences. 413-430 - Kamil Dudka, Lukás Holík, Petr Peringer, Marek Trtík, Tomás Vojnar:
From Low-Level Pointers to High-Level Containers. 431-452
Parameterized and Component-Based Systems
- Anthony W. Lin, Truong Khanh Nguyen, Philipp Rümmer, Jun Sun:
Regular Symmetry Patterns. 455-475 - Simon Außerlechner, Swen Jacobs, Ayrat Khalimov:
Tight Cutoffs for Guarded Protocols with Fairness. 476-494 - Ilaria De Crescenzo, Salvatore La Torre:
A General Modular Synthesis Problem for Pushdown Systems. 495-513
Solver Improvements
- Sagar Chaki, Derrick Karimi:
Model Checking with Multi-threaded IC3 Portfolios. 517-535 - Martin Brain, Liana Hadarean, Daniel Kroening, Ruben Martins:
Automatic Generation of Propagation Complete SAT Encodings. 536-556
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 2025-02-10 21:33 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:
