Sciweavers

147 search results - page 1 / 30
» A Transformation System for Definite Programs Based on Termi...
Sort
View
LOPSTR
1994
Springer
13 years 7 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 3 months ago
Automated Termination Analysis for Logic Programs with Cut
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, where...
Peter Schneider-Kamp, Jürgen Giesl, Thomas St...
CADE
2009
Springer
14 years 4 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur
SOFSEM
2009
Springer
14 years 15 days ago
From Outermost Termination to Innermost Termination
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
René Thiemann
CAV
2006
Springer
146views Hardware» more  CAV 2006»
13 years 7 months ago
Termination Analysis with Calling Context Graphs
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
Panagiotis Manolios, Daron Vroon