Towards Parallel Boolean Functional Synthesis

DOI10.1007/978-3-662-54577-5_19zbMath1452.68112arXiv1703.01440OpenAlexW2597995575MaRDI QIDQ3303903

S. Akshay, Supratik Chakraborty, Ajith K. John, Shetal Shah

Publication date: 5 August 2020

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.01440

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Functional synthesis via input-output separation ⋮ Boolean functional synthesis: from under the hood of solvers ⋮ Projected model counting: beyond independent support ⋮ Boolean functional synthesis: hardness and practical algorithms

Uses Software

• sKizzo

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of Boolean unification
• Unification in Boolean rings and Abelian groups
• Boolean unification - the story so far
• Parametric solutions of Boolean equations
• Counterexample-guided abstraction refinement for symbolic model checking
• Quantifier Elimination via Functional Composition
• Graph-Based Algorithms for Boolean Function Manipulation
• Supervisory Control of a Class of Discrete Event Processes
• Binary Decision Diagrams
• BDD-Based Boolean Functional Synthesis
• A Recursive Paradigm to Solve Boolean Relations
• Automated Deduction – CADE-20
• Computer Aided Verification

This page was built for publication: Towards Parallel Boolean Functional Synthesis