7118 search results - page 1171 / 1424 » Electrical and Computer Engineering |
120
Voted
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
129
Voted
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single proc...
119
Voted
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
118
Voted
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Synthesis is the automatic construction of a system from its specification. In the classical synthesis algorithms it is always assumed the system is “constructed from ...
112
Voted
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities ...