8132 search results - page 164 / 1627 » Dependability, Abstraction, and Programming |
161
click to vote
POPL
1999
ACM
15 years 10 months ago
1999
ACM
Linking is a low-level task that is usually vaguely specified, if at all, by language definitions. However, the security of web browsers and other extensible systems depends cru...
174
click to vote
POPL
1996
ACM
15 years 10 months ago
1996
ACM
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
188
click to vote
ECOOP
2007
Springer
15 years 10 months ago
2007
Springer
Object invariants describe the consistency of object states, and are crucial for reasoning about the correctness of object-oriented programs. However, reasoning about object invari...
177
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
194
click to vote
TRANSCI
2008
15 years 6 months ago
2008
Abstract. We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multi-commodity min-cost flow formulation th...