815 search results - page 103 / 163 » Algebraic Recognizability of Languages |
157
click to vote
LICS
2003
IEEE
15 years 11 months ago
2003
IEEE
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
147
click to vote
ENTCS
2002
15 years 6 months ago
2002
Category theory has proved a useful tool in the study of type systems for sequential programming languages. Various approaches have been proposed to use categorical models to exam...
146
click to vote
IFIP
2009
Springer
16 years 22 days ago
2009
Springer
We consider the problem of detecting covert channels within security-enforcing object-capability patterns. Traditional formalisms for reasoning about the security properties of obj...
149
click to vote
MODELS
2007
Springer
16 years 9 days ago
2007
Springer
The integration of different models, such as scenarios, is an important component of the requirements engineer’s work. If manually performed, the integration operation is error-...
148
click to vote
BIRTHDAY
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider...