1472 search results - page 202 / 295 » On Model Checking Infinite-State Systems |
230
click to vote
PLDI
2009
ACM
16 years 2 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
162
click to vote
SBMF
2010
Springer
14 years 8 months 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...
142
click to vote
SPIN
2007
Springer
15 years 8 months ago
2007
Springer
One of the most exciting and promising approaches to ensure the correctness of critical systems is software model checking, which considers real code, written with standard program...
LPAR
2010
Springer
15 years 6 days 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...
108
click to vote
ACL
2007
15 years 3 months ago
2007
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...