Sciweavers

1796 search results - page 73 / 360
» An Approach to Compositional Model Checking
Sort
View
NFM
2011
242views Formal Methods» more  NFM 2011»
14 years 9 months ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler
ATAL
2005
Springer
15 years 8 months ago
Bounded model checking knowledge and branching time in synchronous multi-agent systems
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
Xiangyu Luo, Kaile Su, Abdul Sattar, Qingliang Che...
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
FOSSACS
2005
Springer
15 years 8 months ago
Model Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto
KBSE
2002
IEEE
15 years 7 months ago
Deviation Analysis Through Model Checking
Inaccuracies, or deviations, in the measurements of monitored variables in a control system are facts of life that control software must accommodate—the software is expected to ...
Mats Per Erik Heimdahl, Yunja Choi, Michael W. Wha...