556 search results - page 80 / 112 » Checking Interval Properties of Computations |
185
Voted
ICDT
2009
ACM
15 years 1 months ago
2009
ACM
We describe a novel approach to verification of software systems centered around an underlying database. Instead of applying general-purpose techniques with only partial guarantee...
152
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We introduce streaming tree transducers as an analyzable and expressive model for transforming hierarchically structured data in a single pass. Given a linear encoding of the inpu...
150
click to vote
DLOG
2011
14 years 7 months ago
2011
We study a restriction of the classification procedure for EL++ where the inference rule for complex role inclusion axioms (RIAs) is applied in a “left-linear” way in analogy ...
171
click to vote
TIME
2003
IEEE
15 years 9 months ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
126
click to vote
FORMATS
2003
Springer
15 years 9 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...