This book constitutes the refereed proceedings of the 15th International Symposium on Automated Technology for Verification and Analysis, ATVA 2017, held in Pune, India, in October 2017. The 22 full and 7 short papers presented in this volume were carefully reviewed and selected from 78 submissions. The book also contains one invited talk in full-paper length. The contributions are organized in topical sections named: program analysis; model checking and temporal logics; neural networks; learning and invariant synthesis; and hybrid systems and control.

This book constitutes the refereed proceedings of the 16th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2015, held in Mumbai, India, in January 2015. The 24 revised full papers presented were carefully reviewed and selected from 53 submissions. The papers cover a wide range of topics including program verification, model checking, abstract interpretation, abstract domains, program synthesis, static analysis, deductive methods, program certification, error diagnosis, program transformation, and hybrid and cyberphysical systems.

Information flow properties are a way of specifying security properties of systems. A system is viewed as generating traces containing "confidential" and "visible" events (only the latter being observable by a "low-level" user) and the information flow properties specify restrictions on the kind of traces the system may generate, so as to restrict the amount of information a low-level user can infer about confidential events having taken place (or not) in an execution. Mantel identifies "basic security predicates" or BSPs and shows them to be the building blocks of most of the known trace-based properties in the literature. Traditionally BSPs have been reasoned about via unwinding conditions that capture whether a system satisfies a particular BSP. First, we show that the checking of unwinding conditions can be simplified to checking conditions on a maximal simulation relation. Second, we show that the BSPs can be characterized in terms of regularity preserving language-theoretic operations. This leads to a decision procedure for checking whether a finite state system satisfies a given BSP. Finally, we prove that the problem of verifying BSPs for pushdown systems is undecidable.