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

Behavioral an real-time verification of a pipeline in the COSMA environment

The case study analyzed in the paper illustrates the example of model checking in the COSMA environment. The system itself is a three-stage pipeline consisting of mutually concurrent modules which also compete for a shared resource. System components are specified in terms of Concurrent State Machines (CSM) The paper shows verification of behavioral properties, model reduction technique, analysis of counter-example and checking of real time properties

The use of model checking and the COSMA environment in the design of reactive systems

The paper discusses how a bridge between the design practice and the formal methods could be maintained. The use of model checking seems to be the most promising approach. Then, the software environment COSMA is presented, implementated in the Institute of Computer Science,WUT. The conceptual framework of COSMA is based upon Concurrent State Machines (CSM) and Extended CSM, which are also briefly summarized and illustrated with a simple example

Apollo Spacecraft Integrated Checkout Planning

The Apollo pa^loads, Command Module, Service Module, and Lunar Excursion Module require long range integrated checkout planning to assure mutual checkout compatibility and launch vehicle/spacecraft checkout compatibility. This function, performed in support of NASA\u27s Checkout and Test Division of the Manned Spacecraft Center, provides integrated checkout planning on an inter-center and intercontractor level. The end product results in NASA approved checkout flows and activities, in conjunction with their related ground support equipment, which delineate optimized prelaunch checkout operations and requirements. This presentation describes some of the aspects of the integrated checkout planning activity and gives examples of benefits derived from this task