128 search results - page 4 / 26 » Ensuring Termination by Typability |
ECOOP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it po...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
LOPSTR
1998
Springer
13 years 11 months ago
1998
Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
PLDI
2006
ACM
14 years 1 months ago
2006
ACM
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...