762 search results - page 68 / 153 » Intercode Regular Languages |
126
click to vote
PADL
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We show how testing convertibility of two types in dependently typed systems can advantageously be implemented instead untyped normalization by evaluation, thereby reusin...
129
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
123
click to vote
ASPLOS
2011
ACM
14 years 7 months ago
2011
ACM
New storage-class memory (SCM) technologies, such as phasechange memory, STT-RAM, and memristors, promise user-level access to non-volatile storage through regular memory instruct...
140
click to vote
CAI
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. The concatenation product is one of the most important operations on regular languages. Its study requires sophisticated tools from algebra, finite model theory and pro...
140
Voted
FOSSACS
2009
Springer
15 years 8 months ago
2009
Springer
In quantitative verification, system states/transitions have associated costs, and these are used to associate mean-payoff costs with infinite behaviors. In this paper, we propose ...