Sciweavers

42 search results - page 3 / 9
» Verification Tools for Finite-State Concurrent Systems
Sort
View
JSC
2010
100views more  JSC 2010»
13 years 1 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov
FM
2009
Springer
169views Formal Methods» more  FM 2009»
13 years 10 months ago
Model Checking Linearizability via Refinement
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
Yang Liu 0003, Wei Chen, Yanhong A. Liu, Jun Sun 0...
IEEESCC
2005
IEEE
14 years 17 days ago
Using a Rigorous Approach for Engineering Web Service Compositions: A Case Study
In this paper we discuss a case study for the UK Police IT Organisation (PITO) on using a model-based approach to verifying web service composition interactions for a coordinated ...
Howard Foster, Sebastián Uchitel, Jeff Mage...
RV
2010
Springer
220views Hardware» more  RV 2010»
13 years 4 months ago
Runtime Verification with the RV System
The RV system is the first system to merge the benefits of Runtime Monitoring with Predictive Analysis. The Runtime Monitoring portion of RV is based on the successful Monitoring O...
Patrick O'Neil Meredith, Grigore Rosu
CAV
2009
Springer
209views Hardware» more  CAV 2009»
14 years 7 months ago
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamari...