Sciweavers

114 search results - page 1 / 23
» Model-Checking Systems with Unbounded Variables without Abst...
Sort
View
ICFEM
2009
Springer
14 years 5 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He
PRDC
2007
IEEE
14 years 5 months ago
An Automatic Real-Time Analysis of the Time to Reach Consensus
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
Tatsuhiro Tsuchiya, André Schiper
BIRTHDAY
2004
Springer
14 years 2 months ago
On Model Checking Data-Independent Systems with Arrays with Whole-Array Operations
Abstract. We consider programs which are data independent with respect to two type variables X and Y , and can in addition use arrays indexed by X and storing values from Y . We ar...
Ranko Lazic, Thomas Christopher Newcomb, A. W. Ros...
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
14 years 5 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...