#### DMCA

## ARMC: the logical choice for software model checking with abstraction refinement (2007)

### Cached

### Download Links

- [www.mpi-sws.mpg.de]
- [www.mpi-sws.org]
- [www7.in.tum.de]
- DBLP

### Other Repositories/Bibliography

Venue: | In PADL |

Citations: | 79 - 18 self |

### Citations

2295 |
Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints.
- Cousot, Cousot
- 1977
(Show Context)
Citation Context ...ocedure abstract post implements a function that is defined by the functional composition of three functions for which the notation α, post and γ is customary in the abstract interpretation framework =-=[7]-=-: the abstraction, the one-step-reachability operator, and the concretization. As we will show below, the procedure abstract post is implemented in terms of the three procedures abstract, post and con... |

865 | The Semantics of Constraint Logic Programs,
- Jaffar, Maher, et al.
- 1998
(Show Context)
Citation Context ... programming language may lead to an elegant and concise implementation of a practical tool. In this paper we describe the outcome of our investigation. Using a Prolog system together with extensions =-=[15,17]-=- as the implementation platform of our choice we have built such a tool, called ARMC (for Abstraction Refinement Model Checking). The tool has already been used for practical verification [20]. Our wo... |

836 | Counterexample-guided abstraction refinement.
- Clarke, Grumberg, et al.
- 2000
(Show Context)
Citation Context ...e(iter(3), ctrl(loc_3), [1,3], 5). abst_reach_state(iter(4), ctrl(loc_1), [3], 6). abst_reach_state(iter(5), ctrl(loc_2), [3], 7). abst_reach_state(iter(5), ctrl(loc_4), [3], 8). abst_reach_state(iter=-=(6)-=-, ctrl(loc_err), [3], 9). stmt 4 stmt 5 abst reach state(iter(6), ctrl(loc err), [3], 9) abst_parent(2, from(state(1), trans(stmt_0))). abst_parent(3, from(state(2), trans(stmt_1))). abst_parent(4, fr... |

532 | Lazy abstraction.
- Henzinger, Jhala, et al.
- 2002
(Show Context)
Citation Context ...n used for practical verification. 1 Introduction Software model checking with (counterexample-guided) abstraction refinement is emerging as a practical approach to verify industrial software systems =-=[2,4,5,13,16]-=-. Its distinguishing characteristics lie in the way it applies logical reasoning to deal with abstraction. In particular, it implements the automatic construction of abstract domains based on logical ... |

485 | Automatic predicate abstraction of C programs
- Ball, Majumdar, et al.
- 2001
(Show Context)
Citation Context ...n used for practical verification. 1 Introduction Software model checking with (counterexample-guided) abstraction refinement is emerging as a practical approach to verify industrial software systems =-=[2,4,5,13,16]-=-. Its distinguishing characteristics lie in the way it applies logical reasoning to deal with abstraction. In particular, it implements the automatic construction of abstract domains based on logical ... |

267 | Abstractions from proofs - Henzinger, Jhala, et al. - 2004 |

266 | A static analyzer for large safety-critical software,” in PLDI,
- Blanchet, Cousot, et al.
- 2003
(Show Context)
Citation Context ...ond recursive step. For simplicity of presentationsstmt 1 ARMC: The Logical Choice for Software Model Checking 257 abst reach state(iter(0), ctrl(loc 0), [], 1) abst reach state(iter(1), ctrl(loc 1), =-=[2,3,4]-=-, 2) abst reach state(iter(2), ctrl(loc 2), [2,3,4], 3) abst reach state(iter(2), ctrl(loc 4), [2,3,4], 4) stmt 2 abst reach state(iter(3), ctrl(loc 3), [1,3,4], 5) stmt 0 preds(s(ctrl(_), data(X,Y)),... |

233 | Modular verification of software components in C
- Chaki, Clarke, et al.
- 2002
(Show Context)
Citation Context ...n used for practical verification. 1 Introduction Software model checking with (counterexample-guided) abstraction refinement is emerging as a practical approach to verify industrial software systems =-=[2,4,5,13,16]-=-. Its distinguishing characteristics lie in the way it applies logical reasoning to deal with abstraction. In particular, it implements the automatic construction of abstract domains based on logical ... |

62 | Relative completeness of abstraction refinement for software model checking
- Ball, Podelski, et al.
- 2002
(Show Context)
Citation Context ... the Prolog database. Each such fact represents an abstract state that is determined to be reachable by the abstract fixpoint computation. For example, the fact abst_reach_state(iter(2), ctrl(loc_2), =-=[2,3]-=-, 3) represents an abstract state at the control location ctrl(loc 2) and the list of predicate identifiers [2, 3]. The first argument of abst reach state(...), hereiter(2), shows at which iteration t... |

37 | Logic programming and model checking
- Cui, Dong, et al.
- 1998
(Show Context)
Citation Context ...ractical verification [20]. Our work builds upon, and also crucially differs from previous efforts to exploit constraint based programming languages for the implementation of model checkers (see e.g. =-=[1,8,9,10,11,18,19,21]-=-). Those efforts relate the fixpoint definitions of runtime properties of programs with the fixpoint semantics of M. Hanus (Ed.): PADL 2007, LNCS 4354, pp. 245–259, 2007. c○ Springer-Verlag Berlin Hei... |

33 | Combining CSP and B for specification and property verification
- Butler, Leuschel
- 2005
(Show Context)
Citation Context ...ractical verification [20]. Our work builds upon, and also crucially differs from previous efforts to exploit constraint based programming languages for the implementation of model checkers (see e.g. =-=[1,8,9,10,11,18,19,21]-=-). Those efforts relate the fixpoint definitions of runtime properties of programs with the fixpoint semantics of M. Hanus (Ed.): PADL 2007, LNCS 4354, pp. 245–259, 2007. c○ Springer-Verlag Berlin Hei... |

30 | Constraint Logic Programming Applied to Model Checking
- Fribourg
- 2000
(Show Context)
Citation Context ...ractical verification [20]. Our work builds upon, and also crucially differs from previous efforts to exploit constraint based programming languages for the implementation of model checkers (see e.g. =-=[1,8,9,10,11,18,19,21]-=-). Those efforts relate the fixpoint definitions of runtime properties of programs with the fixpoint semantics of M. Hanus (Ed.): PADL 2007, LNCS 4354, pp. 245–259, 2007. c○ Springer-Verlag Berlin Hei... |

30 | Constraint logic programming for local and symbolic model-checking
- Nilsson, Lübcke
(Show Context)
Citation Context |

19 |
M odel Checking
- Delzanno, Podelski
- 1999
(Show Context)
Citation Context |

19 | Automatic software model checking via constraint logic
- Flanagan
- 2004
(Show Context)
Citation Context |

16 | Localization and Register Sharing for Predicate Abstraction
- Jain, Ivančić, et al.
- 2005
(Show Context)
Citation Context |

5 | Reduced Certificates for Abstraction-Carrying Code
- Albert, Arenas, et al.
- 2006
(Show Context)
Citation Context |

5 | Meta-programming in CLP(R
- Heintze, Michaylov, et al.
- 1989
(Show Context)
Citation Context ...tion of WP exploits the particular syntactic form of update expressions, and can be generalized to arbitrary updates by resorting to the projection of the constraint store, e.g. using techniques from =-=[12]-=-. Abstraction refinement procedure abstract check refine. The procedure abstract check refine is defined in Figure 7. It calls the procedures abstract fixpoint, feasible,andrefine as described above. ... |

5 |
OFAI clp(q,r) Manual, Edition 1.3.3. Austrian Research Institute for
- Holzbaur
- 1995
(Show Context)
Citation Context ... programming language may lead to an elegant and concise implementation of a practical tool. In this paper we describe the outcome of our investigation. Using a Prolog system together with extensions =-=[15,17]-=- as the implementation platform of our choice we have built such a tool, called ARMC (for Abstraction Refinement Model Checking). The tool has already been used for practical verification [20]. Our wo... |

5 | A CLP method for compositional and intermittent predicate abstraction
- Jaffar, Santosa, et al.
- 2006
(Show Context)
Citation Context |

1 |
Model checking data-expensive real-time systems
- Meyer, Faber, et al.
- 2006
(Show Context)
Citation Context ...ions [15,17] as the implementation platform of our choice we have built such a tool, called ARMC (for Abstraction Refinement Model Checking). The tool has already been used for practical verification =-=[20]-=-. Our work builds upon, and also crucially differs from previous efforts to exploit constraint based programming languages for the implementation of model checkers (see e.g. [1,8,9,10,11,18,19,21]). T... |

1 | Constraint solving for interpolation. Submitted - Rybalchenko, Sofronie-Stokkermans - 2006 |