444 search results - page 14 / 89 » Termination by Abstraction |
CADE
2007
Springer
14 years 10 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 3 months ago
2005
Springer
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
CONCUR
2010
Springer
13 years 11 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...
FOSSACS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
ICRA
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— Automation of transportation systems and promotion of the operations are becoming an international demand on seaport container terminals. For this issue, we propose an ...