595 search results - page 25 / 119 » The Graph Programming Language GP |
ICALP
2010
Springer
14 years 13 days ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
ISCOPE
1999
Springer
13 years 12 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We discuss the realization of evaluation strategies for the concurrent constraint-based functional language ccfl within the translation schemata when compiling ccfl programs into t...
ICALP
2001
Springer
14 years 4 days ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
ERSHOV
1999
Springer
13 years 12 months ago
1999
Springer
A semi-visual framework for the speci cation of syntax and semantics of imperative programming languages, called Montages, was proposed in an earlier work by the authors. The prima...