1357 search results - page 103 / 272 » Compositionality in Graph Transformation |
147
click to vote
ECBS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we argue for UML-based metamodeling and pattern-based graph transformation techniques in computer-based systems development through an illustrative example from the ...
162
Voted
MBEES
2008
15 years 4 months ago
2008
: In this paper, we discuss adjustable coverage criteria and their combinations in model-based testing. We formalize coverage criteria and specify test goals using OCL. Then, we pr...
139
Voted
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
112
click to vote
WAOA
2004
Springer
15 years 8 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
97
Voted
DELTA
2004
IEEE
15 years 7 months ago
2004
IEEE
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...