Results 1  10
of
28
Verification of Parameterized Systems Using Logic Program Transformations
, 1999
"... We show how the problem of verifying parameterized systems can be... ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
We show how the problem of verifying parameterized systems can be...
Transformation Rules for Locally Stratified Constraint Logic Programs
, 2004
"... We propose a set of transformation rules for constraint logic programs with negation. We assume that every program is locally strati ed and, thus, it has a unique perfect model. We give sucient conditions which ensure that the proposed set of transformation rules preserves the perfect model of ..."
Abstract

Cited by 22 (19 self)
 Add to MetaCart
(Show Context)
We propose a set of transformation rules for constraint logic programs with negation. We assume that every program is locally strati ed and, thus, it has a unique perfect model. We give sucient conditions which ensure that the proposed set of transformation rules preserves the perfect model of the programs. Our rules extend in some respects the rules for logic programs and constraint logic programs already considered in the literature and, in particular, they include a rule for unfolding a clause with respect to a negative literal.
A Transformation System for Lazy Functional Logic Programs
, 1999
"... Needed narrowing is a complete operational principle for modern declarative languages which integrate the best features of (lazy) functional and logic programming. We define a transformation methodology for functional logic programs based on needed narrowing. We provide (strong) correctness results ..."
Abstract

Cited by 21 (12 self)
 Add to MetaCart
Needed narrowing is a complete operational principle for modern declarative languages which integrate the best features of (lazy) functional and logic programming. We define a transformation methodology for functional logic programs based on needed narrowing. We provide (strong) correctness results for the transformation system w.r.t. the set of computed values and answer substitutions and show that the prominent properties of needed narrowing  namely, the optimality w.r.t. the length of derivations and the number of computed solutions  carry over to the transformation process and the transformed programs. We illustrate the power of the system by taking on in our setting two wellknown transformation strategies (composition and tupling). We also provide an implementation of the transformation system which, by means of some experimental results, highlights the benefits of our approach.
Automated Inductive Verification of Parameterized Protocols
 In CAV 2001
, 2001
"... A parameterized concurrent system represents an infinite family (of finite state systems) parameterized by a recursively... ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
A parameterized concurrent system represents an infinite family (of finite state systems) parameterized by a recursively...
Beyond TamakiSato Style Unfold/Fold Transformations for Normal Logic Programs
 IN ASIAN, LNCS 1742
, 1999
"... Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only TamakiSato style folding using clauses from a previous program in the transformation sequence: i.e., they fold using a singl ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only TamakiSato style folding using clauses from a previous program in the transformation sequence: i.e., they fold using a single, nonrecursive clause. In this paper we present a transformation system that permits folding in the presence of recursion, disjunction, as well as negation. We show that the transformations are correct with respect to various semantics of negation including the wellfounded model and stable model semantics.
R.: A coinduction rule for entailment of recursively defined properties
 In Stuckey, P.J., ed.: 14th CP. Volume 5202 of LNCS
, 2008
"... Abstract. Recursively defined properties are ubiquitous. We present a proof method for establishing entailment G  = H of such properties G and H over a set of common variables. The main contribution is a particular proof rule based intuitively upon the concept of coinduction. This rule allows the i ..."
Abstract

Cited by 10 (9 self)
 Add to MetaCart
(Show Context)
Abstract. Recursively defined properties are ubiquitous. We present a proof method for establishing entailment G  = H of such properties G and H over a set of common variables. The main contribution is a particular proof rule based intuitively upon the concept of coinduction. This rule allows the inductive step of assuming that an entailment holds during the proof the entailment. In general, the proof method is based on an unfolding (and no folding) algorithm that reduces recursive definitions to a point where only constraint solving is necessary. The constraintbased proof obligation is then discharged with available solvers. The algorithm executes the proof by a searchbased method which automatically discovers the opportunity of applying induction instead of the user having to specify some induction schema, and which does not require any base case. 1
Proofs by program transformations
 proceedings of Logicbased Program Synthesis and Transformation (LOPSTR
, 1999
"... ..."
Program Transformations for Automated Verification of Parameterized Concurrent Systems
, 1999
"... We show how the problem of verifying parameterized systems can be reduced to the problem of determining the equivalence of goals in a logic program. We further show how goal equivalences can be established using inductionbased proofs. Such proofs rely on a powerful new theory of logic program trans ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We show how the problem of verifying parameterized systems can be reduced to the problem of determining the equivalence of goals in a logic program. We further show how goal equivalences can be established using inductionbased proofs. Such proofs rely on a powerful new theory of logic program transformations (encompassing unfold, fold and goal replacement transformations). We present this theory of logic program transformations which in particular, allows a more general folding rule (as compared to the state of the art). We show how our more general transformations are useful for constructing verification proofs of parameterized systems. Moreover these verification proofs can be largely automated, and are applicable to a variety of network topologies, including uni and bidirectional chains, rings, and trees of processes. Unfold transformations in our system correspond to algorithmic modelchecking steps, fold and goal replacement correspond to deductve steps. All three types of transfo...
N.D.: Distillation with Labelled Transition Systems
 In: Proceedings of the SIGPLAN Symposium on Partial Evaluation and SemanticsBased Program Manipulation
, 2012
"... In this paper, we provide an improved basis for the “distillation” program transformation. It is known that superlinear speedups can be obtained using distillation, but cannot be obtained by other earlier automatic program transformation techniques such as deforestation, positive supercompilation ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
In this paper, we provide an improved basis for the “distillation” program transformation. It is known that superlinear speedups can be obtained using distillation, but cannot be obtained by other earlier automatic program transformation techniques such as deforestation, positive supercompilation and partial evaluation. We give distillation an improved semantic basis, and explain how superlinear speedups can occur.
Automatic Correctness Proofs for Logic Program Transformations ⋆
"... Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable wellfounded orderings with the proof trees of the atoms belonging to the least Herbrand models of the programs. In practice, t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable wellfounded orderings with the proof trees of the atoms belonging to the least Herbrand models of the programs. In practice, these orderings are given by ‘clause measures’, that is, measures associated with the clauses of the programs to be transformed. In the unfold/fold transformation systems proposed so far, clause measures are fixed in advance, independently of the transformations to be proved correct. In this paper we propose a method for the automatic generation of the clause measures which, instead, takes into account the particular program transformation at hand. During the transformation process we construct a system of linear equations and inequations whose unknowns are the clause measures to be found, and the correctness of the transformation is guaranteed by the satisfiability of that system. Through some examples we show that our method is able to establish in a fully automatic way the correctness of program transformations which, by using other methods, are proved correct at the expense of fixing sophisticated clause measures. 1