20 search results - page 4 / 4 » Automated Termination Analysis of Java Bytecode by Term Rewr... |
LOPSTR
2007
Springer
15 years 3 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
LOPSTR
2009
Springer
15 years 4 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...
90
Voted
ICLP
2005
Springer
15 years 2 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
82
Voted
LPAR
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated...
MSR
2006
ACM
15 years 3 months ago
2006
ACM
When analyzing the evolution history of a software project, we wish to develop results that generalize across projects. One approach is to analyze design patterns, permitting char...