The classical approach to static cost analysis is based on transforming a given program into
cost relations and solving them into closed-form upper-bounds. It is known that for some …

Application checkpoint and restart has been a widely studied problem over the last several
decades. Despite immense volume of theory and several research project level …

The classical approach to static cost analysis is based on first transforming a given program
into a set of cost relations, and then solving them into closed-form upper-bounds. The quality …

This thesis is concerned with investigations into the" complexity of term rewriting systems".
Moreover the majority of the presented work deals with the" automation" of such a …

We propose a new focus of research for multimedia conferencing systems which allows
each user to flexibly select another participant or a group of participants to control media …

The automated complexity analysis of rewrite systems is a challenging topic that has
recently gained much attention. As one practical application, techniques developed for the …

The polynomial path order (POP* for short) is a termination method that induces polynomial
bounds on the innermost runtime complexity of term rewrite systems (TRSs for short) …

Automatic methods for discovering program runtime and proving program termination have
always been a challenging problem in computer science. We present here a novel and …

Types and proportion of air conditioning heat and cold sources of northern existing buildings
including government office buildings, large public buildings and civil architectures are …

Affine size-change analysis has been used for calculating precise polynomial bounds on the
run times, and stack depths of affine size-change terminating programs. Such polynomial …