Boolean functional synthesis: hardness and practical algorithms

Given a relational specification between Boolean inputs and outputs, Boolean functional synthesis seeks to synthesize each output as a function of the inputs such that the specification is met. Despite significant algorithmic advances in Boolean functional synthesis over the past few years, there ar...

Full description

Saved in:

Bibliographic Details
Published in:	Formal methods in system design Vol. 57; no. 1; pp. 53 - 86
Main Authors:	Akshay, S., Chakraborty, Supratik, Goel, Shubham, Kulal, Sumith, Shah, Shetal
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2021 Springer Nature B.V
Subjects:	Algorithms Benchmarks Boolean Boolean algebra CAE) and Design Circuits and Systems Complexity theory Computer-Aided Engineering (CAD Electrical Engineering Engineering Functionals Hardness Software Engineering/Programming and Operating Systems Specifications Surface hardness Synthesis Skolem functions Boolean functional synthesis Expansion-based algorithms
ISSN:	0925-9856, 1572-8102
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!