1716 search results - page 24 / 344 » Proving Conditional Termination |
CADE
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. Hoare logic is widely used for software specification and verification. Frequently we need to prove the total correctness of a program: to prove that the program not only...
RTA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
VMCAI
2005
Springer
14 years 2 months ago
2005
Springer
We present a technique to prove termination of multipath polynomial programs, an expressive class of loops that enables practical traction and analysis. The technique is based on ï...
AAAI
1994
13 years 10 months ago
1994
Bounded response time is an important requirement when rule-based expert systems are used in real-time applications. In the case the rule-based system cannot terminate in bounded ...
CAV
2005
Springer
14 years 2 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 ...