Towards Parallel Boolean Functional Synthesis
Logic in Computer Science
2017-03-07 v1
Abstract
Given a relational specification R(X, Y), where X and Y are sequences of input and output variables, we wish to synthesize each output as a function of the inputs such that the specification holds. This is called the Boolean functional synthesis problem and has applications in several areas. In this paper, we present the first parallel approach for solving this problem, using compositional and CEGAR-style reasoning as key building blocks. We show by means of extensive experiments that our approach outperforms existing tools on a large class of benchmarks.
Keywords
Cite
@article{arxiv.1703.01440,
title = {Towards Parallel Boolean Functional Synthesis},
author = {S. Akshay and Supratik Chakraborty and Ajith K. John and Shetal Shah},
journal= {arXiv preprint arXiv:1703.01440},
year = {2017}
}
Comments
Long version of conference paper in TACAS 2017