Abstract
We present a method for the automatic compositional verification of certain classes of concurrent programs. Our approach is based on the casting of the model checking problem into a theory of transition systems within CVC4, a DPLL(T) based SMT solver. Our transition system theory then cooperates with other theories supported by the solver (e.g., arithmetic, arrays), which can help accelerate the verification process. More specifically, our theory solver looks for known patterns within the input programs and uses them to generate lemmas in the languages of other theories. When applicable, these lemmas can often steer the search away from safe parts of the search space, reducing the number of states to be explored and expediting the model checking procedure. We demonstrate the potential of our technique on a number of broad classes of programs.
Original language | English |
---|---|
Title of host publication | Proceedings of the 15th Conference on Formal Methods in Computer-Aided Design, FMCAD 2015 |
Editors | Roope Kaivola, Thomas Wahl |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 81-88 |
Number of pages | 8 |
ISBN (Electronic) | 9780983567851 |
DOIs | |
State | Published - 11 Aug 2016 |
Externally published | Yes |
Event | 15th Conference on Formal Methods in Computer-Aided Design, FMCAD 2015 - Austin, United States Duration: 27 Sep 2015 → 30 Sep 2015 |
Publication series
Name | Proceedings of the 15th Conference on Formal Methods in Computer-Aided Design, FMCAD 2015 |
---|
Conference
Conference | 15th Conference on Formal Methods in Computer-Aided Design, FMCAD 2015 |
---|---|
Country/Territory | United States |
City | Austin |
Period | 27/09/15 → 30/09/15 |
Bibliographical note
Publisher Copyright:© 2015 FMCAD Inc.