5255 search results - page 321 / 1051 » Formal Methods for Privacy |
145
click to vote
FMCO
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann's and Angluin's algorithms, we describe some of the extensions caterin...
142
click to vote
FORMATS
2006
Springer
15 years 8 months ago
2006
Springer
Timed and weak timed simulation relations are often used to show that operations on hybrid systems result in equivalent behavior or in conservative overapproximations. Given that s...
137
click to vote
FORMATS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We show how to transform formulae written in the real-time temporal logic MITL into timed automata that recognize their satisfying models. This compositional construction...
110
click to vote
FMCAD
2000
Springer
15 years 8 months ago
2000
Springer
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
168
click to vote
IFL
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. In this paper we compare three systems for tracing and debugging Haskell programs: Freja, Hat and Hood. We evaluate their usefulness in practice by applying them to a num...