19th International Conference on Verification, Model Checking, and Abstract InterpretationVMCAI 2018
Welcome to the website of the International Conference on Verification, Model Checking, and Abstract Interpretation 2018.
VMCAI provides a forum for researchers from the communities of Verification, Model Checking, and Abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods that combine these and related areas. VMCAI 2018 will be the 19th edition in the series.
Proceedings
The papers will be freely available from Springer here from Jan 7 to Feb 3, 2018.
Travel Support for Students
PhD students can apply for a grant covering up to $1000 for travel and registration costs. We encourage particularly female students and underrepresented minorities to apply for this grant. Due to budget restrictions, a limited number of students can benefit from this support. Interested students must apply before Dec 10, 2017, 23:59 AoE, by sending a request to isil@cs.utexas.edu and palsberg@cs.ucla.edu mentioning their name, affiliation, contact information (address, email), and reason for applying for this grant. Applicants will be notified by Dec 15, 2017.
Sun 7 JanDisplayed time zone: Tijuana, Baja California change
09:00 - 10:00 | |||
09:00 60mTalk | Reasoning about Functions VMCAI Ranjit Jhala University of California, San Diego |
10:30 - 12:00 | |||
10:30 30mTalk | Abstraction-Based Interaction Model for Synthesis VMCAI | ||
11:00 30mTalk | A Framework for Computer-Aided Design of Educational Domain Models VMCAI Eric Butler University of Washington, Emina Torlak University of Washington, Zoran Popovic University of Washington | ||
11:30 30mTalk | Generating Tests by Example VMCAI |
14:00 - 15:30 | |||
14:00 30mTalk | Gradual Program Verification VMCAI Johannes Bader Microsoft, Jonathan Aldrich Carnegie Mellon University, Éric Tanter University of Chile | ||
14:30 30mTalk | A Logical System for Modular Information Flow Verification VMCAI Adi Prabawa National University of Singapore, Mahmudul Faisal Al Ameen National University of Singapore, Benedict Lee National University of Singapore, Wei-Ngan Chin National University of Singapore | ||
15:00 30mTalk | P5: Planner-less Proofs of Probabilistic Parameterized Protocols VMCAI |
16:00 - 17:30 | |||
16:00 30mTalk | Code Obfuscation Against Abstract Model Checking Attacks VMCAI Roberto Bruni Dipartimento di Informatica, Universita' di Pisa, Roberto Giacobazzi University of Verona and IMDEA Software Institute, Roberta Gori Dipartimento di Informatica, Universita' di Pisa | ||
16:30 30mTalk | Scalable Approximation of Quantitative Information Flow in Programs VMCAI Fabrizio Biondi CentraleSupelec Rennes, Mike Enescu INRIA, Annelie Heuser CNRS/IRISA, Axel Legay , Kuldeep S. Meel National University of Singapore, Jean Quilbeuf INRIA | ||
17:00 30mTalk | Abstract Code Injection - A Semantic Approach Based on Abstract Non-Interference VMCAI |
Mon 8 JanDisplayed time zone: Tijuana, Baja California change
09:00 - 10:00 | |||
09:00 60mTalk | How to Stay Decidable VMCAI Kenneth L. McMillan Microsoft Research |
10:30 - 12:00 | |||
10:30 30mTalk | On Constructivity of Galois Connections VMCAI Francesco Ranzato University of Padova | ||
11:00 30mTalk | An Abstract Interpretation Framework for the Round-Off Error Analysis of Floating-Point Programs VMCAI Laura Titolo National Institute of Aerospace, USA, Marco A. Feliu National Institute of Aerospace, Mariano Moscato National Institute of Aerospace, Cesar Munoz NASA | ||
11:30 30mTalk | Modular Analysis of Executables using On-Demand Heyting Completion VMCAI |
14:00 - 15:30 | |||
14:00 30mTalk | Revisiting MITL to Fix Decision Procedures VMCAI Nima Roohi University of Pennsylvania, Mahesh Viswanathan University of Illinois at Urbana-Champaign | ||
14:30 30mTalk | On abstraction and compositionality for weak-memory linearisability VMCAI Brijesh Dongol Brunel University London, Radha Jagadeesan DePaul University, James Riely DePaul University, Alasdair Armstrong Brunel University | ||
15:00 30mTalk | Automatic Verification of RMA Programs via Abstraction Extrapolation VMCAI Cedric Baumann ETH Zurich, Andrei Marian Dan ETH Zurich, Yuri Meshman IMDEA, Torsten Hoefler ETH Zurich, Martin Vechev ETH Zürich |
16:00 - 17:30 | Invited Tutorial by Mayur NaikVMCAI at Watercourt Chair(s): Jens Palsberg University of California, Los Angeles (UCLA) | ||
16:00 90mTalk | Maximum Satisfiability in Program Analysis: Applications and Techniques VMCAI Mayur Naik University of Pennsylvania, Xujie Si University of Pennsylvania, Xin Zhang Massachusetts Institute of Technology, USA, Radu Grigore University of Kent |
18:00 - 22:00 | |||
18:00 4hDinner | Banquet VMCAI |
Tue 9 JanDisplayed time zone: Tijuana, Baja California change
09:00 - 10:00 | |||
09:00 60mTalk | Rethinking Compositionality for Concurrent Program Proofs VMCAI Azadeh Farzan University of Toronto |
10:30 - 12:00 | |||
10:30 30mTalk | Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity VMCAI | ||
11:00 30mTalk | Automatic Verification of Intermittent Systems VMCAI | ||
11:30 30mTalk | Co-Design and Verification of an Available File System VMCAI |
14:00 - 15:30 | |||
14:00 30mTalk | From Shapes to Amortized Complexity VMCAI Tomas Fiedor VUT Brno, Lukáš Holík Brno University of Technology, Adam Rogalewicz Brno University of Technology , Moritz Sinn St. Polten University of Applied Sciences, Tomáš Vojnar Brno University of Technology, Florian Zuleger TU Vienna | ||
14:30 30mTalk | Invariant Generation for Multi-Path Loops with Polynomial Assignments VMCAI Andreas Humenberger Vienna University of Technology, Maximilian Jaroschek Vienna University of Technology, Laura Kovacs Chalmers University of Technology | ||
15:00 30mTalk | Refinement Types for Ruby VMCAI Milod Kazerounian , Niki Vazou University of Maryland, Austin Bourgerie University of Maryland, Jeffrey S. Foster University of Maryland, College Park, Emina Torlak University of Washington |
16:00 - 17:30 | |||
16:00 30mTalk | Learning to Complement Büchi Automata VMCAI Yong Li Institute of Software, Chinese Academy of Sciences, Andrea Turrini State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Lijun Zhang Institute of Software, Chinese Academy of Sciences, Sven Schewe University of Liverpool | ||
16:30 30mTalk | Selfless Interpolation for Infinite-State Model Checking VMCAI | ||
17:00 30mTalk | Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction VMCAI Benjamin Aminof Vienna University of Technology, Sasha Rubin University of Naples Federico II, Ilina Stoilkovska Vienna University of Technology , Josef Widder TU Wien, Florian Zuleger TU Vienna |
Accepted Papers
Call for Papers
VMCAI 2018 welcomes research papers on any topic related to verification, model checking, and abstract interpretation. Research contributions can report new results as well as experimental evaluations and comparisons of existing techniques. Topics include, but are not limited to: Program Verification, Model Checking, Abstract Interpretation, Abstract Domains, Program Synthesis, Static Analysis, Type Systems, Deductive Methods, Program Logics, First-Order Theories, Decision Procedures, Interpolation, Horn Clause Solving, Program Certification, Separation Logic, Probabilistic Programming and Analysis, Error Diagnosis, Detection of Bugs and Security Vulnerabilities, Program Transformations, Hybrid and Cyber-physical Systems, Concurrent Systems, Analysis of Numerical Properties.
Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic, and object-oriented programming.
Submissions
Submissions are restricted to 20 pages in Springer’s LNCS format, not counting references. Additional material may be placed in an appendix, to be read at the discretion of the reviewers and to be omitted in the final version. Formatting style files and further guidelines for formatting can be found at the Springer website.
Submissions must be uploaded via the paper submission site.
Accepted papers will be published in Springer’s Lecture Notes in Computer Science series.