Sciweavers

67 search results - page 8 / 14
» Positive Grammar Checking: A Finite State Approach
Sort
View
ENTCS
2010
99views more  ENTCS 2010»
13 years 7 months ago
State Based Robustness Testing for Components
Component based development allows to build software upon existing components and promises to improve software reuse and reduce costs. To gain reliability of a component based sys...
Bin Lei, Zhiming Liu, Charles Morisset, Xuandong L...
ICALP
2009
Springer
14 years 7 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
IEEESCC
2005
IEEE
14 years 1 months 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...
FM
2009
Springer
169views Formal Methods» more  FM 2009»
13 years 11 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...
ICDCS
2007
IEEE
14 years 1 months ago
Testing Security Properties of Protocol Implementations - a Machine Learning Based Approach
Security and reliability of network protocol implementations are essential for communication services. Most of the approaches for verifying security and reliability, such as forma...
Guoqiang Shu, David Lee