555 search results - page 25 / 111 » Complexity of Operations on Cofinite Languages |
142
Voted
SPIN
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The semantics of modelling languages are not always specified in a precise and formal way, and their rather complex underlying models make it a non-trivial exercise to r...
113
Voted
CORR
2010
Springer
15 years 3 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 ...
168
Voted
OOPSLA
2010
Springer
15 years 2 months ago
2010
Springer
Consumer electronics today such as cell phones often have one or more low-power FPGAs to assist with energyintensive operations in order to reduce overall energy consumption and i...
131
Voted
PLDI
2011
ACM
14 years 6 months ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
177
Voted
JMLR
2012
13 years 6 months ago
2012
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...