Isil Dillig Serdar Tasiran (Eds.) LNCS 11562 31st International Conference, CAV 2019 New York City, NY, USA, July 15–18, 2019 Proceedings, Part II Computer Aided Verification Lecture Notes in Computer Science 11562 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board Members David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Zurich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan Indian Institute of Technology Madras, Chennai, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA More information about this series at http://www.springer.com/series/7407 Isil Dillig • Serdar Tasiran (Eds.) Computer Aided Veri fi cation 31st International Conference, CAV 2019 New York City, NY, USA, July 15 – 18, 2019 Proceedings, Part II Editors Isil Dillig University of Texas Austin, TX, USA Serdar Tasiran Amazon Web Services New York, NY, USA ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISBN 978-3-030-25542-8 ISBN 978-3-030-25543-5 (eBook) https://doi.org/10.1007/978-3-030-25543-5 LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues © The Editor(s) (if applicable) and The Author(s) 2019, This book is an open access publication. Open Access This book is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this book are included in the book ’ s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the book ’ s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a speci fi c statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional af fi liations. This Springer imprint is published by the registered company Springer Nature Switzerland AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland Preface It was our privilege to serve as the program chairs for CAV 2019, the 31st International Conference on Computer-Aided Veri fi cation. CAV 2019 was held in New York, USA, during July 15 – 18, 2019. The tutorial day was on July 14, 2019, and the pre-conference workshops were held during July 13 – 14, 2019. All events took place in The New School in New York City. CAV is an annual conference dedicated to the advancement of the theory and practice of computer-aided formal analysis methods for hardware and software sys- tems. The primary focus of CAV is to extend the frontiers of veri fi cation techniques by expanding to new domains such as security, quantum computing, and machine learning. This put CAV at the cutting edge of formal methods research, and this year ’ s program is a re fl ection of this commitment. CAV 2019 received a very high number of submissions (258). We accepted 13 tool papers, two case studies, and 52 regular papers, which amounts to an acceptance rate of roughly 26%. The accepted papers cover a wide spectrum of topics, from theoretical results to applications of formal methods. These papers apply or extend formal methods to a wide range of domains such as concurrency, learning, and industrially deployed systems. The program featured invited talks by Dawn Song (UC Berkeley), Swarat Chaudhuri (Rice University), and Ken McMillan (Microsoft Research) as well as invited tutorials by Emina Torlak (University of Washington) and Ranjit Jhala (UC San Diego). Furthermore, we continued the tradition of Logic Lounge, a series of discus- sions on computer science topics targeting a general audience. In addition to the main conference, CAV 2019 hosted the following workshops: The Best of Model Checking (BeMC) in honor of Orna Grumberg, Design and Analysis of Robust Systems (DARS), Veri fi cation Mentoring Workshop (VMW), Numerical Software Veri fi cation (NSV), Veri fi ed Software: Theories, Tools, and Experiments (VSTTE), Democratizing Software Veri fi cation, Formal Methods for ML-Enabled Autonomous Systems (FoMLAS), and Synthesis (SYNT). Organizing a top conference like CAV requires a great deal of effort from the community. The Program Committee for CAV 2019 consisted of 79 members, a committee of this size ensures that each member has to review a reasonable number of papers in the allotted time. In all, the committee members wrote over 770 reviews while investing signi fi cant effort to maintain and ensure the high quality of the conference program. We are grateful to the CAV 2019 Program Committee for their outstanding efforts in evaluating the submissions and making sure that each paper got a fair chance. Like last year ’ s CAV, we made artifact evaluation mandatory for tool submissions and optional but encouraged for the rest of the accepted papers. The Artifact Evaluation Committee consisted of 27 reviewers who put in signi fi cant effort to evaluate each artifact. The goal of this process was to provide constructive feedback to tool devel- opers and help make the research published in CAV more reproducible. The Artifact Evaluation Committee was generally quite impressed by the quality of the artifacts, and, in fact, all accepted tools passed the artifact evaluation. Among regular papers, 65% of the authors submitted an artifact, and 76% of these artifacts passed the eval- uation. We are also very grateful to the Artifact Evaluation Committee for their hard work and dedication in evaluating the submitted artifacts. CAV 2019 would not have been possible without the tremendous help we received from several individuals, and we would like to thank everyone who helped make CAV 2019 a success. First, we would like to thank Yu Feng and Ruben Martins for chairing the Artifact Evaluation Committee and Zvonimir Rakamaric for maintaining the CAV website and social media presence. We also thank Oksana Tkachuk for chairing the workshop organization process, Peter O ’ Hearn for managing sponsorship, and Thomas Wies for arranging student fellowships. We also thank Loris D ’ Antoni, Rayna Dimitrova, Cezara Dragoi, and Anthony W. Lin for organizing the Veri fi cation Mentoring Workshop and working closely with us. Last but not least, we would like to thank Kostas Ferles, Navid Yaghmazadeh, and members of the CAV Steering Committee (Ken McMillan, Aarti Gupta, Orna Grumberg, and Daniel Kroening) for helping us with several important aspects of organizing CAV 2019. We hope that you will fi nd the proceedings of CAV 2019 scienti fi cally interesting and thought-provoking! June 2019 Isil Dillig Serdar Tasiran vi Preface Organization Program Chairs Isil Dillig The University of Texas at Austin, USA Serdar Tasiran Amazon, USA Workshop Chair Oksana Tkachuk Amazon, USA Publicity Chair Zvonimir Rakamaric University of Utah, USA Sponsorship Chair Peter O ’ Hearn Facebook, USA Fellowship Chair Thomas Wies NYU, USA CAV Award Committee Natarajan Shankar SRI International, USA Pierre Wolper Liege University, Belgium Somesh Jha University of Wisconsin, USA Parosh Abdulla Uppsala University, Sweden Program Committee Aws Albarghouthi University of Wisconsin-Madison, USA Jade Alglave University College London, UK Rajeev Alur University of Pennsylvania, USA Christel Baier TU Dresden, Germany Gilles Barthe Max Planck Institute for Security and Privacy, Germany; IMDEA Software Institute, Spain Osbert Bastani University of Pennsylvania, USA Josh Berdine Facebook, USA Per Bjesse Synopsys Inc., USA Nikolaj Bjorner Microsoft, USA Roderick Bloem Graz University of Technology, Austria Marc Brockschmidt Microsoft, UK Pavol Cerny University of Colorado Boulder, USA Swarat Chaudhuri Rice University, USA Wei-Ngan Chin National University of Singapore Adam Chlipala Massachusetts Institute of Technology, USA Hana Chockler King ’ s College London, UK Eva Darulova Max Planck Institute for Software Systems, Germany Cristina David University of Cambridge, UK Dana Drachsler Cohen ETH Zurich, Switzerland Cezara Dragoi Inria Paris, ENS, France Constantin Enea IRIF, University of Paris Diderot, France Azadeh Farzan University of Toronto, Canada Grigory Fedyukovich Princeton University, USA Yu Feng University of California, Santa Barbara, USA Dana Fisman Ben-Gurion University, Israel Milos Gligoric The University of Texas at Austin, USA Patrice Godefroid Microsoft, USA Laure Gonnord University of Lyon/Laboratoire d ’ Informatique du Parall é lisme, France Aarti Gupta Princeton University, USA Arie Gur fi nkel University of Waterloo, Canada Klaus Havelund Jet Propulsion Laboratory, USA Chris Hawblitzel Microsoft, USA Alan J. Hu The University of British Columbia, Canada Shachar Itzhaky Technion, Israel Franjo Ivancic Google, USA Ranjit Jhala University of California San Diego, USA Rajeev Joshi Automated Reasoning Group, Amazon Web Services, USA Dejan Jovanovi ć SRI International, USA Laura Kovacs Vienna University of Technology, Austria Burcu Kulahcioglu Ozkan MPI-SWS, Germany Marta Kwiatkowska University of Oxford, UK Shuvendu Lahiri Microsoft, USA Akash Lal Microsoft, India Stephen Magill Galois, Inc., USA Joao Marques-Silva Universidade de Lisboa, Portugal Ruben Martins Carnegie Mellon University, USA Ken McMillan Microsoft, USA Vijay Murali Facebook, USA Peter M ü ller ETH Zurich, Switzerland Mayur Naik Intel, USA Hakjoo Oh Korea University, South Korea Oded Padon Stanford University, USA Corina Pasareanu CMU/NASA Ames Research Center, USA Ruzica Piskac Yale University, USA viii Organization Nir Piterman University of Gothenburg, Sweden Pavithra Prabhakar Kansas State University, USA Sylvie Putot LIX, Ecole Polytechnique, France Grigore Rosu University of Illinois at Urbana-Champaign, USA Dorsa Sadigh Stanford University, USA Roopsha Samanta Purdue University, USA Sriram Sankaranarayanan University of Colorado, Boulder, USA Koushik Sen University of California, Berkeley, USA Sanjit A. Seshia University of California, Berkeley, USA Natarajan Shankar SRI International, USA Rahul Sharma Microsoft, USA Natasha Sharygina Universit à della Svizzera italiana (USI Lugano), Switzerland Sharon Shoham Tel Aviv University, Israel Alexandra Silva University College London, UK Rishabh Singh Google, USA Anna Slobodova Centaur Technology, USA Marcelo Sousa University of Oxford, UK Cesare Tinelli The University of Iowa, USA Ufuk Topcu University of Texas at Austin, USA Caterina Urban Inria, France Margus Veanes Microsoft, USA Yakir Vizel The Technion, Israel Chao Wang USC, USA Georg Weissenbacher Vienna University of Technology, Austria Eran Yahav Technion, Israel Hongseok Yang KAIST, South Korea Artifact Evaluation Committee Uri Alon Technion, Israel Yaniv David Technion, Israel Yufei Ding University of California, Santa Barbara, USA Yu Feng (Co-chair) University of California, Santa Barbara, USA Radu Grigore University of Kent, UK Saurabh Joshi IIIT Hyderabad, India William Hallahan Yale University, USA Travis Hance Carnegie Mellon University, USA Marijn Heule The University of Texas at Austin, USA Antti Hyv ä rinen University of Lugano, Switzerland Alexey Ignatiev Universidade de Lisboa, Portugal Tianhan Lu University of Colorado Boulder, USA Ruben Martins (Co-chair) Carnegie Mellon University, USA Aina Niemetz Stanford University, USA Filip Nik š i ć University of Pennsylvania, USA Lauren Pick Princeton University, USA Organization ix Sorawee Porncharoenwase University of Washington, USA Mathias Preiner Stanford University, USA Talia Ringer University of Washington, USA John Sarracino University of California San Diego, USA Xujie Si University of Pennsylvania, USA Calvin Smith University of Wisconsin-Madison, USA Caleb Stanford University of Pennsylvania, USA Miguel Terra-Neves INESC-ID/IST, Universidade de Lisboa, Portugal Jacob Van Geffen University of Washington, USA Xinyu Wang The University of Texas at Austin, USA Wei Yang The University of Texas at Dallas, USA Mentoring Workshop Organizing Committee Loris D ’ Antoni (Chair) University of Wisconsin, USA Anthony Lin Oxford University, UK Cezara Dragoi Inria, France Rayna Dimitrova University of Leicester, UK Steering Committee Ken McMillan Microsoft, USA Aarti Gupta Princeton, USA Orna Grunberg Technion, Israel Daniel Kroening University of Oxford, UK Additional Reviewers Sepideh Asadi Lucas Asadi Haniel Barbosa Ezio Bartocci Sam Bartocci Suda Bharadwaj Erdem Biyik Martin Biyik Timothy Bourke Julien Braine Steven Braine Benjamin Caul fi eld Eti Chaudhary Xiaohong Chaudhary Yinfang Chen Andreea Costea Murat Costea Emanuele D ’ Osualdo Nicolas Dilley Marko Dilley Bruno Dutertre Marco Eilers Cindy Eilers Yotam Feldman Jerome Feret Daniel Feret Mahsa Ghasemi Shromona Ghosh Anthony Ghosh Bernhard Gleiss Shilpi Goel William Goel Mirazul Haque Ludovic Henrio x Organization Andreas Henrio Antti Hyv ä rinen Duligur Ibeling Rinat Ibeling Nouraldin Jaber Swen Jacobs Maximilian Jacobs Susmit Jha Anja Karl Jens Karl Sean Kauffman Ayrat Khalimov Bettina Khalimov Hillel Kugler Daniel Larraz Christopher Larraz Wonyeol Lee Matt Lewis Wenchao Lewis Kaushik Mallik Matteo Marescotti David Marescotti Dmitry Mordvinov Matthieu Moy Thanh Toan Moy Victor Nicolet Andres Noetzli Abraham Noetzli Saswat Padhi Karl Palmskog Rong Palmskog Daejun Park Brandon Paulsen Lucas Paulsen Adi Yoga Prabawa Dhananjay Raju Andrew Raju Heinz Riener Sriram Sankaranarayanan Mark Sankaranarayanan Yagiz Savas Traian Florin Serbanuta Fu Serbanuta Yahui Song Pramod Subramanyan Rob Subramanyan Sol Swords Martin Tappler Ta Quang Tappler Anthony Vandikas Marcell Vazquex-Chanlatte Yuke Vazquex-Chanlatte Min Wen Josef Widder Bo Widder Haoze Wu Zhe Xu May Xu Yi Zhang Zhizhou Zhang Organization xi Contents – Part II Logics, Decision Procedures, and Solvers Satisfiability Checking for Mission-Time LTL . . . . . . . . . . . . . . . . . . . . . . 3 Jianwen Li, Moshe Y. Vardi, and Kristin Y. Rozier High-Level Abstractions for Simplifying Extended String Constraints in SMT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 Andrew Reynolds, Andres N ö tzli, Clark Barrett, and Cesare Tinelli Alternating Automata Modulo First Order Theories . . . . . . . . . . . . . . . . . . . 43 Radu Iosif and Xiao Xu Q3B: An Efficient BDD-based SMT Solver for Quantified Bit-Vectors . . . . . 64 Martin Jon á š and Jan Strej č ek CVC 4 SY : Smart and Fast Term Enumeration for Syntax-Guided Synthesis . . . . 74 Andrew Reynolds, Haniel Barbosa, Andres N ö tzli, Clark Barrett, and Cesare Tinelli Incremental Determinization for Quantifier Elimination and Functional Synthesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84 Markus N. Rabe Numerical Programs Loop Summarization with Rational Vector Addition Systems . . . . . . . . . . . . 97 Jake Silverman and Zachary Kincaid Invertibility Conditions for Floating-Point Formulas . . . . . . . . . . . . . . . . . . 116 Martin Brain, Aina Niemetz, Mathias Preiner, Andrew Reynolds, Clark Barrett, and Cesare Tinelli Numerically-Robust Inductive Proof Rules for Continuous Dynamical Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137 Sicun Gao, James Kapinski, Jyotirmoy Deshmukh, Nima Roohi, Armando Solar-Lezama, Nikos Arechiga, and Soonho Kong Icing: Supporting Fast-Math Style Optimizations in a Verified Compiler . . . . 155 Heiko Becker, Eva Darulova, Magnus O. Myreen, and Zachary Tatlock Sound Approximation of Programs with Elementary Functions . . . . . . . . . . . 174 Eva Darulova and Anastasia Volkova Verification Formal Verification of Quantum Algorithms Using Quantum Hoare Logic . . . 187 Junyi Liu, Bohua Zhan, Shuling Wang, Shenggang Ying, Tao Liu, Yangjia Li, Mingsheng Ying, and Naijun Zhan S EC CSL: Security Concurrent Separation Logic. . . . . . . . . . . . . . . . . . . . . . 208 Gidon Ernst and Toby Murray Reachability Analysis for AWS-Based Networks. . . . . . . . . . . . . . . . . . . . . 231 John Backes, Sam Bayless, Byron Cook, Catherine Dodge, Andrew Gacek, Alan J. Hu, Temesghen Kahsai, Bill Kocik, Evgenii Kotelnikov, Jure Kukovec, Sean McLaughlin, Jason Reed, Neha Rungta, John Sizemore, Mark Stalzer, Preethi Srinivasan, Pavle Suboti ć , Carsten Varming, and Blake Whaley Distributed Systems and Networks Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 245 Idan Berkovits, Marijana Lazi ć , Giuliano Losa, Oded Padon, and Sharon Shoham Gradual Consistency Checking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 267 Rachid Zennou, Ahmed Bouajjani, Constantin Enea, and Mohammed Erradi Checking Robustness Against Snapshot Isolation . . . . . . . . . . . . . . . . . . . . 286 Sidi Mohamed Beillahi, Ahmed Bouajjani, and Constantin Enea Efficient Verification of Network Fault Tolerance via Counterexample-Guided Refinement. . . . . . . . . . . . . . . . . . . . . . . . . . . 305 Nick Giannarakis, Ryan Beckett, Ratul Mahajan, and David Walker On the Complexity of Checking Consistency for Replicated Data Types . . . . 324 Ranadeep Biswas, Michael Emmi, and Constantin Enea Communication-Closed Asynchronous Protocols . . . . . . . . . . . . . . . . . . . . . 344 Andrei Damian, Cezara Dr ă goi, Alexandru Militaru, and Josef Widder Verification and Invariants Interpolating Strong Induction. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 367 Hari Govind Vediramana Krishnan, Yakir Vizel, Vijay Ganesh, and Arie Gurfinkel xiv Contents – Part II Verifying Asynchronous Event-Driven Programs Using Partial Abstract Transformers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 386 Peizun Liu, Thomas Wahl, and Akash Lal Inferring Inductive Invariants from Phase Structures . . . . . . . . . . . . . . . . . . 405 Yotam M. Y. Feldman, James R. Wilcox, Sharon Shoham, and Mooly Sagiv Termination of Triangular Integer Loops is Decidable . . . . . . . . . . . . . . . . . 426 Florian Frohn and J ü rgen Giesl AliveInLean: A Verified LLVM Peephole Optimization Verifier . . . . . . . . . . 445 Juneyoung Lee, Chung-Kil Hur, and Nuno P. Lopes Concurrency Automated Parameterized Verification of CRDTs . . . . . . . . . . . . . . . . . . . . 459 Kartik Nagar and Suresh Jagannathan What ’ s Wrong with On-the-Fly Partial Order Reduction. . . . . . . . . . . . . . . . 478 Stephen F. Siegel Integrating Formal Schedulability Analysis into a Verified OS Kernel . . . . . . 496 Xiaojie Guo, Maxime Lesourd, Mengqi Liu, Lionel Rieg, and Zhong Shao Rely-Guarantee Reasoning About Concurrent Memory Management in Zephyr RTOS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 515 Yongwang Zhao and David San á n Violat: Generating Tests of Observational Refinement for Concurrent Objects. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 534 Michael Emmi and Constantin Enea Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 547 Contents – Part II xv Contents – Part I Automata and Timed Systems Symbolic Register Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Loris D ’ Antoni, Tiago Ferreira, Matteo Sammartino, and Alexandra Silva Abstraction Refinement Algorithms for Timed Automata . . . . . . . . . . . . . . . 22 Victor Roussanaly, Ocan Sankur, and Nicolas Markey Fast Algorithms for Handling Diagonal Constraints in Timed Automata. . . . . 41 Paul Gastin, Sayan Mukherjee, and B. Srivathsan Safety and Co-safety Comparator Automata for Discounted-Sum Inclusion. . . 60 Suguman Bansal and Moshe Y. Vardi Clock Bound Repair for Timed Systems . . . . . . . . . . . . . . . . . . . . . . . . . . 79 Martin K ö lbl, Stefan Leue, and Thomas Wies Verifying Asynchronous Interactions via Communicating Session Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 Julien Lange and Nobuko Yoshida Security and Hyperproperties Verifying Hyperliveness. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121 Norine Coenen, Bernd Finkbeiner, C é sar S á nchez, and Leander Tentrup Quantitative Mitigation of Timing Side Channels . . . . . . . . . . . . . . . . . . . . 140 Saeid Tizpaz-Niari, Pavol Č ern ý , and Ashutosh Trivedi Property Directed Self Composition. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 161 Ron Shemer, Arie Gurfinkel, Sharon Shoham, and Yakir Vizel Security-Aware Synthesis Using Delayed-Action Games . . . . . . . . . . . . . . . 180 Mahmoud Elfar, Yu Wang, and Miroslav Pajic Automated Hypersafety Verification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 200 Azadeh Farzan and Anthony Vandikas Automated Synthesis of Secure Platform Mappings . . . . . . . . . . . . . . . . . . . 219 Eunsuk Kang, St é phane Lafortune, and Stavros Tripakis Synthesis Synthesizing Approximate Implementations for Unrealizable Specifications . . . 241 Rayna Dimitrova, Bernd Finkbeiner, and Hazem Torfah Quantified Invariants via Syntax-Guided Synthesis . . . . . . . . . . . . . . . . . . . 259 Grigory Fedyukovich, Sumanth Prabhu, Kumar Madhukar, and Aarti Gupta Efficient Synthesis with Probabilistic Constraints . . . . . . . . . . . . . . . . . . . . 278 Samuel Drews, Aws Albarghouthi, and Loris D ’ Antoni Membership-Based Synthesis of Linear Hybrid Automata . . . . . . . . . . . . . . 297 Miriam Garc í a Soto, Thomas A. Henzinger, Christian Schilling, and Luka Zeleznik Overfitting in Synthesis: Theory and Practice . . . . . . . . . . . . . . . . . . . . . . . 315 Saswat Padhi, Todd Millstein, Aditya Nori, and Rahul Sharma Proving Unrealizability for Syntax-Guided Synthesis . . . . . . . . . . . . . . . . . . 335 Qinheping Hu, Jason Breck, John Cyphert, Loris D ’ Antoni, and Thomas Reps Model Checking BMC for Weak Memory Models: Relation Analysis for Compact SMT Encodings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 355 Natalia Gavrilenko, Hern á n Ponce-de-Le ó n, Florian Furbach, Keijo Heljanko, and Roland Meyer When Human Intuition Fails: Using Formal Methods to Find an Error in the “ Proof ” of a Multi-agent Protocol . . . . . . . . . . . . . . . . . . . . . . . . . . 366 Jennifer A. Davis, Laura R. Humphrey, and Derek B. Kingston Extending NUXMV with Timed Transition Systems and Timed Temporal Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 376 Alessandro Cimatti, Alberto Griggio, Enrico Magnago, Marco Roveri, and Stefano Tonetta Cerberus-BMC: A Principled Reference Semantics and Exploration Tool for Concurrent and Sequential C . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 387 Stella Lau, Victor B. F. Gomes, Kayvan Memarian, Jean Pichon-Pharabod, and Peter Sewell xviii Contents – Part I Cyber-Physical Systems and Machine Learning Multi-armed Bandits for Boolean Connectives in Hybrid System Falsification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 401 Zhenya Zhang, Ichiro Hasuo, and Paolo Arcaini StreamLAB: Stream-based Monitoring of Cyber-Physical Systems . . . . . . . . 421 Peter Faymonville, Bernd Finkbeiner, Malte Schledjewski, Maximilian Schwenger, Marvin Stenger, Leander Tentrup, and Hazem Torfah V ERIF AI: A Toolkit for the Formal Design and Analysis of Artificial Intelligence-Based Systems. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 432 Tommaso Dreossi, Daniel J. Fremont, Shromona Ghosh, Edward Kim, Hadi Ravanbakhsh, Marcell Vazquez-Chanlatte, and Sanjit A. Seshia The Marabou Framework for Verification and Analysis of Deep Neural Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 443 Guy Katz, Derek A. Huang, Duligur Ibeling, Kyle Julian, Christopher Lazarus, Rachel Lim, Parth Shah, Shantanu Thakoor, Haoze Wu, Aleksandar Zelji ć , David L. Dill, Mykel J. Kochenderfer, and Clark Barrett Probabilistic Systems, Runtime Techniques Probabilistic Bisimulation for Parameterized Systems (with Applications to Verifying Anonymous Protocols) . . . . . . . . . . . . . . . . 455 Chih-Duo Hong, Anthony W. Lin, Rupak Majumdar, and Philipp R ü mmer Semi-quantitative Abstraction and Analysis of Chemical Reaction Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 475 Milan Č e š ka and Jan K ř et í nsk ý PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 497 Pranav Ashok, Jan K ř et í nsk ý , and Maximilian Weininger Symbolic Monitoring Against Specifications Parametric in Time and Data . . . 520 Masaki Waga, É tienne Andr é , and Ichiro Hasuo STAMINA: STochastic Approximate Model-Checker for INfinite-State Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 540 Thakur Neupane, Chris J. Myers, Curtis Madsen, Hao Zheng, and Zhen Zhang Contents – Part I xix Dynamical, Hybrid, and Reactive Systems Local and Compositional Reasoning for Optimized Reactive Systems . . . . . . 553 Mitesh Jain and Panagiotis Manolios Robust Controller Synthesis in Timed B ü chi Automata: A Symbolic Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 572 Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier, and Ocan Sankur Flexible Computational Pipelines for Robust Abstraction-Based Control Synthesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 591 Eric S. Kim, Murat Arcak, and Sanjit A. Seshia Temporal Stream Logic: Synthesis Beyond the Bools . . . . . . . . . . . . . . . . . 609 Bernd Finkbeiner, Felix Klein, Ruzica Piskac, and Mark Santolucito Run-Time Optimization for Learned Controllers Through Quantitative Games . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 630 Guy Avni, Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger, Bettina K ö nighofer, and Stefan Pranger Taming Delays in Dynamical Systems: Unbounded Verification of Delay Differential Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 650 Shenghua Feng, Mingshuai Chen, Naijun Zhan, Martin Fr ä nzle, and Bai Xue Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 671 xx Contents – Part I Logics, Decision Procedures, and Solvers