5423 search results - page 155 / 1085 » Denial-of-service in automation systems |
163
click to vote
CSL
1999
Springer
15 years 10 months ago
1999
Springer
We study the following problem: Given a transition system T and its quotient T/∼ under an equivalence ∼, which are the sets L, L′ of Hennessy-Milner formulae such that: if Ï...
158
click to vote
ESSLLI
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. In agglutinating languages, bound morphemes can indicate grammatical functions that are realized by words in languages like English. In this paper, a morphosyntactic gene...
137
click to vote
ILP
1998
Springer
15 years 10 months ago
1998
Springer
Cohen's [1] refinement rules provide a flexible mechanism for introducing intentional background knowledge in an ILP system. Whereas Cohen used a limited second order theorem ...
148
click to vote
TPHOL
1993
IEEE
15 years 10 months ago
1993
IEEE
Mathematical techniques can be used to produce precise, provably complete documentation for computer systems. However, such documents are highly detailed and oversights and other ...
166
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
: We give a semantics for a typed object calculus, an extension of System F with object subsumption and method override. We interpret the calculus in a per model, proving the sound...