A New Translation from ECTL* to SAT

Issue title: Concurrency Specification and Programming (CS&P)

Article type: Research Article

Authors: Zbrzezny, Andrzej

Affiliations: Institute of Mathematics and Computer Science, Jan Długosz University in Częstochowa, Armii Krajowej 13/15, 42-200 Częstochowa, Poland, a.zbrzezny@ajd.czest.pl

Note: [] Adress for correspondence: Institute of Mathematics and Computer Science, Jan Długosz University in Częstochowa, Armii Krajowej 13/15, 42-200 Częstochowa, Poland

Abstract: In this paper we present a new translation from ECTL* to SAT and show that the proposed translation substantially increases the efficiency of verifying temporal properties using the Bounded Model Checking method. We have implemented our new translation and made experimental results, which demonstrate the efficiency of the method.

Keywords: ECTL*, translation to SAT, Bounded Model Checking

DOI: 10.3233/FI-2012-768

Journal: Fundamenta Informaticae, vol. 120, no. 3-4, pp. 375-395, 2012