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.

Dates
You're viewing the program in a time zone which is different from your device's time zone change time zone

Sun 7 Jan

Displayed time zone: Tijuana, Baja California change

09:00 - 10:00
Invited Talk by Ranjit JhalaVMCAI at Watercourt
Chair(s): Işıl Dillig UT Austin
09:00
60m
Talk
Reasoning about Functions
VMCAI
Ranjit Jhala University of California, San Diego
10:30 - 12:00
SynthesisVMCAI at Watercourt
Chair(s): K. Rustan M. Leino Amazon
10:30
30m
Talk
Abstraction-Based Interaction Model for Synthesis
VMCAI
Hila Peleg , Shachar Itzhaky Technion, Israel, Sharon Shoham Tel Aviv university
11:00
30m
Talk
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
30m
Talk
Generating Tests by Example
VMCAI
Hila Peleg , Dan Rasin Technion – Israel Institute of Technology, Eran Yahav Technion
14:00 - 15:30
VerificationVMCAI at Watercourt
Chair(s): Jeffrey S. Foster University of Maryland, College Park
14:00
30m
Talk
Gradual Program Verification
VMCAI
Johannes Bader Microsoft, Jonathan Aldrich Carnegie Mellon University, Éric Tanter University of Chile
14:30
30m
Talk
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
30m
Talk
P5: Planner-less Proofs of Probabilistic Parameterized Protocols
VMCAI
Lenore Zuck , Kenneth L. McMillan Microsoft Research, Jordan Torf UIC
16:00 - 17:30
SecurityVMCAI at Watercourt
Chair(s): Francesco Ranzato University of Padova
16:00
30m
Talk
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
30m
Talk
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
30m
Talk
Abstract Code Injection - A Semantic Approach Based on Abstract Non-Interference
VMCAI
Samuele Buro Università degli Studi di Verona, Isabella Mastroeni University of Verona, Italy

Mon 8 Jan

Displayed time zone: Tijuana, Baja California change

09:00 - 10:00
Invited Talk by Kenneth L. McMillanVMCAI at Watercourt
Chair(s): Lenore Zuck
09:00
60m
Talk
How to Stay Decidable
VMCAI
Kenneth L. McMillan Microsoft Research
10:30 - 12:00
Abstract InterpretationVMCAI at Watercourt
Chair(s): Patrick Cousot
10:30
30m
Talk
On Constructivity of Galois Connections
VMCAI
Francesco Ranzato University of Padova
11:00
30m
Talk
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
30m
Talk
Modular Analysis of Executables using On-Demand Heyting Completion
VMCAI
Julian Kranz Technical University of Munich, Axel Simon Google
14:00 - 15:30
PotpourriVMCAI at Watercourt
Chair(s): Wei-Ngan Chin National University of Singapore
14:00
30m
Talk
Revisiting MITL to Fix Decision Procedures
VMCAI
Nima Roohi University of Pennsylvania, Mahesh Viswanathan University of Illinois at Urbana-Champaign
14:30
30m
Talk
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
30m
Talk
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
90m
Talk
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
VMCAI BanquetVMCAI at Watercourt
18:00
4h
Dinner
Banquet
VMCAI

Tue 9 Jan

Displayed time zone: Tijuana, Baja California change

09:00 - 10:00
Invited Talk by Azadeh FarzanVMCAI at Watercourt
Chair(s): Işıl Dillig UT Austin
09:00
60m
Talk
Rethinking Compositionality for Concurrent Program Proofs
VMCAI
Azadeh Farzan University of Toronto
10:30 - 12:00
Verifying Protocols and SystemsVMCAI at Watercourt
Chair(s): James Riely DePaul University
10:30
30m
Talk
Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity
VMCAI
Swen Jacobs , Mouhammad Sakr Saarland University
11:00
30m
Talk
Automatic Verification of Intermittent Systems
VMCAI
11:30
30m
Talk
Co-Design and Verification of an Available File System
VMCAI
Mahsa Najafzadeh Purdue University, Marc Shapiro LIP6, Patrick Eugster Purdue University
14:00 - 15:30
Types and AnalysisVMCAI at Watercourt
Chair(s): Tachio Terauchi Waseda University
14:00
30m
Talk
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
30m
Talk
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
30m
Talk
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
Model CheckingVMCAI at Watercourt
Chair(s): Kenneth L. McMillan Microsoft Research
16:00
30m
Talk
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
30m
Talk
Selfless Interpolation for Infinite-State Model Checking
VMCAI
Tanja Schindler University of Freiburg, Dejan Jovanović SRI International
17:00
30m
Talk
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

Title
Abstract Code Injection - A Semantic Approach Based on Abstract Non-Interference
VMCAI
Abstraction-Based Interaction Model for Synthesis
VMCAI
A Framework for Computer-Aided Design of Educational Domain Models
VMCAI
A Logical System for Modular Information Flow Verification
VMCAI
An Abstract Interpretation Framework for the Round-Off Error Analysis of Floating-Point Programs
VMCAI
Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity
VMCAI
Automatic Verification of Intermittent Systems
VMCAI
Automatic Verification of RMA Programs via Abstraction Extrapolation
VMCAI
Banquet
VMCAI

Code Obfuscation Against Abstract Model Checking Attacks
VMCAI
Co-Design and Verification of an Available File System
VMCAI
From Shapes to Amortized Complexity
VMCAI
Generating Tests by Example
VMCAI
Gradual Program Verification
VMCAI
How to Stay Decidable
VMCAI
Invariant Generation for Multi-Path Loops with Polynomial Assignments
VMCAI
Learning to Complement Büchi Automata
VMCAI
Maximum Satisfiability in Program Analysis: Applications and Techniques
VMCAI
Modular Analysis of Executables using On-Demand Heyting Completion
VMCAI
On abstraction and compositionality for weak-memory linearisability
VMCAI
On Constructivity of Galois Connections
VMCAI
P5: Planner-less Proofs of Probabilistic Parameterized Protocols
VMCAI
Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction
VMCAI
Reasoning about Functions
VMCAI
Refinement Types for Ruby
VMCAI
Rethinking Compositionality for Concurrent Program Proofs
VMCAI
Revisiting MITL to Fix Decision Procedures
VMCAI
Scalable Approximation of Quantitative Information Flow in Programs
VMCAI
Selfless Interpolation for Infinite-State Model Checking
VMCAI

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.