A. Helmy. A Survey on Kernel Specification and Verification. Technical Report 97-654 of the Computer Science Department, University of Southern California. URL http://www.usc.edu/dept/cs/technical reports.html. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Systematic Testing of Multicast Routing Protocols.. - Helmy, Estrin, Gupta (2000) Self-citation (Helmy) (Correct)
....we present a framework for the systematic design and testing of multicast protocols. The framework integrates test generation algorithms with simulation and implementation. We propose a suite of practical methods and tools for automatic test generation for network protocols. Many researchers [3] [4] have developed protocol verification methods to ensure certain properties of protocols, like freedom from deadlocks or unspecified receptions. Much of this work, however, was based on assumptions about the network conditions, that may not always hold in today s Internet, and hence may become ....
....dealing with verification of communication protocols. Protocol verification typically addresses well defined properties, such as safety and liveness properties. In general, the two main approaches for protocol verification are theorem proving and reachability analysis (or model checking) 3] [4]. Theorem proving systems define a set of axioms and construct relations on these axioms. Desirable properties of the protocol are then proven mathematically. Theorem proving includes model based and logic based formalisms including first and higher order logic. Reachability analysis algorithms ....
A. Helmy. A Survey on Kernel Specification and Verification. Technical Report 97-654 of the Computer Science Department, University of Southern California. URL http://www.usc.edu/dept/cs/technical reports.html.
`STRESS' Testing using Reduced Reachability Analysis: A.. - Helmy, Estrin, Gupta Self-citation (Helmy) (Correct)
....hubs, switches, etc. include timeliness and fault tolerance. Most protocol verification systems aim to detect violations of (part of) these protocol properties. In general, the two main approaches for protocol verification are theorem proving and reachability analysis (or model checking) 14] [15]. Theorem proving systems define a set of axioms and construct relations on these axioms. Desirable properties of the protocol are then proven mathematically. Theorem proving includes model based formalisms (such as Z [16] and Vienna Development Method (VDM) 17] and logic based formalisms ....
A. Helmy. A Survey on Kernel Specification and Verification. Technical Report 97-654 of the Computer Science Department, University of Southern California. URL http://www.usc.edu/dept/cs/technical reports.html.
Systematic Testing of Multicast Protocol Robustness - Helmy (1997) (1 citation) Self-citation (Helmy) (Correct)
....Protocol verification typically addresses well defined properties, such as safety properties; freedom from deadlocks, and liveness properties; freedom from starvation. In general, the two main approaches for protocol verification are theorem proving and reachability analysis (or model checking) [13, 14]. Theorem proving systems define a set of axioms and construct relations on these axioms. Desirable properties of the protocol are then proven mathematically. Theorem proving includes model based and logicbased formalisms including first and higher order logic. Reachability analysis algorithms ....
A. Helmy. A Survey on Kernel Specification and Verification. Technical Report 97-654 of the Computer Science Department, University of Southern California. URL http://www.usc.edu/dept/cs/technical reports.html.
Fault-oriented Test Generation for Multicast Routing - Helmy, Estrin, Gupta (1998) (3 citations) Self-citation (Helmy) (Correct)
....responsiveness properties include timeliness and fault tolerance. Most protocol verification systems aim to detect violations of (part of) these protocol properties. In general, the two main approaches for protocol verification are theorem proving and reachability analysis (or model checking) [17, 18]. Theorem proving systems define a set of axioms and construct relations on these axioms. Desirable properties of the protocol are then proven mathematically. Theorem proving includes model based formalisms (such as Z [19] and Vienna Development Method (VDM) 20] and logic based formalisms ....
A. Helmy. A Survey on Kernel Specification and Verification. Technical Report 97-654 of the Computer Science Department, University of Southern California. URL http://www.usc.edu/dept/cs/technical reports.html.
`STRESS' Testing Applied to a Multicast Routing Protocol - Helmy, Estrin (1997) Self-citation (Helmy) (Correct)
....properties include timeliness and fault tolerance. Most protocol verification systems, including STRESS, aim to detect violations of (part of) these protocol properties. In general, the two main approaches for protocol verification are theorem proving and reachability analysis (or model checking) [23, 24]. Theorem proving systems define a set of axioms and construct relations on these axioms. Desirable properties of the protocol are then proven mathematically. Theorem proving includes model based formalisms (such as Z [25] and Vienna Development Method (VDM) 26] and logicbased formalisms ....
A. Helmy. A Survey on Kernel Specification and Verification. Technical Report 97-654 of the Computer Science Department, University of Southern California. URL http://www.usc.edu/dept/cs/technical reports.html.
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