Beer, I., Ben-David, S., Eisner, C., Geist, D., Gluhovsky, L., Heyman, T., Landver, A., Paanah, P., Rodeh, Y., Ronin, G., and Wolfsthal. Y., \RuleBase: Model Checking at IBM," Proc. of 9 International Conference on Computer Aided Veri - cation (CAV), LNCS 1254. Springer-Verlag, 1997, pp.279-290.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....1 and the SAT checker Grasp [11,12] without making use of features that are unique to either one of them. i We distinguish between the tool BM and the method BMC. We benchmarked the various optimizations, and also compared them to re suits achieved by RuleBase, IBM s BDD based Model Checker [1, 2]. RuleBase is considered one of the strongest verification tools on the market, and includes most of the reductions and BDD optimizations that have been published in recent years. The benchmark s database included 13 randomly selected reallife designs from IBM s internal benchmark set. ....

I. Beer, S. Ben-David, C. Eisner, D. Geist, L. Gluhovsky, T. Heyman, A. Landver, P. Paanah, Y. Rodeh, G. Ronin, and Y. Wolfsthai. RuleBase: Model checking at IBM. In Orna Grumberg, editor, Proc. 9 th Intl. Conference on Computer Aided Verification (CAV'97), volume 1254 of Lect. Notes in Comp. Sci., pages 480-483. Springer-Verlag, 1997.

....the next state (second state on the path) F requires to be true sometime in the future (should be true on at least one state on the path) U means that holds until becomes true (there is some state on the path at which is true and on all preceding states is true) 2. 2 RuleBase RuleBase [1, 2] is an extension of the SMV model checker, developed by IBM. A model in RuleBase is specified in the Environment Description Language (EDL) which is a dialect of the SMV description language. RuleBase also allows verification of designs in traditional hardware description languages such as Verilog ....

I. Beer, S. Ben-David, C. Eisner, D. Geist, L. Gluhovsky, T. Heyman, A. Landver, P. Paanah, Y. Rodeh, G. Ronin, and Y. Wolfsthai. Rulebase: Model Checking at IBM. In Conference on Computer Aided Verification CAV'97, pages 480-483, 1997.

....abstractions which will always be too abstract to proof some peculiar functional specification. The most industrialized of the formal methods is certainly model checking [16 , 74] After the famous FDIV design fault in the Pentium processor, most hardware design companies now have model checkers [6 , 13]. Present day hard# ware model checkers can verify circuit designs of a few hundreds of registers (with abstraction of their surrounding environment) Model checking proceeds by exhaustive enumeration of the state space and is therefore subject to state space explosion: although the checking ....

I. Beer, S. Ben-David, C. Eisner, D. Geist, L. Gluhovsky, T. Heyman, A. Landver, P. Paanah, Y. Rodeh, G. Ronin, and Y. Wolfsthal. RuleBase: Model checking at IBM. In O. Grumberg, editor, Proc. 9 Int. Conf. CAV ' 97 , Haifa, IL, LNCS 1254, pages 480--483. Springer-Verlag, 22--25 Jul. 1997.

....or to expand a counter example. A random choice is consistent with the counter example since all variables in the counter examples were chosen using the cone of influence reduction. Therefore, variables outside that cone cannot influence them. Such an inflator is part of the RuleBase package [3][26]. We can improve the simple idea of observing the counter example by using the inflator. The counter example is inflated, using a set of variables mentioned in the coverability tasks. All the coverability tasks that are covered by the inflated trace are removed from the list. This reduces the ....

I. Beer, S. Ben-David, C. Eisner, D. Geist, L. Gluhovsky, T. Heyman, A. Landver, P. Paanah, Y. Rodeh, G. Ronin, and Y. Wolfsthal. RuleBase: Model Checking at IBM. Proc. Conference on Computer Aided Verification (CAV), 1997.

....AGp. Thus applying the heuristic of the last paragraph essentially implements an algorithm that computes the set of reachable states in a BFS manner while checking on the fly for states violating the safety property (as the early evaluation technique in 174 A. Biere, E.M. Clarke, and Y. Zhu [1]) An example of this technique is shown in figure 4 using the Kripke structure of figure 5. 1 #E(Fp) R F 1 #E(p) # E(p) 1 #E(XFp) 1,2 #E(Fp) R split 1 #E(Fp) # 2 #E(Fp) R F 2 #E(p) # E(p) 2 #E(XFp) 2,3 #E(Fp) R split 2 #E(Fp) 3 #E(Fp) # R F 3 #E(p) # ....

I. Beer, S. Ben-David, C. Eisner, D. Geist, L. Gluhovsky, T. Heyman, A. Landver, P. Paanah, Y. Rodeh, G. Ronin, and Y. Wolfsthal. Rulebase: Model checking at IBM. In CVA'97, number 1254 in LNCS, pages 480--483. Springer-Verlag, 1997.

....counterexample for the dual safety property AG:p. Thus applying the heuristic of the last paragraph essentially implements an algorithm that computes the set of reachable states in a BFS manner while checking on the fly for states violating the safety property (as the early evaluation technique in [1]) An example of this technique is shown in figure 4 using the Kripke structure of figure 5. f1g E(Fp) R F f1g E(p) fg E(p) f1g E(XFp) f1;2g E(Fp) R split f1g E(Fp) f2g E(Fp) R F f2g E(p) fg E(p) f2g E(XFp) f2;3g E(Fp) R split f2g E(Fp) f3g E(Fp) oe R ....

I. Beer, S. Ben-David, C. Eisner, D. Geist, L. Gluhovsky, T. Heyman, A. Landver, P. Paanah, Y. Rodeh, G. Ronin, and Y. Wolfsthal. Rulebase: Model checking at IBM. In CVA'97, number 1254 in LNCS, pages 480--483. SpringerVerlag, 1997.

....1 and the SAT checker Grasp [11, 12] without making use of features that are unique to either one of them. 1 We distinguish between the tool BMC and the method BMC. We benchmarked the various optimizations, and also compared them to results achieved by RuleBase, IBM s BDD based Model Checker [1, 2]. RuleBase is considered one of the strongest verification tools on the market, and includes most of the reductions and BDD optimizations that have been published in recent years. The benchmark s database included 13 randomly selected reallife designs from IBM s internal benchmark set. ....

I. Beer, S. Ben-David, C. Eisner, D. Geist, L. Gluhovsky, T. Heyman, A. Landver, P. Paanah, Y. Rodeh, G. Ronin, and Y. Wolfsthal. RuleBase: Model checking at IBM. In Orna Grumberg, editor, Proc. 9 th Intl. Conference on Computer Aided Verification (CAV'97), volume 1254 of Lect. Notes in Comp. Sci., pages 480--483. Springer-Verlag, 1997.

....and determine the set of states in the model that satisfy the formula. Tools based on model checking [16] were successful in finding subtle bugs in real life designs [17, 9] and are currently in use by the hardware industry as part of the verification efforts of newly developed hardware designs [1, 14]. Unfortunately, similar applications of model checking to programs are very limited. One reason for this deficiency arises from the fact that large hardware systems are usually composed of many components working in parallel. Software systems, on the other hand, can be extremely large even when ....

I. Beer, S. Ben-David, C. Eisner, D. Geist, L. Gluhovsky, T. Heyman, A. Landver, P. Paanah, Y. Rodeh, and Y. Wolfstahl. Rulebase: Model checking at IBM. In Proc. of the 9th International Conference on Computer Aided Verification, LNCS vol. 1254, pages 480--484. Springer, June 1997.

No context found.

Beer, I., Ben-David, S., Eisner, C., Geist, D., Gluhovsky, L., Heyman, T., Landver, A., Paanah, P., Rodeh, Y., Ronin, G., and Wolfsthal. Y., \RuleBase: Model Checking at IBM," Proc. of 9 International Conference on Computer Aided Veri - cation (CAV), LNCS 1254. Springer-Verlag, 1997, pp.279-290.

No context found.

I. Beer, S. Ben-David, C. Eisner, D. Geist, L. Gluhovsky, T. Heyman, A. Landver, P. Paanah, Y. Rodeh, G. Ronin, and Y. Wolfsthal. RuleBase: Model checking at IBM. In Proc. 9 Veri cation (CAV), LNCS 1254. Springer-Verlag, 1997.

No context found.

Ilan Beer, Shoham Ben-David, Cindy Eisner, Daniel Geist, L. Gluhovsky, Tamir Heyman, Avner Landver, P. Paanah, Yoav Rodeh, G. Ronin, and Yaron Wolfsthal. Rulebase: Model checking at IBM. In Computer Aided Verification, pages 480--483, 1997.

....was augmented by repeatedly re ning the translator. We believe that the translation techniques and the tool generated for this project can be useful for similar projects, especially taking into account the popularity of the C language. The symbolic part of the work was performed using RuleBase [4, 3]. RuleBase was originally based on a version of SMV [14] After eight years of development, the original SMV code is a small part of the whole. Alternative model checking algorithms [17, 16, 1, 6] have been added, the original engine has been optimized [15, 10] the temporal logic has been ....

....with the processes it has spawned using a set of shared variables. We model these shared variables in Promela as a set of global variables, one per main process. Say, for instance, that we want to declare the integer variable glb for 3 processes. We declare it as an array variable using int glb[3]. Access to these global variables now depends on the process number, which we pass as a parameter from the main process to its called processes. Thus, we execute run main(1) run main(2) run main(3) and convert a process firstproc(parm) that calls secondproc(moreparm) into firstproc(id,parm) ....

I. Beer, S. Ben-David, C. Eisner, D. Geist, L. Gluhovsky, T. Heyman, A. Landver, P. Paanah, Y. Rodeh, G. Ronin, and Y. Wolfsthal. RuleBase: Model checking at IBM. In Proc. 9 (CAV), LNCS 1254. Springer-Verlag, 1997.

....contrast, we put an arti cial limit on the level of nesting, but easily deal with a high level of nondeterministic behavior. 3 Preliminaries The work described in this paper was performed using RuleBase [6] RuleBase was originally based on a version of SMV [32] After eight years of development [4, 8, 3, 9, 7, 5, 6, 21], the original SMV code is a small part of the whole. Nevertheless, the garbage collection mechanism of SMV remains. The input language of RuleBase is EDL, a dialect of the language SMV. RuleBase uses the temporal logic Sugar [4] as its speci cation language. Sugar combines the power of regular ....

I. Beer, S. Ben-David, C. Eisner, D. Geist, L. Gluhovsky, T. Heyman, A. Landver, P. Paanah, Y. Rodeh, G. Ronin, and Y. Wolfsthal. Rulebase: Model checking at IBM. In Proc. 9 th International Conference on Computer Aided Verication (CAV), LNCS 1254. Springer-Verlag, 1997.

No context found.

I. Beer, S. Ben-David, C. Eisner, D. Geist, L. Gluhovsky, T. Heyman, A. Landver, P. Paanah, Y. Rodeh, G. Ronin, and Y. Wolfsthal. Rulebase: Model checking at IBM. In Computer Aided Verification (CAV'97), number 1254 in Lecture Notes in Computer Science, pages 480--483. 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