Logic programming and model checking

Cui, Baoqiu; Dong, Yunbai; Du, Xiaoqun; Kumar, K. Narayan; Ramakrishnan, C. R.; Ramakrishnan, I. V.; Roychoudhury, Abhik; Smolka, Scott A.; Warren, David S.

doi:10.1007/bfb0056604

Cited by 27 publications

(18 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, we derived SCOUT which permits folding using multiple recursive clauses. Such a transformation system is particularly important for verifying parameterized concurrent s y s t e m s (such a s a n-process token ring for arbitrary n) using logic program evaluation and deduction 4,16].…”

Section: Resultsmentioning

confidence: 99%

A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs

Roychoudhury

Kumar

Ramakrishnan

et al. 1999

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Given a program P , an unfold/fold program transformation system derives a sequence of programs P = P0 , P1 , : : : , Pn , s u c h t h a t Pi+1 is derived from Pi by application of either an unfolding or a folding step. Existing unfold/fold transformation systems for de nite logic programs di er from one another mainly in the kind of folding transformations they permit at each step. Some allow folding using a single (possibly recursive) clause while others permit folding using multiple non-recursive clauses. However, none allow folding using multiple recursive clauses that are drawn from some previous program in the transformation sequence. In this paper we develop a parameterized framework for unfold/fold transformations by suitably abstracting and extending the proofs of existing transformation systems. Various existing unfold/fold transformation systems can be obtained by instantiating the parameters of the framework. This framework enables us to not only understand the relative strengths and limitations of these systems but also construct new transformation systems. Speci cally we present a more general transformation system that permits folding using multiple recursive clauses that can be drawn from any previous program in the transformation sequence. This new transformation system is also obtained by instantiating our parameterized framework.

show abstract

Section: Resultsmentioning

confidence: 99%

A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs

Roychoudhury

Kumar

Ramakrishnan

et al. 1999

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…On the side of verification, there are many related works which use logic programming based approaches for model checking [4], [47,8], [11], [14], [43] [13]. All of these works share the view that logic programming is a convenient formalism for expressing specifications and concurrent systems, and that using latest generation Prolog technology (efficient) model checking algorithms can be encoded with relatively little effort.…”

Section: Discussionmentioning

confidence: 99%

Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking

Leuschel

Grüner

2002

Logic Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Abstract. We present an abstract partial deduction technique which uses regular types as its domain and which can handle conjunctions, and thus perform deforestation and tupling. We provide a detailed description of all the required operations and present an implementation within the ecce system. We discuss the power of this new specialisation algorithm, especially in the light of verifying and specialising infinite state process algebras. Here, our new algorithm can provide a more precise treatment of synchronisation and can be used for refinement checking.

show abstract

“…Such a system is particularly important for verifying temporal properties of parameterized concurrent systems (such a s a n-bit shift register for any n) using logic program evaluation and deduction 5,17]. The transformation system presented in this paper can be extended to incorporate a goal replacement rule which allows the replacement of a conjunction of atoms in the body of a clause with another semantically equivalent conjunction of atoms provided certain conditions are satis ed (which ensure preservation of weight consistency).…”

Section: Discussionmentioning

confidence: 99%

Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs

Roychoudhury

Kumar

Ramakrishnan

et al. 1999

Advances in Computing Science — ASIAN’99

Self Cite

View full text Add to dashboard Cite

Abstract. Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sato style folding using clauses from a previous program in the transformation sequence: i.e., they fold using a single, non-recursive 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 well-founded model and stable model semantics.

show abstract

Logic programming and model checking

Cited by 27 publications

References 18 publications

A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs

A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs

Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking

Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs

Contact Info

Product

Resources

About