24554 search results - page 274 / 4911 » Dependable distributed systems |
181
click to vote
CADE
2004
Springer
15 years 12 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
162
click to vote
ECAI
2004
Springer
15 years 12 months ago
2004
Springer
A standard assumption in studies of multiagent resource allocation problems is that the value an individual agent places on its assignment remains unchanged by any redistribution ...
193
click to vote
FTCS
1998
15 years 7 months ago
1998
Programs fail mainly for two reasons: logic errors in the code, and exception failures. Exception failures can account for up to 2/3 of system crashes [6], hence are worthy of ser...
178
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
152
click to vote
LCPC
1991
Springer
15 years 10 months ago
1991
Springer
The dependence ow graph is a novel intermediate representation for optimizingand parallelizing compilersthat can be viewed as an executable representation of program dependences. ...