Title :
Model Checking of Wireless Transaction Protocol
Author :
Xia, Liu ; Qi, Huang ; Yong, Chen
Author_Institution :
Sch. of Autom. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
fDate :
March 31 2009-April 2 2009
Abstract :
In order to further verify whether there still exists defect in the design of wireless transaction protocol (WTP), WTP is formally analyzed by model checking. First, WTP is modeled by finite state automatas (FSAs). Then the security property of the protocol is specified by computation tree logic (CTL). Finally, the obtained model and security property are verified by symbolic model verifier (SMV). The result shows that there exists a security flaw - deadlock in WTP.
Keywords :
finite state machines; formal logic; formal verification; telecommunication security; transport protocols; trees (mathematics); wireless channels; computation tree logic; finite state automata; model checking; security property; symbolic model verifier; wireless transaction protocol; Communication system security; Computer science; Computer security; Design automation; Design engineering; Information analysis; Information security; Logic; System recovery; Wireless application protocol; CTL; FSA; WTP; deadlock; model checking;
Conference_Titel :
Computer Science and Information Engineering, 2009 WRI World Congress on
Conference_Location :
Los Angeles, CA
Print_ISBN :
978-0-7695-3507-4
DOI :
10.1109/CSIE.2009.338
