5109 search results - page 349 / 1022 » On Learning Limiting Programs |
176
click to vote
PLDI
1999
ACM
15 years 11 months ago
1999
ACM
Previous selective dynamic compilation systems have demonstrated that dynamic compilation can achieve performance improvements at low cost on small kernels, but they have had diff...
200
click to vote
CSFW
1997
IEEE
15 years 11 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
154
click to vote
IPPS
1993
IEEE
15 years 11 months ago
1993
IEEE
The performance of threads is limited primarily by the overhead of two kinds of switching: vertical switching (user/kernel domain switching) and horizontal switching (context swit...
207
click to vote
ECOOPWEXCEPTION
2006
Springer
15 years 10 months ago
2006
Springer
It is difficult to write programs that behave correctly in the presence of exceptions. We describe a dataflow analysis for finding a certain class of mistakes made while programs h...
164
click to vote
ESOP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on a...