3653 search results - page 226 / 731 » On Recognizable Timed Languages |
182
click to vote
AOSD
2008
ACM
15 years 9 months ago
2008
ACM
Several aspect languages and frameworks have recognized the need for dynamic deployment of aspects. However, they do not provide sufficiently expressive means to precisely specify...
198
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
180
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
193
click to vote
JLP
2007
15 years 7 months ago
2007
We propose a type system to enforce the security property of noninterference in a core reactive language, obtained by extending the imperative language of Volpano, Smith and Irvin...
189
click to vote
EMNLP
2010
15 years 5 months ago
2010
Syntax-based translation models should in principle be efficient with polynomially-sized search space, but in practice they are often embarassingly slow, partly due to the cost of...