Sciweavers

38 search results - page 2 / 8
» Termination Detection in Logic Programs using Argument Sizes
Sort
View
ICLP
2003
Springer
13 years 10 months ago
Termination Analysis with Types Is More Accurate
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
Vitaly Lagoon, Frédéric Mesnard, Pet...
PLILP
1992
Springer
13 years 9 months ago
Unfold/fold Transformations Preserving Termination Properties
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
Torben Amtoft
ICFP
2005
ACM
14 years 5 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
POPL
2009
ACM
14 years 5 months ago
A combination framework for tracking partition sizes
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv
ESOP
2005
Springer
13 years 10 months ago
Forward Slicing by Conjunctive Partial Deduction and Argument Filtering
Program slicing is a well-known methodology that aims at identifying the program statements that (potentially) affect the values computed at some point of interest. Within imperat...
Michael Leuschel, Germán Vidal