Reachability Modulo Theory Library

10 pages•Published: August 19, 2013

Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise and Natasha Sharygina

Abstract

Reachability analysis of infinite-state systems plays a central role in many verification tasks. In the last decade, SMT-Solvers have been exploited within many verification tools to discharge proof obligations arising from reachability analysis. Despite this, as of today there is no standard language to deal with transition systems specified in the SMT-LIB format. This paper is a first proposal for a new SMT-based verification language that is suitable for defining transition systems and safety properties.

Keyphrases: model checking, reachability modulo theories, smt lib

In: Pascal Fontaine and Amit Goel (editors). SMT 2012. 10th International Workshop on Satisfiability Modulo Theories, vol 20, pages 67-76.

Links:	https://easychair.org/publications/paper/p1M1
	https://doi.org/10.29007/f3rp

BibTeX entry

@inproceedings{SMT2012:Reachability_Modulo_Theory_Library,
  author    = {Francesco Alberti and Roberto Bruttomesso and Silvio Ghilardi and Silvio Ranise and Natasha Sharygina},
  title     = {Reachability Modulo Theory Library},
  booktitle = {SMT 2012. 10th International Workshop on Satisfiability Modulo Theories},
  editor    = {Pascal Fontaine and Amit Goel},
  series    = {EPiC Series in Computing},
  volume    = {20},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/p1M1},
  doi       = {10.29007/f3rp},
  pages     = {67-76},
  year      = {2013}}

Download PDF Open PDF in browser