P. de Villiers and W. Visser. ESML---A Validation Language for Concurrent Systems. In Judy Bishop, editor, 7-th Southern African Computer Symposium, pages 59--64, July 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An LTL Verification System Based on Automata Theory - van Wyk (1999) (Correct)
....the branching time temporal logic CTL (Computation Tree Logic) to use the linear time temporal logic LTL (Linear Time Logic) The CTL model checker was developed at the University of Stellenbosch. In this model checker, the system to be verified is expressed in the specification language ESML [8], based on CSP [15] The modular design of the model checker made it easy to extend. To support the checking of LTL correctness properties, only the module which implements the model checking algorithm had to be replaced. An automata theoretic approach was used, in which both the system to be ....
....and 4.1) and the definitions of p and q replace the CTL formula. The same correctness property as specified in CTL can now be specified in LTL as follows: G(p ) Fq) Further details of the ESML language and compiler fall beyond the scope of this thesis, but the interested reader is referred to [8]. In the next section, the state generator is explained. It builds the state graph of the ESML model on demand, by generating new states as they are requested by the analyser. 4.2 The state generator The state generator builds the state graph of the ESML model, and is responsible for the cache, ....
P.J.A. de Villiers and W. Visser. ESML---a validation language for concurrent systems. In Judy Bishop, editor, 7th Southern African Computer Symposium, pages 59--64, July 1992.
An on-the-fly validation system for CTL - de Villiers, Visser (1995) Self-citation (De villiers Visser) (Correct)
....ESML A process based validation language called ESML is used to specify the behaviour of reactive systems. ESML is a strongly typed language based on CSP. Only a short overview of the validation language will be given here. Readers interested in a detailed description of ESML are referred to [3]. Correctness properties to be validated are expressed in CTL. Extended state machines (ESMs) were chosen to model reactive programs. The state machine formalism is one of the oldest and most widely accepted models of computation and allows natural descriptions of the dynamic behaviour of complex ....
P. de Villiers and W. Visser. ESML---A Validation Language for Concurrent Systems. In Judy Bishop, editor, 7-th Southern African Computer Symposium, pages 59--64, July 1992.
Runtime Efficient State Compaction in SPIN - Geldenhuys, de Villiers (1999) Self-citation (De villiers) (Correct)
....of state compression techniques. The first four rows of measurements were taken directly from the literature, while the last two rows were measured on a 400MHz Pentium II. definable types are used instead of the predefined fixed types of Promela. In fact, based on our experience with ESML [2] a specification language similar to Promela we know that it requires little extra effort of users to define the ranges of variables more precisely. When it comes to the implementation of such models, it is trivial to find the optimal representation for integer subranges. We have demonstrated ....
P. J. A. de Villiers and W. C. Visser. ESML---a validation language for concurrent systems. South African Computer Journal, 7:59--64, July 1992.
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