We propose a logical framework for specifying and proving assertions about program termination. Although termination of programs has been well studied, it is usually added as an external component to the specification logic. Here we propose to integrate termination requirements directly into our specification logic, as temporal constraints for each phase of every method. Our temporal constraint...

We investigate the modularity behaviour of termination and connuence properties of conditional term rewriting systems. In particular , we show how to obtain suucient conditions for the modularity of weak termination, weak innermost termination, (strong) innermost termination , (strong) termination, connuence and completeness of conditional rewrite systems.

From a practical perspective, it is important for programs to have modular correctness properties. Some (largely syntactic) su cient conditions are given here for the union of terminating rewrite systems to be terminating, particularly in the hierarchical case, when one of the systems makes no reference to functions de ned by the other.

Termination Mechanism is an indispensible part of the emergency management mechanism. Despite of its importance in both theory and practice, it is almost a brand new field for researching. The concept of termination mechanism is proposed firstly in this paper, and the design and implementation which are helpful to guarantee the effect and integrity of emergency management are discussed secondly...