ARMC

ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement. Software model checking with abstraction refinement is emerging as a practical approach to verify industrial software systems. Its distinguishing characteristics lie in the way it applies logical reasoning to deal with abstraction. It is therefore natural to investigate whether and how the use of a constraint-based 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 Constraint Logic Programming extensions as the implementation platform of our choice we have built such a tool, called ARMC (for Abstraction Refinement Model Checking), which has already been used for practical verification.


References in zbMATH (referenced in 25 articles )

Showing results 1 to 20 of 25.
Sorted by year (citations)

1 2 next

  1. Kafle, Bishoksan; Gallagher, John P.: Horn clause verification with convex polyhedral abstraction and tree automata-based refinement (2017)
  2. Ströder, Thomas; Giesl, Jürgen; Brockschmidt, Marc; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Schneider-Kamp, Peter; Aschermann, Cornelius: Automatically proving termination and memory safety for programs with pointer arithmetic (2017)
  3. Chistikov, Dmitry; Czerwiński, Wojciech; Hofman, Piotr; Pilipczuk, Michał; Wehar, Michael: Shortest paths in one-counter systems (2016)
  4. De Angelis, Emanuele; Fioravanti, Fabio; Pettorossi, Alberto; Proietti, Maurizio: Proving correctness of imperative programs by linearizing constrained Horn clauses (2015)
  5. Cook, Byron; Kroening, Daniel; Rümmer, Philipp; Wintersteiger, Christoph M.: Ranking function synthesis for bit-vector relations (2013)
  6. De Angelis, Emanuele; Fioravanti, Fabio; Pettorossi, Alberto; Proietti, Maurizio: Specialization with constrained generalization for software model checking (2013)
  7. Kroening, Daniel; Sharygina, Natasha; Tonetta, Stefano; Tsitovich, Aliaksei; Wintersteiger, Christoph M.: Loop summarization using state and transition invariants (2013)
  8. Popeea, Corneliu; Rybalchenko, Andrey: Threader: a verifier for multi-threaded programs. (Competition contribution) (2013) ioport
  9. De Angelis, Emanuele: Software model checking by program specialization (2012)
  10. Mandrykin, M. U.; Mutilin, V. S.; Novikov, E. M.; Khoroshilov, A. V.; Shved, P. E.: Using Linux device drivers for static verification tools benchmarking (2012) ioport
  11. Olderog, Ernst-Rüdiger: Automatic verification of real-time systems with rich data: an overview (2012) ioport
  12. Lopes, Nuno P.; Rybalchenko, Andrey: Distributed and predictable software model checking (2011)
  13. Tsitovich, Aliaksei; Sharygina, Natasha; Wintersteiger, Christoph M.; Kroening, Daniel: Loop summarization and termination analysis (2011)
  14. Bozga, Marius; Iosif, Radu; Perarnau, Swann: Quantitative separation logic and programs with lists (2010)
  15. Cook, Byron; Kroening, Daniel; Rümmer, Philipp; Wintersteiger, Christoph M.: Ranking function synthesis for bit-vector relations (2010)
  16. Gulavani, Bhargav S.; Chakraborty, Supratik; Nori, Aditya V.; Rajamani, Sriram K.: Refining abstract interpretations (2010)
  17. Gupta, Ashutosh; Popeea, Corneliu; Rybalchenko, Andrey: Non-monotonic refinement of control abstraction for concurrent programs (2010)
  18. Rybalchenko, Andrey; Sofronie-Stokkermans, Viorica: Constraint solving for interpolation (2010)
  19. Cook, Byron; Podelski, Andreas; Rybalchenko, Andrey: Summarization for termination: No return! (2009)
  20. Seghir, Mohamed Nassim; Podelski, Andreas; Wies, Thomas: Abstraction refinement for quantified array assertions (2009)

1 2 next