Sciweavers

5216 search results - page 135 / 1044
» Planning as Model Checking
Sort
View
CONCUR
2000
Springer
15 years 4 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
118
Voted
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
15 years 2 months ago
Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions
We present a new property driven pruning algorithm in dynamic model checking to efficiently detect race conditions in multithreaded programs. The main idea is to use a lockset base...
Chao Wang, Yu Yang, Aarti Gupta, Ganesh Gopalakris...
FASE
2008
Springer
15 years 2 months ago
A Model Checking Approach for Verifying COWS Specifications
We introduce a logical verification framework for checking functional properties of service-oriented applications formally specified using the service specification language COWS. ...
Alessandro Fantechi, Stefania Gnesi, Alessandro La...
FMOODS
2007
15 years 2 months ago
Verifying Distributed, Event-Based Middleware Applications Using Domain-Specific Software Model Checking
The success of distributed event-based infrastructures such as SIENA and Elvin is partially due to their ease of use. Even novice users of these infrastructures not versed in distr...
L. Ruhai Cai, Jeremy S. Bradbury, Jürgen Ding...
CORR
2008
Springer
91views Education» more  CORR 2008»
15 years 26 days ago
Significant Diagnostic Counterexamples in Probabilistic Model Checking
Abstract. This paper presents a novel technique for counterexample generation in probabilistic model checking of Markov chains and Markov Decision Processes. (Finite) paths in coun...
Miguel E. Andrés, Pedro R. D'Argenio, Peter...