52 search results - page 2 / 11 » Design of Nondeterministic Program Termination Based on the ... |
GG
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already cruc...
TIP
2010
13 years 1 days ago
2010
Software realizations of computationally-demanding image processing tasks (e.g. image transforms and convolution) do not currently provide graceful degradation when their clock-cy...
SEW
2006
IEEE
13 years 11 months ago
2006
IEEE
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
GG
2008
Springer
13 years 6 months ago
2008
Springer
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
tigate the role of nondeterminism in Winfree's abstract Tile Assembly Model (aTAM), which was conceived to model artificial molecular self-assembling systems constructed from...