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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Formal methods in system design Ročník 57; číslo 1; s. 53 - 86
Hlavní autoři:	Akshay, S., Chakraborty, Supratik, Goel, Shubham, Kulal, Sumith, Shah, Shetal
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.07.2021 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!