2878 search results - page 286 / 576 » Model Checking FTA |
152
click to vote
ICSOC
2010
Springer
15 years 3 months ago
2010
Springer
A request to a service registry must be answered with a service that fits in several regards, including semantic compatibility, non-functional compatibility, and interface compati...
152
click to vote
TSE
2010
15 years 3 months ago
2010
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
156
click to vote
TSMC
2010
14 years 11 months ago
2010
Traditional planning assumes reachability goals and/or full observability. In this paper, we propose a novel solution for safety and reachability planning with partial observabilit...
162
click to vote
DALT
2008
Springer
15 years 6 months ago
2008
Springer
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
140
click to vote
DATE
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper presents an effective approach to formally verify SystemC designs. The approach translates SystemC models into a Petri-Net based representation. The Petri-net model is ...