1137 search results - page 126 / 228 » Partial Program Admission |
122
Voted
LCTRTS
1998
Springer
15 years 6 months ago
1998
Springer
This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence ...
102
click to vote
TOMS
2008
15 years 1 months ago
2008
We show how to compute an LU factorization of a matrix when the factors of a leading principle submatrix are already known. The approach incorporates pivoting akin to partial pivo...
152
click to vote
ICFP
2004
ACM
16 years 2 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
137
click to vote
OOPSLA
2007
Springer
15 years 8 months ago
2007
Springer
Omniscient debuggers make it possible to navigate backwards in time within a program execution trace, drastically improving the task of debugging complex applications. Still, they...
136
Voted
IPCO
2004
15 years 3 months ago
2004
Managing an industrial production facility requires carefully allocating limited resources, and gives rise to large, potentially complicated scheduling problems. In this paper we c...