Sciweavers

213 search results - page 13 / 43
» Automated Termination Analysis for Logic Programs with Cut
Sort
View
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
15 years 5 months ago
Information Flow Analysis in Logical Form
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...
Torben Amtoft, Anindya Banerjee
ACSC
2004
IEEE
15 years 3 months ago
Automatic Derivation of Loop Termination Conditions to Support Verification
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
Daniel Powell
CL
2000
Springer
15 years 4 months ago
A Logic Programming Application for the Analysis of Spanish Verse
Logic programming rules are provided to capture the rules governing formal poetry in Spanish. The resulting logic program scans verses in Spanish to provide their metric analysis. ...
Pablo Gervás
LOPSTR
2009
Springer
15 years 6 months ago
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
José Iborra, Naoki Nishida, Germán V...
LOPSTR
1994
Springer
15 years 3 months ago
Using Call/Exit Analysis for Logic Program Transformation
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...
Dmitri Boulanger, Maurice Bruynooghe