1511 search results - page 225 / 303 » Hierarchical Graph Transformation |
217
click to vote
RTA
2011
Springer
14 years 7 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
153
click to vote
DDEP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Notations like SGML and XML represent document structures using tree structures; while this is in general a step forward from earlier systems, it creates certain difficul...
142
click to vote
GD
2006
Springer
15 years 8 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
161
click to vote
AIPS
2010
15 years 5 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
160
click to vote
SIAMCOMP
2000
15 years 4 months ago
2000
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...