882 search results - page 131 / 177 » A Taste of Rewrite Systems |
92
Voted
FORTE
1996
15 years 1 months ago
1996
In this paper we present the application of the fair testing pre-order, introduced in a previous paper, to the speci cation and analysis of distributed systems. This pre-order com...
81
Voted
GLOBECOM
2008
IEEE
15 years 21 days ago
2008
IEEE
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
110
click to vote
CORR
2010
Springer
15 years 19 days ago
2010
Springer
Abstract. Transforming constraint models is an important task in recent constraint programming systems. User-understandable models are defined during the modeling phase but rewriti...
115
Voted
ACTA
2006
15 years 18 days ago
2006
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
ENTCS
2008
15 years 18 days ago
2008
Logical frameworks have enjoyed wide adoption as meta-languages for describing deductive systems. While the techniques for representing object languages in logical frameworks are ...