328 search results - page 9 / 66 » Proving Termination of Communicating Programs |
LOPSTR
2009
Springer
14 years 2 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
FMCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper describes the architecture of costa, an abstract interpretation based cost and termination analyzer for Java bytecode. The system receives as input a bytecode program, (...
CATS
2007
13 years 9 months ago
2007
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
CADE
2007
Springer
14 years 8 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...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...