Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Ecient model checking using tabled resolution. In CAV '97, Lecture Notes in Computer Science 1254, pages 143154. SpringerVerlag, 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Since chapter 2 has shown a calculus modelchecking problem can be translated to a boolean equation system, LAFP may be used to solve model checking problem in the domain of the full calculus. One reason we choose it is because the algorithm has been implemented on at least two verification tools [41, 13], and in both cases shows superior performance in practice, which is partially due to its on the fly style evaluation. It is also the base for an algorithm in [50] which, in addition to good practical performance, matches the best complexities of linear space global algorithm for the full ....

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. W. Swift, and D. S. Warren. E#cient model checking using tabled resolution. In Proceedings of the 9th International Conference on Computer-Aided Verification (CAV '97), Haifa, Israel, July 1997. Springer-Verlag.

....with reactive systems where the number of processes is a parameter which does not change over time. Our method is also related to a number of other methods which use logic programming and, more generally, constraint logic programming for the veri cation of reactive systems (see, for instance, [6,8,15,19]) The main novelty of our approach w.r.t. these methods is that it combines logic programming and monadic second order logic, thereby modelling in a very direct way systems with an unbounded (and possibly variable) number of processes. Our unfold fold synthesis method and our unfold fold proof ....

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Ecient model checking using tabled resolution. In Proc. CAV '97, LNCS 1254, pp. 143154. Springer, 1997.

....with reactive systems where the number of processes is a parameter which does not change over time. Our method is also related to a number of other methods which use logic programming and, more generally, constraint logic programming for the veri cation of reactive systems (see, for instance, [7,10,17,21] and [9] for a survey) The main novelty of our approach w.r.t. these methods is that it combines logic programming and monadic second order logic, thereby modelling in a very direct way systems with an unbounded (and variable) number of processes. Our unfold fold synthesis method and our ....

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Ecient model checking using tabled resolution. In CAV '97, Lecture Notes in Computer Science 1254, pages 143154. SpringerVerlag, 1997.

....we show how we have implemented exhaustive model checking for finite state CSP(LP) specifications. 3 Model Checking using Tabling and Partial Evaluation Given a logic programming representation for a system, one can try to apply various logic programming based model checking approaches such as [21, 7], 9] 18, 17] 20] Our first attempts have focused on using the CTL intepreter described in [18] This interpreter has to be executed by a table based Prolog system (such as XSB Prolog) to achieve exhaustive CTL model checking for all finite state systems. A drawback of the interpreter in [18] ....

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. E#cient model checking using tabled resolution. In O. Grumberg, editor, Proceedings of the International Conference on ComputerAided Verification (CAV'97), LNCS 1254, pages 143--154. Springer-Verlag, 1997.

....of logic programs, augmented with abstract interpretation, for solving coverability problems of in nite state Petri nets. In [3] some CTL operators of in nite state concurrent systems are expressed in terms of least and greatest xed points of the CLP programs used to describe the systems. In [13] the authors present XMC, a model checking system implemented in the tabulation based logic programming language XSB. XMC can verify calculus properties of nite state transitions systems expressed in a CCS like language, with performances comparable to that of state of the art model checkers. ....

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Ecient model checking using tabled resolution. In CAV '97, Lecture Notes in Computer Science 1254, pages 143154. SpringerVerlag, 1997.

....to [24,26] also the method presented in [18] uses constraint logic programs to represent in nite state systems. This method can be used to verify CTL properties of these systems by computing approximations of least and greatest xpoints via abstract interpretation. iv) The methods in [50] and [61] make use of logic programs (with and without constraints, respectively) to represent nite state systems. These two methods employ tabulation techniques [76] to compute xpoints and they may be used for verifying CTL properties and modal calculus [40,57] properties, respectively. It is di cult ....

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Ecient model checking using tabled resolution. In CAV '97, Lecture Notes in Computer Science 1254, pages 143154. SpringerVerlag, 1997.

