644 search results - page 87 / 129 » Precedence Automata and Languages |
EMSOFT
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We present a framework to extend the concept of type systems in programming languages to capture the dynamic interaction in component-based design, such as the communicat...
CONCUR
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
96
Voted
ACTA
2010
14 years 11 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
102
Voted
EMSOFT
2004
Springer
15 years 5 months ago
2004
Springer
Embedded devices like smart cards can now run multiple interacting applications. A particular challenge in this domain is to dynamically integrate diverse security policies. In th...
171
click to vote
POPL
2002
ACM
15 years 12 months ago
2002
ACM
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...