164 search results - page 6 / 33 » Formalization and abstract implementation of rewriting with ... |
WRLA
2010
13 years 5 months ago
2010
Abstract. We revise multiset rewriting with name binding, by combining the two main existing approaches to the study of concurrency by means of multiset rewriting, multiset rewriti...
AGTIVE
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. In the paper Support for Design Patterns through Graph Transformation Tools in this volume, we have already outlined the global structure of a tool that allows for the an...
LOPSTR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper we focus on the problem of testing agent programs written in BUpL, an executable, high-level modelling agent language. Our approach consists of two main ste...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
Abstract. Nested data-parallel programs often have large memory requirements due to their high degree of parallelism. Piecewise execution is an implementation technique used to min...
WRLA
2010
13 years 5 months ago
2010
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...