Specifications and Verification of Network Protocols by Process Algebra

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Gabriel Ciobanu Articles by K. N. Sridhar

Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05)

Timisoara, Romania

September 25-September 29

ISBN: 0-7695-2453-2

	ASCII Text	x
	Gabriel Ciobanu, K. N. Sridhar, "Specifications and Verification of Network Protocols by Process Algebra," Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on, pp. 250-258, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005.

	BibTex	x
	@article{ 10.1109/SYNASC.2005.68, author = {Gabriel Ciobanu and K. N. Sridhar}, title = {Specifications and Verification of Network Protocols by Process Algebra}, journal ={Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on}, volume = {0}, year = {2005}, isbn = {0-7695-2453-2}, pages = {250-258}, doi = {http://doi.ieeecomputersociety.org/10.1109/SYNASC.2005.68}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on TI - Specifications and Verification of Network Protocols by Process Algebra SN - 0-7695-2453-2 SP250 EP258 A1 - Gabriel Ciobanu, A1 - K. N. Sridhar, PY - 2005 KW - null VL - 0 JA - Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on ER -

Gabriel Ciobanu, Research Institute "e-Austria" Timişoara and Romanian Academy

K. N. Sridhar, National University of Singapore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SYNASC.2005.68

This paper describes the specification and verification techniques for network protocols, concentrating on one hand on process algebras, and on the other hand on techniques for specific layers. The original contribution is given by new pi-calculus rules representing a set of specific patterns for expressing protocol behavior. The paper provides a review of the verification tools, and proposes a few extensions.

Citation:

Gabriel Ciobanu, K. N. Sridhar, "Specifications and Verification of Network Protocols by Process Algebra," synasc, pp.250-258, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.