7988 search results - page 17 / 1598 » A Useful Undecidable Theory |
98
Voted
TCS
2010
15 years 1 months ago
2010
We give a new construction of strongly aperiodic set of tiles in H2 , exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that t...
113
click to vote
FUIN
2008
15 years 3 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
137
Voted
LICS
1999
IEEE
15 years 7 months ago
1999
IEEE
We consider type systems that combine universal types, recursive types, and object types. We study type inference in these systems under a rank restriction, following Leivant'...
250
Voted
POPL
2006
ACM
16 years 3 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
131
click to vote
LFCS
2007
Springer
15 years 9 months ago
2007
Springer
Various logical formalisms with the freeze quantifier have been recently considered to model computer systems even though this is a powerful mechanism that often leads to undecida...