A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs

Volpe, P.

doi:10.1007/3-540-49727-7_11

Cited by 7 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As shown in [23], the proof that a verification condition holds, boils down to proving that a formula is valid in a particular model. An interesting result is that whenever the assertion language is decidable [28], the verification conditions can effectively be checked.…”

Section: Resultsmentioning

confidence: 99%

On the verification of finite failure

Gori

Levi

2005

Journal of Computer and System Sciences

View full text Add to dashboard Cite

In Gori [An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations, Theoret. Comput. Sci. 290(1) (2003) 863-936] a new fixpoint semantics which correctly models finite failure has been defined. This semantics is And-compositional, compositional w.r.t. instantiation and is based on a co-continuous operator. Based on this fixpoint semantics a new inductive method able to verify a program w.r.t. the property of finite failure can be defined. In this paper we show how Ferrand's approach, using both a least fixpoint and greatest fixpoint semantics, can be adapted to finite failure. The verification method is not effective. Therefore, we consider an approximation from above and an approximation from below of our semantics, which give two different finite approximations. These approximations are used for effective program verification.

show abstract

Section: Resultsmentioning

confidence: 99%

On the verification of finite failure

Gori

Levi

2005

Journal of Computer and System Sciences

View full text Add to dashboard Cite

show abstract

“…In [40] these and other properties have been considered and deÿned in detail. For example, the class of type properties (like list(X )) has been formally deÿned using regular term grammars.…”

Section: |= Ground(x ) If and Only If (X ) Contains No Variables: Amentioning

confidence: 99%

“…In the next section, as an example, we take the language of properties in [40], which allows us to express the ÿrst order theory of types, groundness, freeness and sharing properties of terms. The language extends the language of [31,32], by providing also an e ective procedure to decide the validity of formulas.…”

Section: Assertions and Speciÿcation Languagesmentioning

confidence: 99%

Abstract interpretation based verification of logic programs

Comini

Gori

Levi

et al. 2003

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

This paper is an overview of our results on the application of abstract interpretation concepts to various problems related to the veriÿcation of logic programs. These include the systematic design of semantics modeling various proof methods and the characterization of assertions as abstract domains. We derive an assertion based veriÿcation method and we show two instances based on different assertion languages: a decidable assertion language and CLP used as an assertion language.

show abstract

“…Mode inference was partly motivated by the revival of interest in logic programming with assertions [4,56,64]. Interestingly, [56] observe that predicates are normally written with an expectation on the initial calling pattern, and hence provide an entry assertion to make the, moding say, of the top-level queries explicit.…”

Section: Work Related To Mode Inferencementioning

confidence: 99%

“…In this context, programmers are typically equipped with an annotation language in which they encode properties of the program state at various program points [56,64]. One approach to verification of logic programs is to trace the program state in the direction of control-flow from an initial goal (forwards analysis), using abstract interpretation to finitely represent and track the state.…”

Section: Introductionmentioning

confidence: 99%

Analysing Logic Programs by Reasoning Backwards

Howe¹,

King

2004

Program Development in Computational Logic

View full text Add to dashboard Cite

Abstract. One recent advance in program development has been the application of abstract interpretation to verify the partial correctness of a (constraint) logic program. Traditionally forwards analysis has been applied that starts with an initial goal and traces the execution in the direction of the control-flow to approximate the program state at each program point. This is often enough to verify assertions that a property holds. The dual approach is to apply backwards analysis to propagate properties of the allowable states against the control-flow to infer queries for which the program will not violate any assertion. Backwards analysis also underpins other program development tasks such as verifying the termination of a logic program or proving that a logic program with a delay mechanism cannot reduce to a state that contains sub-goals which suspend indefinitely. This paper reviews various backwards analyses that have been proposed for logic programs, identifying common threads in these techniques. The analyses are explained through a series of worked examples. The paper concludes with some suggestions for research in backwards analysis for logic program development.

show abstract

A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs

Cited by 7 publications

References 10 publications

On the verification of finite failure

On the verification of finite failure

Abstract interpretation based verification of logic programs

Analysing Logic Programs by Reasoning Backwards

Contact Info

Product

Resources

About