| T. Bultan. Action Language: A specification language for model checking reactive systems. In Proceedings of the 22nd International Conference on Software Engineering (ICSE '00), pages 335--344. IEEE Computer Society Press, June 2000. |
No context found.
T. Bultan. Action language: A specification language for model checking reactive systems. In Proceedings of the 22nd International Conference on Software Engineering (ICSE 2000), pages 335--344, June 2000.
....developing reliable concurrent programs. First aspect of our approach is to start with a specification of the concurrency control component of the program rather than its implementation. We use monitors as the underlying concurrency control primitive. We present a monitor model in Action Language [4]. Action Language is a specification language for reactive software systems. It supports both synchronous and asynchronous compositions and hierarchical specifications. We show that monitors can be specified in Action Language using asynchronously composed modules. Our monitor model in Action ....
T. Bultan. Action Language: A specification language for model checking reactive systems. In Proceedings of the 22nd International Conference on Software Engineering (ICSE 2000.
.... we studied two different approaches: 1) approximate a specification with a finite state model (machine) and use symbolic model checker (SMV) to verify the properties; 2) model a specification with infinite states and use infinite state verification tools such as the Action Verifier [31, 2]. As we show in [12, 13] new techniques are needed in order to make the verification process practical. A main difference between e service models [6, 5, 11] and decision flow language Vortex [18] is that new processes are dynamically created in response to events that may not be predictable. A ....
....that BDD symbolic representations are specialized for encoding boolean variables and become inefficient when used to represent integer constraints. In stead we can use infinite state representations based on linear arithmetic constraints [1, 3, 16] to solve this problem. Action Language Verifier [2], based upon Composite Symbolic Library [31] that manipulates both BDD and Presburger package, is such an infinite state symbolic model checker. Action Language specifications are modular, each module is defined as a composition of its actions and submodules. The similarity of syntax allowed us to ....
T. Bultan. Action language: A specification language for model checking reactive systems. In Proceedings of the 22nd International Conference on Software Engineering (ICSE 2000), pages 335--344, June 2000.
....of the Composite Symbolic Library makes it possible to write polymorphic verification procedures, i.e. verification procedures that dynamically select symbolic representations based on the input specification. The input language of the Composite Symbolic Library is called the Action Language [Bul00] Action Language is a specification language for reactive software systems which supports both synchronous and asynchronous compositions and hierarchical specifications; currently, it supports Boolean, enumerated, and integer types. In this setting, a specification consists of a set of modules ....
T. Bultan. Action Language: A specification language for model checking reactive systems. In Proc. ICSE '00, pp. 335--344, 2000.
....Language Verifier to achieve convergence. 1. Introduction Action Language Verifier is an infinite state CTL model checker based on Action Language, a formal specification language for reactive systems. Action Language supports both synchronous and asynchronous compositions as basic operations [2]. Translations of Statecharts [9] and SCR [10] specifications to Action Language are compact and Action Language translations preserve the original structure of the specifications. Action Language Verifier translates an Action Language specification to a composite symbolic representation provided ....
....unprimed variables denote the current state values. Asynchronous composition of two actions a 1 and a 2 , denoted a 1 a 2 , is defined as the disjunction of their transition relations. However, we also assume that an action preserves the values of the variables which are not modified by itself [2]. Two actions a 1 and a 2 can also be combined with synchronous composition a 1 a 2 . Semantics of synchronous composition corresponds to conjunction if two actions are always enabled. However, if one component of synchronous composition is not enabled in a state, this would deadlock the ....
[Article contains additional citation context not shown here]
T. Bultan. Action language: A specification language for model checking reactive systems. In Proc. of the 22nd International Conference on Software Engineering, pages 335-- 344, June 2000.
No context found.
T. Bultan. Action Language: A specification language for model checking reactive systems. In Proceedings of the 22nd International Conference on Software Engineering (ICSE '00), pages 335--344. IEEE Computer Society Press, June 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC