Abstraction and Learning for Infinite-State Compositional Verification

Despite many advances that enable the application of model checking techniques to the verification of large systems, the state-explosion problem remains the main challenge for scalability. Compositional verification addresses this challenge by decomposing the verification of a large system into the verification of its components. Recent techniques use learning-based approaches to automate compositional verification based on the assume-guarantee style reasoning. However, these techniques are only applicable to finite-state systems. In this work, we propose a new framework that interleaves abstraction and learning to perform automated compositional verification of infinite-state systems. We also discuss the role of learning and abstraction in the related context of interface generation for infinite-state components.Comment: In Proceedings Festschrift for Dave Schmidt, arXiv:1309.455

Transforming opacity verification to nonblocking verification in modular systems

We consider the verification of current-state and K-step opacity for systems modeled as interacting non-deterministic finite-state automata. We describe a new methodology for compositional opacity verification that employs abstraction, in the form of a notion called opaque observation equivalence, and that leverages existing compositional nonblocking verification algorithms. The compositional approach is based on a transformation of the system, where the transformed system is nonblocking if and only if the original one is current-state opaque. Furthermore, we prove that $K$-step opacity can also be inferred if the transformed system is nonblocking. We provide experimental results where current-state opacity is verified efficiently for a large scaled-up system

Imperfect state verification and financial contracting

An argument that in a costly state verification model of financial contracting, relaxing the assumption of perfect verification makes the measurement of information difficult.Contracts ; Information theory

General equilibrium with private state verification

We study general equilibrium with private and incomplete state verification. Trade is agreed ex ante, that is, before private information is received. It is useful to define a list of bundles as a derivative good that gives an agent the right to receive one of the bundles in the list. Enforceable trade agreements can be described by Pi-measurable plans of lists of bundles, instead of Pi-measurable plans of bundles as in Radner (1968). In equilibrium, the price of a list coincides with the price of the cheapest bundle in the list, and it is always the cheapest bundle of the list that is delivered. This property leads to a system of linear inequalities which are deliverability constraints on the choice set. We investigate existence of equilibrium in the case in which preferences are Pi-measurable. If there is a perfectly informed trader in the economy, existence of equilibrium is guaranteed.General equilibrium, Differential information, Verifiability, Uncertain delivery, Lists of bundles, Rational expectations