We describe a framework for compositional verification of finite state processes. The framework is based on two ideas: a subset of the logic CTL for which satisfaction is preserved under composition; and a preorder on structures which captures the relation between a component and a system

A simple sequential reasoning approach for sound

We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompose the verification of large software systems into subproblems of manageable complexity. The decomposition reflects

Modular verification of shared data structures is a challenging prob-lem: Side-effects in one module that are observable in another mod-ule make it hard to analyze each module separately. We present a novel approach for modular verification of shared data structures. Our main idea is to verify

Abstract. Synchronous languages have been proposed to specify reactive Real-Time systems. Since such systems are used in safety critical areas, their formal verification is crucial. For machine and human efficiency, modular verification is advisable. For the synchronous language Argos, a Statechart

Real-Time system, the modular verification from the point of view of the refining program is best achieved with observers. 1

tenets such as abstraction and parameterization. The paper presents a modular verification system that is based on both contracts of functional behavior and performance. The system is designed to handle the necessary complexity in using non-trivial, generic objects, where performance estimates cannot

verification of performance in addition to functionality, addressing both time and space constraints. The modularity of the system makes it possible to verify performance correctness of a module or procedure locally, relative to the procedure itself. The proposed rules can be automated and are intended

-Time system, the modular verification from the point of view of the refining program is best achieved with observers. 1 Introduction Reactive systems are Real-Time systems that continuously react to stimuli from their environment. They are often embedded in electronic products, mass transportation systems

the behavior of CA-objects. Based on CAL, we develop a thread- and procedure-modular verification technique for reasoning about CA-objects and their clients. Using our new technique, we present the first proof of linearizability of the elimination stack of Hendler et al. [10] in which the stack’s elimination