117 search results - page 5 / 24 » A Dynamic Approach to Characterizing Termination of General ... |
PLPV
2009
ACM
14 years 4 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
NMR
2004
Springer
14 years 22 days ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
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...
LCPC
2007
Springer
14 years 1 months ago
2007
Springer
Program dynamic optimization, adaptive to runtime behavior changes, has become increasingly important for both performance and energy savings. However, most runtime optimizations o...
SIGSOFT
2003
ACM
14 years 19 days ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...