Sep 5, 2002 · Recent works by the authors address the problem of automating the selection of a candidate norm for the purpose of termination analysis.
Abstract. Recent works by the authors address the problem of au- tomating the selection of a candidate norm for the purpose of termination analysis.
Recent works by the authors address the problem of automating the selection of a candidate norm for the purpose of termination analysis.
It is shown that by considering polymorphic types the authors reduce, without sacrificing precision, the number of type-based norms which should be combined ...
Abstra t. Re ent works by the authors address the problem of auto- mating the sele tion of a andidate norm for the purpose of termination analysis.
Missing: Logic | Show results with:Logic
Recent works by the authors address the problem of automating the selection of a candidate norm for the purpose of termination analysis.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...
This article makes two contributions to the work on semantics-based termination analysis for logic programs. The first involves a novel notion of type-based ...
Maurice Bruynooghe, Michael Codish , Samir Genaim , Wim Vanhoof: Reuse of Results in Termination Analysis of Typed Logic Programs. SAS 2002: 477-492.
The analysis of the typed logic programs is able to completely reuse a framework for termination analy- sis of untyped logic programs by using abstract ...