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...
In this paper, we propose a novel approach for composing existing web services to satisfy the correctness constraints to the design, including freeness of deadlock and unspecified...
Ting Deng, Jinpeng Huai, Xianxian Li, Zongxia Du, ...
An optimally working mobile system requires tight cooperation and an information stream that flows impeccably between its components. This, however, is not the current state of t...
Abstract. In this paper we propose an approach to automatically produce test cases allowing to check the satis ability of a linear property on a given implementation. Linear proper...
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...