....of logic programs, augmented with abstract interpretation, for solving coverability problems of in nite state Petri nets. In [5] some CTL operators of in nite state concurrent systems are expressed in terms of least and greatest xed points of the CLP programs used to encode the systems. In [14] the authors present XMC, a model checking system implemented in the tabulation based logic programming language XSB. XMC can verify calculus properties of nite state transitions systems expressed in a CCS like language, with performances comparable to that of state of the art model checkers. ....

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Ecient model checking using tabled resolution. In Proc. 9th International Computer Aided Verication Conference, pages 143154, 1997.

....generated on the fly (locally) when needed for the verification of a specific property query. Recently there have been several attempts to formalize and host model checking inside the logic programming paradigm. One of the first attempts were reported by the logic programming group at Stony Brook [16]. They describe an implementation of a model checking system called XMC [9] in the logic programming system XSB (a logic programming system based on tabulation [4] In XMC the system model is described in a CCS like language and properties are described in the alternation free fragment of the ....

....free fragment of the modal mu calculus. While providing a symbolic description of states (CCS formulas) the approach does not o#er an implicit representation of sets of states in the true sense of symbolic model checking. However, XMC relies on local checking and the results reported in [16] show that the approach can compete with state of the art model checkers, although implemented in a general purpose logic programming system. Independently Charatonik and Podelski [3] and Delzanno and Podelski [7, 8] described an alternative approach to model checking in which the transition ....

[Article contains additional citation context not shown here]

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. Smolka, T. Swift, and D. S. Warren. E#cient Model Checking using Tabled Resolution. In Proc of Computer Aided Verification (CAV), Lecture Notes in Computer Science 1254. Springer Verlag, 1997.

....recently been devoted for the incorporation into model checking of abstraction and deduction techniques [15] Recent papers also demonstrate the usefulness of logic programming and constraint logic programming as a basis for the veri cation of nite or in nite state systems. In particular, in [13] the authors present XMC, a model checking system implemented in the tabulation based logic programming language XSB. XMC can verify calculus properties of nite state transitions systems expressed in a CCS like language, with performances comparable to that of state of theart model checkers. In ....

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Ecient model checking using tabled resolution. In CAV '97, Lecture Notes in Computer Science 1254, pages 143154. SpringerVerlag, 1997.

....nets. iii) Similarly to [9] also the method presented in [5] uses constraint logic programs to represent in nite state systems. This method can be applied to verify CTL properties of such systems by computing approximations of least and greatest xed points via abstract interpretation. iv) In [17] it is shown that by using tabulation based logic programming systems it is possible to e ciently verify calculus properties of nite state transitions systems expressed in a CCS like language. v) The method in [14] uses CLP with nite domains, extended with constructive negation and tabled ....

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Ecient model checking using tabled resolution. In CAV '97, Lecture Notes in Computer Science 1254, pages 143154. SpringerVerlag, 1997.

....the set of consequences of the perfect model of a logic program is not recursively enumerable. SLG resolution [5] combines resolution and memoing (also called tabling) and it is more e ective than the SLDNF or SLS resolution methods for dealing with in nitely failed derivations. Indeed, in [26] it has been shown that logic programming systems based on tabling are good for inductive theorem proving and they are able to verify CTL properties of nite state transition system [10] However, the unfold fold proof method is more powerful than logic programming systems based on tabling, ....

Y.S. Ramakrishna, C.R. Ramakrishnan, I.V. Ramakrishnan, S.A. Smolka, T. Swift, and D.S. Warren. Ecient model checking using tabled resolution. In CAV '97, Lecture Notes in Computer Science 1254, pages 143154. Springer-Verlag, 1997.

....of the perfect model of a logic program is not recursively enumerable. SLG resolution [32] combines resolution and memoing (also called tabling) SLG resolution is an e ective method. It is more powerful than the SLDNF resolution methods for dealing with in nitely failed derivations. Indeed, in [129] it has been shown that logic programming systems based on tabling are good for inductive theorem proving and they are able to verify CTL properties of nite state transition system [61] However, the unfold fold proof method is more powerful than logic programming systems based on tabling, ....

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Ecient model checking using tabled resolution. In CAV '97, Lecture Notes in Computer Science 1254, pages 143154. Springer-Verlag, 1997.

