Holzmann, G.J., "The Pandora system -- an interactive system for the design of data communication protocols," Computer Networks, Vol. 8, No. 2, (1984), pp 71-81.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....execution [3,4,5,16,17] It is probably safe to say that symbolic execution in one form or another is at the core of most existing and planned automated protocol validation systems today. It is the basis of all CSP [10] and CCS like [15] evaluation systems, the Pandora algebraic validation system [11,12], the S R validator [1] temporal logic based systems such as the CarnegieMellon model checker [6] etc. The pitfalls of symbolic execution are equally well known: the size of the state space and the time it may take to inspect all reachable states in it can rise dramatically with the problem size ....

Holzmann, G.J., "The Pandora system -- an interactive system for the design of data communication protocols," Computer Networks, Vol. 8, No. 2, (1984), pp 71-81.

....the protocol language as defined above. To avoid confusion, note that the protocol specification language is the language that describes the protocol; the protocol language, however, is the language described by the protocol itself. A general overview of the Pandora system is presented in [5]. In this paper we will discuss some new features of the system now being developed at the Delft University of Technology. First, in section 2, we will give an overview of the tools that make up the programming environment of the Pandora system. In section 3 we discuss the construction of the ....

G.J. Holzmann, The Pandora System: an interactive system for the design of data communication protocols. To appear in: Computer Networks (1983).

....used in Algorithm 1. Such a search, termed Type 3 or stack search algorithm in [Hol90] reduces the memory requirements while still guaranteeing a complete exploration of any finite state space. This strategy was used in, for instance, the first Pan system [Hol81] and in the Pandora system [Hol84]. The problem is that, if an execution path joins a previously analyzed sequence in a state that is no more onto the stack, this search strategy will do redundant work. Hence the run time requirements of this type of search go up dramatically. The result is that even state spaces that could ....

G. J. Holzmann. The pandora system --- an interactive system for the design of data communication protocols. Computer Networks, 8(2):71--81, 1984.

No context found.

Holzmann, G.J., "The Pandora system -- an interactive system for the design of data communication protocols," Computer Networks, Vol. 8, No. 2, (1984), pp. 71-81.

....used in Algorithm 1. Such a search, termed Type 3 or stack search algorithm in [Hol90] reduces the memory requirements while still guaranteeing a complete exploration of any finite state space. This strategy was used in, for instance, the first Pan system [Hol81] and in the Pandora system [Hol84]. The problem is that, if an execution path joins a previously analyzed sequence in a state that is no longer in the stack, this search strategy will do redundant work. Hence the run time requirements of this type of search go up dramatically. The result is that even state spaces that could ....

G. J. Holzmann. The pandora system --- an interactive system for the design of data communication protocols. Computer Networks, 8(2):71--81, 1984.

....Protocol validation by symbolic execution is inherently a time and space consuming task. For lack of better methods, though, many automated protocol validation tools do use symbolic execution algorithms [1,2,7,16,17] and even methods based on validation algebras such as CCS [14] or PVA [9,10] still implicitly formalize symbolic executions 1 . Unfortunately, the assumption that a computer will always be able to take over when the complexity of a complete analysis surpasses our ability to perform algebraic expansions by hand is decidedly wrong [3,5] A protocol of a realistic size can ....

.... magnitude by restricting the number of interleavings, by using search depth and queue size restrictions and compile time minimizations (Figures 1, 2, 4, and 5b) A more general method of reducing runtime would be the definition of equivalence classes, or state space foldings, as described in e.g. [10]. The experimental protocol debugger trace does allow for the definition of such foldings, but too little experience with this technique has yet been gained to report any results. The number of states stored in a state space can be reduced by carefully selecting the states that may be revisited ....

G.J. Holzmann, "The Pandora system -- an interactive system for the design of data communication protocols," Computer Networks, 8, No. 2, (1984), pp 71-81.

....of the protocol to establish its correctness for the given requirements. IEEE Trans. on Software Engineering, Vol. 13, No. 6, June 1987, pp. 683 697. 1. Introduction In the last few years some experience has been gained with the capabilities and the restrictions of automated protocol validators [2,3,4,8,10,11,12,13]. The first validation methods required considerable effort from the user to translate an abstract protocol specification into the formal code used in the validation process. The analyses were often run in batch mode and the interpretation of the results again required considerable human ....

....a few minutes, say 10 3 seconds, on an analysis. The most commonly used breadth first search method [4,8,12,13] would generate the top 10 3 of the state space tree, which is unlikely to contain errors or a single complete execution sequence. The depth first search method, used in [10,11], would generate the first 10 3 of all complete execution histories. The detection of an error sequence among the first few generated is still unpredictable since we have no control over the choice of the sequences that are tested. The scatter searching method, described below, would ....

Holzmann, G.J., "The Pandora system -- an interactive system for the design of data communication protocols," Computer Networks, Vol. 8, No. 2, pp 71-81.

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