default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16. VMCAI 2015: Mumbai, India
- Deepak D'Souza, Akash Lal, Kim Guldstrand Larsen
:
Verification, Model Checking, and Abstract Interpretation - 16th International Conference, VMCAI 2015, Mumbai, India, January 12-14, 2015. Proceedings. Lecture Notes in Computer Science 8931, Springer 2014, ISBN 978-3-662-46080-1 - Mickael Randour, Jean-François Raskin, Ocan Sankur:
Variations on the Stochastic Shortest Path Problem. 1-18 - Patrick Cousot:
Abstracting Induction by Extrapolation and Interpolation. 19-42 - Kartik Nagar, Y. N. Srikant:
Path Sensitive Cache Analysis Using Cache Miss Paths. 43-60 - Agostino Cortesi, Pietro Ferrara, Marco Pistoia, Omer Tripp:
Datacentric Semantics for Verification of Privacy Policy Compliance by Mobile Applications. 61-79 - Andrew Reynolds, Viktor Kuncak:
Induction for SMT Solvers. 80-98 - Assalé Adjé, Pierre-Loïc Garoche:
Automatic Synthesis of Piecewise Linear Quadratic Invariants for Programs. 99-116 - Ratul Saha, Javier Esparza, Sumit Kumar Jha, Madhavan Mukund, P. S. Thiagarajan:
Distributed Markov Chains. 117-134 - Peter Backes, Jan Reineke:
Analysis of Infinite-State Graph Transformation Systems by Cluster Abstraction. 135-152 - Md Tawhid Bin Waez, Andrzej Wasowski, Juergen Dingel, Karen Rudie:
A Model for Industrial Real-Time Systems. 153-171 - Bettina Braitling, Luis María Ferrer Fioriti, Hassan Hatefi, Ralf Wimmer, Bernd Becker, Holger Hermanns:
Abstraction-Based Computation of Reward Measures for Markov Automata. 172-189 - Caterina Urban, Antoine Miné:
Proving Guarantee and Recurrence Temporal Properties by Abstract Interpretation. 190-208 - Bishoksan Kafle, John P. Gallagher:
Tree Automata-Based Refinement with Application to Horn Clause Verification. 209-226 - Zeinab Ganjei, Ahmed Rezine, Petru Eles, Zebo Peng:
Abstracting and Counting Synchronizing Processes. 227-244 - Gwen Salaün, Lina Ye:
Debugging Process Algebra Specifications. 245-262 - Nikolaj S. Bjørner, Arie Gurfinkel:
Property Directed Polyhedral Abstraction. 263-281 - Jiangchao Liu, Xavier Rival:
Abstraction of Arrays Based on Non Contiguous Partitions. 282-299 - Rigel Gjomemo, Kedar S. Namjoshi, Phu H. Phung, V. N. Venkatakrishnan, Lenore D. Zuck:
From Verification to Optimizations. 300-317 - Pavithra Prabhakar, Miriam Garcia Soto:
Foundations of Quantitative Predicate Abstraction for Stability Analysis of Hybrid Systems. 318-335 - Maria Christakis, Peter Müller, Valentin Wüstholz:
An Experimental Evaluation of Deliberate Unsoundness in a Static Program Analyzer. 336-354 - Madhavan Mukund, Ranjal Gautham Shenoy, S. P. Suresh:
Bounded Implementations of Replicated Data Types. 355-372 - Maria Christakis, Patrice Godefroid:
Proving Memory Safety of the ANI Windows Image Parser Using Compositional Exhaustive Testing. 373-392 - Pietro Ferrara, Peter Müller, Milos Novácek:
Automatic Inference of Heap Properties Exploiting Value Domains. 393-411 - He Zhu, Aditya V. Nori, Suresh Jagannathan:
Dependent Array Type Inference from Tests. 412-430 - Khalil Ghorbal, Andrew Sogokon, André Platzer:
A Hierarchy of Proof Rules for Checking Differential Invariance of Algebraic Sets. 431-448 - Andrei Marian Dan, Yuri Meshman, Martin T. Vechev, Eran Yahav:
Effective Abstractions for Verification under Relaxed Memory Models. 449-466
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-05-19 22:22 CEST 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:
