Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Network Event Recognition - Karthikeyan Bhargavan University (Correct)
....network, are gaining popularity. Intrusion detection languages, such as Bro [Pax99] are good candidates for network event recognition since they already have e#cient implementations and can monitor packet tra#c at high speeds. On the other hand, protocol specification languages, such as Promela [Hol91] are very expressive: they allow us to define protocol events and state machines with ease, and often have sophisticated analysis tools. Protocol implementations, however, are typically written in programming languages, such as C, or in specialized languages such as Prolac [KKM99] An ....
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991. http://cm.bell-labs.com/cm/cs/what/spin/Doc/Book91.html.
Requirements for a Practical Network Event Recognition Language - Bhargavan, Gunter (Correct)
....network, are gaining popularity. Intrusion detection languages, such as Bro [Pax99] are good candidates for network event recognition since they already have ecient implementations and can monitor packet trac at high speeds. On the other hand, protocol speci cation languages, such as Promela [Hol91] are very expressive: they allow us to de ne protocol events and state machines with ease, and often have sophisticated analysis tools. Protocol implementations, however, are typically written in programming languages, such as C, or in specialized languages such as Prolac [KKM99] An ....
....speci c Network Event Recognition Language, NERL. NERL programs are translated to C, and then are compiled along with the support libraries to generate fast executable monitors. 12 In addition, NERL programs can be translated to Promela models and modelchecked for desired properties using SPIN [Hol91] The architecture of the implementation is as shown in Figure 2. Promela NERL C Recognizer Program Model Check Support Libraries Monitor Execution Fig. 2. NERL Implementation The language NERL is inspired by the runtime veri cation logic MEDL. MEDL is an event de nition language that ....
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991. http://cm.bell-labs.com/cm/cs/what/spin/Doc/ Book91.html.
Verification of Business Process Models - Matousek (2003) (Correct)
....correctness is usually supported only at the level of modeling and simulation. A real reliable veri cation using model checking or theorem proving is presented only in few papers coming mainly from the research area. In [23] authors describe veri cation of business processes using the Spin [43, 22] model checker. Processes are described by graphical language with causality based semantics called Amber. Such speci cations are then automatically translated into a state machine description in Promela that is the input language of the model checker Spin. Then correctness properties speci ed ....
....issues that was kept in mind. Another important aspect is also the way how the veri ed properties of process are speci ed to the veri er. 5. 1 The Model Checker Spin Several veri ers were studied and experiments were done with them, namely symbolic veri er SMV [30] Spin model checker [43, 22], Concurrency Workbench [33] Mur [10, 31] and the PVS theorem prover [37, 41, 7] Finally the Spin model checker was selected as the best candidate among them. The Spin is a tool developed at the Bell Laboratories for analyzing the logical consistency of concurrent systems, speci cally of ....
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, New Jersey, USA, 1991.
Addressing Dynamic Issues of Program Model Checking - Lerda, Visser (7 citations) (Correct)
....errors in software systems. Testing, however, can be very expensive, but more importantly, it is often incapable of finding subtle errors e.g. timing errors in a concurrent system. Model checking has been used extensively to find subtle errors in hardware and protocol designs [BLPV95,CW96,Hol91] However, until recently, model checking has been deemed inadequate to analyze software code, due to the high level of detail often found in code. Now there are many groups, from both industry and academia, that are analyzing source code by model checking. Many of these source code model ....
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
Automated Analysis of Fault-Tolerance in Distributed Systems - Stoller, Schneider (1997) (2 citations) (Correct)
....Proof techniques designed specifically for verification of fault tolerance (e.g. SS83, CdR93, Web93, PJ94, Sch94] facilitate the construction of these proofs but still require logical expertise of the user. Another class of methods is based on exhaustive exploration of finite state spaces [Hol91, CGL94, Kur94, CS96]. These methods have enjoyed considerable success for verification of hardware and communication protocols. But for many fault tolerant asynchronous distributed software systems, the time and memory required for state space exploration are prohibitively large. The method for analysis of ....
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, 1991.
Enterprise Architecture Analysis Using an Architecture.. - Sircar, Kott (2000) (Correct)
....channels, components, ports, interface and protocols of interaction within the system. Like a programming language for software, an ADL allows these descriptions to be compiled and generate executable code for simulation and to verify certain types of system properties [GMW97] BHMV97] [Holzmann91 ]. Within enterprise control, systems analyses using ADLs can play a very important role [JJV97] This paper highlights the technique and shows, by means of an example of an agent based system, the kinds of analyses that can be done. The efficacy of the technique is in being able to create error ....
Gerard Holzmann, Design and Validation of Computer Protocols, Prentice Hall, 1991.
Parallel Program Verification Using BMC - Jussila, Niemelä (2002) (1 citation) (Correct)
....concludes the paper. 2 PROGRAMMING LANGUAGE PROMELAb The target domain for the presented work is model checking control and protocol software. For this purpose a simple programming language PROMELAb has been devised. The language borrows a lot from PROMELA, the input language of the SPIN system [8], actually being a subset. A typical PROMELAb program consists of parallel components capable of communicating through global variables and FIFO queues. The central issues in the design of the language is, on the one hand, the provision of an intuitive formalism for parallel pro gramming. On the ....
Gerard J. Holzmann, Design and Validation of Computer Protocols, Prentice Hall, 1991.
Structure and Hierarchy in Real-Time Systems - Möller (2002) (Correct)
....(i.e. absence of C) If both A and C are set, the latter one is ignored. By default, the convex hull approximation is disabled. 5.2. 2 Under Approximation: Bitstate Hashing ( Z ) This under approximation technique was introduced by Holzmann [Hol98] in context of the LTL model checker SPIN [Hol91,Hol97] Instead of the full state space only a hashed version of it is stored in the Passed list, i.e. one bit per encountered symbolic state. With the application of bitstate hashing it is possible to establish the reachability of a state, but not to refute it in general. If the hash values ....
Gerard J. Holzmann. The Design and Validation of Computer Protocols. Prentice Hall, 1991. 94
IOA: A Language for Specifying, Programming, and.. - Garland, Lynch, Vaziri (1997) (2 citations) (Correct)
.... Proof tools, to assist in the proof of invariants, simulation relations, and temporal properties. One such tool will be based on the Larch Prover [5] Similar tools may be constructed for other veri cation systems, such as PVS [12] or for nite state model checkers, such as SMV [10] and SPIN [11]. 58 C Bibliography ....
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, New Jersey, 1991, ISBN 0-13-539925-4.
Formal Verification of Time-Triggered Systems - Pike (2006) (Correct)
No context found.
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
Abstractions for Fault-Tolerant Distributed System.. - Pike, Maddalon, Miner.. (2004) (Correct)
No context found.
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
Timed Automata: Semantics, Algorithms and Tools - Bengtsson, Yi (Correct)
No context found.
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, 1991.
Abstractions for Fault-Tolerant Distributed System.. - Pike, Maddalon, Miner.. (2004) (Correct)
No context found.
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
Security Protocol Verification Using SPIN - Jøsang (1995) (Correct)
No context found.
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
Deriving Efficient Cache Coherence Protocols through.. - Nalumasu, Gopalakrishnan (1997) (1 citation) (Correct)
No context found.
Gerard Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
Partial Order Reduction without the Proviso - Nalumasu, Gopalakrishnan (1996) (Correct)
No context found.
Gerard Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
Efficient Computer-Aided Verification of Parallel and Distributed .. - Mäkelä (2003) (Correct)
No context found.
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, Englewood Cli#s, NJ, USA, 1991.
Efficient Computer-Aided Verification of Parallel and Distributed .. - Mäkelä (2003) (Correct)
No context found.
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, Englewood Cli#s, NJ, USA, 1991.
Partial Order Reduction without the Proviso - Nalumasu, Gopalakrishnan (1996) (Correct)
No context found.
Gerard Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
A Partial Order Reduction Algorithm without the Proviso - Nalumasu, Gopalakrishnan (1998) (Correct)
No context found.
Gerard Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991. 20
Cmc: A Model Checker For Network Protocol Implementations - Musuvathi (2004) (Correct)
No context found.
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, Englewood Cli#s, New Jersey, 1991.
A Reachability Analyser for Algebraic System Nets - Mäkelä (2001) (Correct)
No context found.
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, Englewood Cli#s, NJ, USA, 1991.
Deriving Efficient Cache Coherence Protocols through.. - Nalumasu, Gopalakrishnan (1997) (1 citation) (Correct)
No context found.
Gerard Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
Automated Verification of an Audio Control Protocol.. - Bengtsson.. (2002) (Correct)
No context found.
Gerard Holzmann. The Design and Validation of Computer Protocols. Prentice Hall, 1991.
Network Event Recognition for Packet-Mode Surveillance - Bhargavan, Gunter (2002) (Correct)
No context found.
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
First 50 documents Next 50
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