Clarke, E., Grumberg, O., and Long, D. 1992. Model checking abstraction. In 19th POPL, 343--354. ACM Press.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....safety model checking. 70 COUSOT AND COUSOT Reduction by abstraction consists in approximating infinite or very large finite transition systems by finite ones, on which existing algorithms designed for finite automata are directly applicable. This semi verification idea was first introduced by (Clarke et al. 1992) and progressively refined to cope with wider classes of temporal logic (Kelb, 1994, Dams et al. 1997, Cleaveland et al. 1995) or calculus formul (Graf and Loiseaux, 1993, Loiseaux et al. 1995, Cridlig, 1995, Cridlig, 1996) We extend this to abstract transition systems which are infinite. The ....

....abstraction #L, ## # # 2 # 2 #M, ##. The correctness follows from the fact that Galois connection compose: ##(S) ## # # 2 ## 1 # 1 ## 2 #M, ##. An abstraction can also be parameterized so as to allow for problem dependent instantiations, as shown by the following example. EXAMPLE: (Clarke et al. 1992), Cleaveland et al. 1995) Dams et al. 1997) Jackson, 1994) and others implicitly consider a restricted form of abstraction given by the Galois connection ##(S) ## # #[h] # [h] ##(S # ) ##,whereS is the set of concrete states, S # is the set of abstract states, #[h] X) # = h(x) ....

Clarke, E., Grumberg, O., and Long, D. 1992. Model checking abstraction. In 19th POPL, 343--354. ACM Press.

....safety model checking. 70 COUSOT AND COUSOT Reduction by abstraction consists in approximating infinite or very large finite transition systems by finite ones, on which existing algorithms designed for finite automata are directly applicable. This semi verification idea was first introduced by (Clarke et al. 1992) and progressively refined to cope with wider classes of temporal logic (Kelb, 1994, Dams et al. 1997, Cleaveland et al. 1995) or calculus formul (Graf and Loiseaux, 1993, Loiseaux et al. 1995, Cridlig, 1995, Cridlig, 1996) We extend this to abstract transition systems which are infinite. ....

....hL, vi # 2 # 2 hM, i. The correctness follows from the fact that Galois connection compose: h# (S) i # 2 # 1 # 1 # 2 hM, i. An abstraction can also be parameterized so as to allow for problem dependent instantiations, as shown by the following example. EXAMPLE: (Clarke et al. 1992), Cleaveland et al. 1995) Dams et al. 1997) Jackson, 1994) and others implicitly consider a restricted form of abstraction given by the Galois connection h# (S) i #[h] # [h] h# (S # ) i, where S is the set of concrete states, S # is the set of abstract states, #[h] X) 4 ....

Clarke, E., Grumberg, O., and Long, D. 1992. Model checking abstraction. In 19th POPL, 343--354. ACM Press.

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