QQ客服 官方微博 反馈留言

	Concurrent Algorithms in SPIN Model Checker
	Nawaz, M. Saqib ; Ali, Hussam ; Lali, M. IkramUllah
	2016
关键词	Bakery algorithm Dekker algorithm SPIN LTL PROMELA Liveness Safety
英文摘要	Analysis and finding errors in concurrent software/system particularly when it is used in safety or industrial critical systems is gaining more and more attention. Software testing is an important technique for finding errors, however for concurrent algorithms, testing often does not ensure correctness or absence of errors. The model checker SPIN is widely and successfully used to formally verify the correctness requirements for systems of concurrently executing processes. Software/system model is first developed in PROMELA modeling language and SPIN model checker accepts correctness claims that are declared as linear temporal logic (LTL) formulas. In this article, two famous concurrent algorithms for mutual exclusion problem ( Bakery algorithm and Dekker algorithm) are analyzed and formally verified in SPIN. Mutual exclusion for both algorithms is verified with in-line assertion and as correctness claims with the help of LTL formulas. Furthermore, safety and liveness properties of both algorithms are verified with LTL formulas.; CPCI-S(ISTP); 193-198
语种	英语
出处	SCI
出版者	14th International Conference on Frontiers of Information Technology (FIT)
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/470248]
专题	数学科学学院
推荐引用方式 GB/T 7714	Nawaz, M. Saqib,Ali, Hussam,Lali, M. IkramUllah. Concurrent Algorithms in SPIN Model Checker. 2016-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。