493 search results - page 68 / 99 » Bounded LTL Model Checking with Stable Models |
119
click to vote
ICTAC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output mode...
SWAT
1992
Springer
15 years 6 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
101
click to vote
CGF
1998
15 years 1 months ago
1998
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...
110
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 ...
155
click to vote
TII
2008
15 years 1 months ago
2008
Abstract--Safety analysis in Systems Engineering (SE) processes, as usually implemented, rarely relies on formal methods such as model checking since such techniques, however power...