815 search results - page 103 / 163 » Algebraic Recognizability of Languages |
100
click to vote
LICS
2003
IEEE
15 years 5 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...
ENTCS
2002
14 years 11 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...
IFIP
2009
Springer
15 years 6 months 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...
MODELS
2007
Springer
15 years 6 months 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-...
BIRTHDAY
2005
Springer
15 years 5 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...