A Model Checker for Value-Passing Mu-Calculus Using Logic Programming

نویسنده

  • C. R. Ramakrishnan
چکیده

Recent advances in logic programming have been successfully used to build practical verification toolsets, as evidenced by the XMC system. Thus far, XMC has supported value-passing process languages, but has been limited to using the propositional fragment of modal mucalculus as the property specification logic. In this paper, we explore the use of data variables in the property logic. In particular, we present valuepassing modal mu-calculus, its formal semantics and describe a natural implementation of this semantics as a logic program. Since logic programs naturally deal with variables and substitutions, such an implementation need not pay any additional price— either in terms of performance, or in complexity of implementation— for having the added flexibility of data variables in the property logic. Our preliminary implementation supports this expectation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eecient Model Checking Using Tabled Resolution ?

We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable xed-point engine for implementing eecient local model checkers. In particular, we present XMC, an XSB-based local model checker for a CCS-like value-passing language and the alternation-free fragment of the modal mu-calculus. XMC is written in under 200 lines of XSB code, which constitute a declara...

متن کامل

Efficient Model Checking Using Tabled Resolution

We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable fixed-point engine for implementing efficient local model checkers. In particular, we present XMC, an XSBbased local model checker for a CCS-like value-passing language and the alternation-free fragment of the modal mu-calculus. XMC is written in under 200 lines of XSB code, which constitute a decl...

متن کامل

Model Checking with Tabled Logic Programming∗

This article presents a tutorial overview of using Tabled Logic Programming for model checking finite-state systems. In this article, we mainly focus on the work done by the LMC group in Stony Brook, pointing out the relevant related works along the way. We describe a complete model checkers for the computation tree logic (CTL), the modal mu-calculus, the linear temporal logic (LTL) and a value...

متن کامل

To appear : Proceedings of PLIP / ALP ’ 98 Logic Programming and Model Checking ?

We report on the current status of the LMC project, which seeks to deploy the latest developments in logic-programming technology to advance the state of the art of system speci cation and veri cation. In particular, the XMC model checker for value-passing CCS and the modal mu-calculus is discussed, as well as the XSB tabled logic programming system, on which XMC is based. Additionally, several...

متن کامل

Logic Programming and Model Checking

We report on the current status of the LMC project, which seeks to deploy the latest developments in logic-programming technology to advance the state of the art of system speci cation and veri cation. In particular, the XMCmodel checker for value-passing CCS and the modal mu-calculus is discussed, as well as the XSB tabled logic programming system, on which XMC is based. Additionally, several ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001