23201 search results - page 156 / 4641 » Rewriting Systems with Data |
189
click to vote
ASPDAC
2009
ACM
15 years 11 months ago
2009
ACM
— This paper proposes the first automatic approach to simultaneously generate Cycle Accurate and Cycle Count Accurate transaction level bus models. Since TLM (Transaction Level M...
226
click to vote
ALP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
177
click to vote
JOT
2008
15 years 6 months ago
2008
We present, in this paper, a framework supporting a formal verification of concurrent UML models using the Maude language. We consider both static and dynamic features of concurre...
170
click to vote
CC
2000
Springer
15 years 6 months ago
2000
Springer
The performance of a Java Virtual Machine (JVM) interpreter running on a very long instruction word (VLIW) processor can be improved by means of pipelining. While one bytecode is i...
160
click to vote
PROCEDIA
2010
15 years 4 months ago
2010
When solving machine learning problems, there is currently little automated support for easily experimenting with alternative statistical models or solution strategies. This is be...