1804 search results - page 322 / 361 » Use Cases in Model-Driven Software Engineering |
126
click to vote
PEPM
2009
ACM
15 years 10 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
127
click to vote
KBSE
2007
IEEE
15 years 8 months ago
2007
IEEE
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
174
click to vote
PSSE
2004
Springer
15 years 7 months ago
2004
Springer
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
115
click to vote
EUROSYS
2010
ACM
15 years 6 months ago
2010
ACM
When a performance crisis occurs in a datacenter, rapid recovery requires quickly recognizing whether a similar incident occurred before, in which case a known remedy may apply, o...
FSTTCS
1993
Springer
15 years 6 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...