Table of Contents

Title page; Preface; Committees; Contents; Number-Set Representations for Infinite-State Verification; Regular Model Checking for Programs with Dynamic Memory; Automatic Verification of Security Properties Based on Abstractions; Grand Challenge: Model Check Software; A Class of Automata for Computing Reachability Relations in Timed Systems; Practical Infinite-State Verification with Temporal Reasoning; Quantum States and Quantum Measurements; Automatic Test Generation and Monitoring of Infinite States Systems; Cryptographic Primitives Can Be Fragile. Provides information for researchers interested in the development of mathematical techniques for the analysis of infinite state systems. The papers come from a successful workshop.