3670 search results - page 83 / 734 » Linear Recursive Functions |
118
click to vote
ALT
2001
Springer
15 years 11 months ago
2001
Springer
The main question addressed in the present work is how to find effectively a recursive function separating two sets drawn arbitrarily from a given collection of disjoint sets. I...
132
click to vote
CAV
2005
Springer
15 years 8 months ago
2005
Springer
We present a complete method for synthesizing lexicographic linear ranking functions supported by inductive linear invariants for loops with linear guards and transitions. Proving ...
112
Voted
CADE
2007
Springer
16 years 2 months ago
2007
Springer
We develop a formalization of the Size-Change Principle in Isabelle/HOL and use it to construct formally certified termination proofs for recursive functions automatically.
110
click to vote
TLCA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
111
Voted
LICS
2007
IEEE
15 years 8 months ago
2007
IEEE
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...