2878 search results - page 346 / 576 » Model Checking FTA |
137
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
239
Voted
SBMF
2010
Springer
15 years 27 days ago
2010
Springer
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...
135
click to vote
DAC
2000
ACM
16 years 7 months ago
2000
ACM
In this paper, we propose a technique to implement communication protocols as hardware circuits using a model of concurrent EFSMs with multi-way synchronization. Since use of mult...
175
Voted
WWW
2007
ACM
16 years 6 months ago
2007
ACM
To increase confidence in the correctness of specified policies, policy developers can conduct policy testing by supplying typical test inputs (requests) and subsequently checking...
172
click to vote
ASYNC
2005
IEEE
15 years 11 months ago
2005
IEEE
We propose a novel technique for modeling and verifying timed circuits based on the notion of generalized relative timing. Generalized relative timing constraints can express not ...