5499 search results - page 216 / 1100 » Generalized Rewrite Theories |
149
click to vote
LICS
1997
IEEE
15 years 11 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
174
click to vote
AMAST
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Motivated by the proliferation and usefulness of Domain Specific Languages as well as the demand in enriching well established languages by high level capabilities like p...
235
click to vote
FASE
2006
Springer
15 years 11 months ago
2006
Springer
This paper describes the application of the Real-Time Maude tool to the formal specification and analysis of the CASH scheduling algorithm and its suggested modifications. The CASH...
221
click to vote
MA
2000
Springer
15 years 10 months ago
2000
Springer
Mobile Maude is a mobile agent language extending the rewriting logic language Maude and supporting mobile computation. Mobile Maude uses reflection to obtain a simple and general ...
214
click to vote
AISC
2010
Springer
15 years 10 months ago
2010
Springer
We present tropical games, a generalization of combinatorial min-max games based on tropical algebras. Our model breaks the traditional symmetry of rational zero-sum games where pl...