Sciweavers

1796 search results - page 17 / 360
» An Approach to Compositional Model Checking
Sort
View
TACAS
2010
Springer
212views Algorithms» more  TACAS 2010»
13 years 5 months ago
Assume-Guarantee Verification for Probabilistic Systems
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
FM
2006
Springer
169views Formal Methods» more  FM 2006»
13 years 11 months ago
PSL Model Checking and Run-Time Verification Via Testers
Abstract. The paper introduces the construct of temporal testers as a compositional basis for the construction of automata corresponding to temporal formulas in the PSL logic. Temp...
Amir Pnueli, Aleksandr Zaks
CADE
2012
Springer
11 years 10 months ago
EPR-Based Bounded Model Checking at Word Level
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
Moshe Emmer, Zurab Khasidashvili, Konstantin Korov...
SIGSOFT
2009
ACM
14 years 8 months ago
Probabilistic environments in the quantitative analysis of (non-probabilistic) behaviour models
System specifications have long been expressed through automata-based languages, enabling verification techniques such as model checking. These verification techniques can assess ...
Esteban Pavese, Sebastián Uchitel, Ví...
TACAS
1998
Springer
105views Algorithms» more  TACAS 1998»
14 years 3 days ago
Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
A state/event model is a concurrent version of Mealy machines used for describing embedded reactive systems. This paper introduces a technique that uses compositionality and depend...
Jørn Lind-Nielsen, Henrik Reif Andersen, Ge...