....of the perfect model of a logic program is not recursively enumerable. SLG resolution [6] combines resolution and memoing (also called tabling) SLG resolution is an e ective method. It is more powerful than the SLDNF resolution methods for dealing with in nitely failed derivations. Indeed, in [25] it has been shown that logic programming systems based on tabling are good for inductive theorem proving and they are able to verify CTL properties of nite state transition system [11] However, the unfold fold proof method is more powerful than logic programming systems based on tabling, ....

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Ecient model checking using tabled resolution. In CAV '97, Lecture Notes in Computer Science 1254, pages 143154. Springer-Verlag, 1997.

....model a hardware or software system as a finite, labelled transition system (LTS) which is then exhaustively explored to decide whether a given specification holds for all reachable states. One can even use tabling based logic programming as an e#cient means of performing explicit model checking [14]. However, many software systems cannot be modelled by a finite LTS (or similar system) and, as a consequence, there has been a lot of e#ort to enable infinite model checking (e.g. 17] We argue that inverse computation in general, and our APD technique in particular, has a lot to o#er for ....

Y.S. Ramakrishna, C.R. Ramakrishnan, I.V. Ramakrishnan, S.A. Smolka, T. Swift, D.S. Warren. E#cient model checking using tabled resolution. In O. Grumberg (ed.) Computer-Aided Verification, LNCS 1254, 143--154. Springer-Verlag, 1997.

....concurrency, partial evaluation, Petri nets. 1 Introduction and Summary Recently there has been interest in applying logic programming techniques to model checking. Table based logic programming and set based analysis can be used as an e#cient means of performing explicit model checking [46][7] Despite the success of model checking, most systems must still be substantially simplified and considerable human ingenuity is required to arrive at the stage where the push button automation can be applied [49] Furthermore, most software systems cannot be modelled directly by a finite state ....

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. E#cient model checking using tabled resolution. In O. Grumberg, editor, Proceedings CAV'97, LNCS 1254, pages 143--154. SpringerVerlag, 1997.

No context found.

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. L. Swift, and D. S. Warren. E#cient model checking using tabled resolution. In Proceedings of the 9th International Conference on Computer-Aided Verification (CAV '97), Haifa, Israel, July 1997. Springer-Verlag.

No context found.

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. W. Swift, and D. S. Warren. E#cient model checking using tabled resolution. In Proc. of CAV'97, 1997.

....conditions and a conclusion, and can be readily encoded as a logic program. The least xed point semantics of logic programs ensures that existence of a successful tableau can be checked using query evaluation (using a suitable resolution strategy) over the encoded program. The XMC model checker [23] shows that such a check can be done very eciently as well. Checking for existence of a tableau is only a part of the problem. It is often necessary to construct sucient evidence to show the existence or absence of a tableau. This evidence may be used, for instance, to debug speci cations that ....

....evidence tree construction is completed. The constructed evidence tree is shown in Figure 2(d) 4 Application to Model Checking Model checking [7] is an automatic technique for verifying if a nite state concurrent system speci cation satis es a property expressed as a temporal logic formula. In [23] we had demonstrated the feasibility of using logic programming for building exible and ecient model checkers. In particular, using the XSB tabled logic programming system we developed XMC, a local model checker for a CCS like value passing system speci cation language and the modal mu calculus ....

Y.S. Ramakrishna, C.R. Ramakrishnan, I.V. Ramakrishnan, S.A. Smolka, T. Swift, and D.S. Warren. E- cient model checking using tabled resolution. In CAV, LNCS 1254, 1997.

No context found.

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Ecient model checking using tabled resolution. In CAV '97, Lecture Notes in Computer Science 1254, pages 143154. SpringerVerlag, 1997.

No context found.

Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. E#cient model checking using tabled resolution. In O. Grumberg, editor, Proceedings of the International Conference on ComputerAided Verification (CAV'97), LNCS 1254, pages 143--154. Springer-Verlag, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC