Polsat: A Portfolio LTL Satisfiability Solver
Logic in Computer Science
2013-11-08 v1
Abstract
In this paper we present a portfolio LTL-satisfiability solver, called Polsat. To achieve fast satisfiability checking for LTL formulas, the tool integrates four representative LTL solvers: pltl, TRP++, NuSMV, and Aalta. The idea of Polsat is to run the component solvers in parallel to get best overall performance; once one of the solvers terminates, it stops all other solvers. Remarkably, the Polsat solver utilizes the power of modern multi-core compute clusters. The empirical experiments show that Polsat takes advantages of it. Further, Polsat is also a testing plat- form for all LTL solvers.
Keywords
Cite
@article{arxiv.1311.1602,
title = {Polsat: A Portfolio LTL Satisfiability Solver},
author = {Jianwen Li and Geguang Pu and Lijun Zhang and Yinbo Yao and Moshe Y. Vardi and Jifeng he},
journal= {arXiv preprint arXiv:1311.1602},
year = {2013}
}
Comments
11 pages, 1 table, 2 figures