1410 search results - page 163 / 282 » Proving theorems by reuse |
172
click to vote
ALT
2005
Springer
16 years 3 months ago
2005
Springer
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed µ-distinguishable. In this paper, we prove that state merging alg...
168
click to vote
WWW
2009
ACM
16 years 25 days ago
2009
ACM
Most of the approaches for dealing with uncertainty in the Semantic Web rely on the principle that this uncertainty is already asserted. In this paper, we propose a new approach t...
138
click to vote
FASE
2009
Springer
16 years 25 days ago
2009
Springer
Security automata are a convenient way to describe security policies. Their typical use is to monitor the execution of an application, and to interrupt it as soon as the security p...
148
click to vote
WDAG
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
215
click to vote
FROCOS
2009
Springer
16 years 18 days ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...