Sciweavers

219 search results - page 7 / 44
» Dynamic partial-order reduction for model checking software
Sort
View
114
Voted
SIGSOFT
2009
ACM
16 years 3 months ago
Symbolic pruning of concurrent program executions
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
Chao Wang, Swarat Chaudhuri, Aarti Gupta, Yu Yang
110
Voted
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
15 years 9 months ago
Boom: Taking Boolean Program Model Checking One Step Further
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
Gérard Basler, Matthew Hague, Daniel Kroeni...
146
Voted
SPIN
2000
Springer
15 years 6 months ago
Model Checking Based on Simultaneous Reachability Analysis
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
Bengi Karaçali, Kuo-Chung Tai
114
Voted
SEFM
2003
IEEE
15 years 8 months ago
A Formal Model for Trust in Dynamic Networks
We propose a formal model of trust informed by the Global Computing scenario and focusing on the aspects of trust formation, evolution, and propagation. The model is based on a no...
Marco Carbone, Mogens Nielsen, Vladimiro Sassone
145
Voted
SPIN
2009
Springer
15 years 9 months ago
Automatic Discovery of Transition Symmetry in Multithreaded Programs Using Dynamic Analysis
While symmetry reduction has been established to be an important technique for reducing the search space in model checking, its application in concurrent software verification is ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Cha...