HAJEK, J. Automatically verified data transfer protocols. In Proc. ICCC (1978), pp. 749--756.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....expressed in a general logic. The use of these tools can rule out a class of design errors that can be hard, if not impossible, to avoid when conventional design techniques are used. The first verifiers were all based on relatively minor variations on exhaustive reachability analysis (cf. [Hajek78, West78, H81]) The use of algorithms for the verification of logic formulae for finite state structures was pioneered in the early eighties by Ed Clarke and Allen Emerson in the U.S. e.g. CE81] and by Joseph Sifakis in France, e.g. QS82] Much work followed on complexity management techniques, both for ....

J. Hajek, `Automatically verified data transfer protocols,' Proc. 4th International Computer Conference, Kyoto, Japan, 1978, pp. 749-756.

....of a system, we can gain complete control over all salient aspects of its execution, and perform a more thorough analysis than otherwise possible. There is a fairly long history of the construction of such model checking systems. In 1978, for instance, Jan Hajek built a system called Approver [1] that could analyze simple models of data transfer protocols with a heuristic method based on a reachability analysis of the underlying control graphs (i.e. a systematic exploration of the reachable states of the graph) Similarly, the earliest direct predecessor of the SPIN model checking system ....

J. Hajek, "Automatically Verified Data Transfer Protocols," Proceedings 4th ICCC, 749-756, Kyoto, Japan, 1978.

....The following compares our work using CMC to other e#orts in traditional model checking, software model checking, and static analysis. Traditional Model Checking: The basic idea of using state graph search to verify network and communication protocols is quite old, dating back to at least 1978 [16, 30]. In recent decades, model checking has made significant progress in tackling the verification of complex, concurrent systems. Tools such as SMV[19] SPIN[18] and Murphi[10] have been used to verify hardware and software protocols by exhaustively searching the state space. By caching states and ....

J. Hajek. Automatically verified data transfer protocols. In Proceedings of the 4th ICCC, pages 749--756, 1978.

....space. Ideally, it will include all reachable system states R when the algorithm terminates. Type 1: Exhaustive Search. An unmodified exhaustive search strategy, also called a perturbation analysis, was one of the first methods tried for programming the reachability analysis [Zafiropulo 77 78, Hajek 78] and is still in use [e.g. Aggarwal 83, Bourguet 86, Rafiq 83, Richier 87, Sabnani 86] It attempts to build the complete system state space containing all reachable states R. If connectivity information also is stored it can be used for the detection and analysis of execution cycles [e.g. ....

Hajek, J., Automatically verified data transfer protocols, Proc. 4th ICCC, Kyoto, Japan, Sept. 1978, pp. 749-756.

....Bell System Technical Journal, Vol. 64, December 1985, pp. 2413 2434. 1. Introduction 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 ....

J. Hajek, "Automatically verified data transfer protocols," Proc. 4th ICCC, Kyoto, Sept. 1978, pp. 749756. - 12 -

....systems is, compared to civil engineering or physics, a relatively young discipline and it is not surprising that comparable tools are still somewhat scarce. Still, the first attempts to develop the basic methodology for of on the fly automated verification date back more than a decade, e.g. [31], 81] 32] 33] The most recent versions of these algorithms, as captured in tools such as SPIN, begin to provide some of the required capability. The design methodology that is supported by SPIN can be summarized as follows: A distinction is made between behavior and requirements on ....

J. Hajek, "Automatically Verified Data Transfer Protocols," Proc. Fourth ICCC, pp. 749-756, Kyoto, Aug. 1978.

....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 ....

....12 days of CPU time for an exhaustive analysis. In the design phase, knowing or assuming that our first protocol design has errors, it is unlikely that we would be willing to spend more than 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 ....

Hajek, J., "Automatically verified data transfer protocols," Proc. 4th ICCC, Kyoto, Sept. 1978, pp. 749756.

No context found.

HAJEK, J. Automatically verified data transfer protocols. In Proc. ICCC (1978), pp. 749--756.

No context found.

J. Hajek. Automatically verified data transfer protocols. In Proceedings of the 4th ICCC, pages 749--756, 1978.

No context found.

J. Hajek, "Automatically verified data transfer protocols," 4th Int. Conf. on Computer Communications, Kyoto, Japan, pp. 749-756, Sept. 1978.

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