Sciweavers

63 search results - page 7 / 13
» Automated Termination Analysis for Programs with Second-Orde...
Sort
View
FUIN
2006
81views more  FUIN 2006»
13 years 7 months ago
Redundant Call Elimination via Tupling
Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the...
Wei-Ngan Chin, Siau-Cheng Khoo, Neil Jones
ACSC
2004
IEEE
13 years 11 months ago
Automatic Derivation of Loop Termination Conditions to Support Verification
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
Daniel Powell
APLAS
2011
ACM
12 years 7 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
STACS
2005
Springer
14 years 1 months ago
Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations
We introduce and study Recursive Markov Chains (RMCs), which extend ordinary finite state Markov chains with the ability to invoke other Markov chains in a potentially recursive m...
Kousha Etessami, Mihalis Yannakakis
LOPSTR
1998
Springer
14 years 1 days ago
Improving Homeomorphic Embedding for Online Termination
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
Michael Leuschel