SAT-based methods for circuit synthesis
暂无分享,去创建一个
Florian Lonsing | Roderick Bloem | Uwe Egly | Patrick Klampfl | Robert Könighofer | R. Bloem | U. Egly | Patrick Klampfl | Robert Könighofer | Florian Lonsing
[1] Amir Pnueli,et al. Specify, Compile, Run: Hardware from PSL , 2007, COCV@ETAPS.
[2] Jie-Hong Roland Jiang,et al. Interpolating functions from large Boolean relations , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.
[3] Armando Solar-Lezama,et al. The Sketching Approach to Program Synthesis , 2009, APLAS.
[4] Cesare Tinelli,et al. Handbook of Satisfiability , 2021, Handbook of Satisfiability.
[5] Robert K. Brayton,et al. ABC: An Academic Industrial-Strength Verification Tool , 2010, CAV.
[6] Armin Biere,et al. DepQBF: A Dependency-Aware QBF Solver , 2010, J. Satisf. Boolean Model. Comput..
[7] Daniel Kroening,et al. Interpolant Strength , 2010, VMCAI.
[8] Rüdiger Ehlers,et al. Symbolically synthesizing small circuits , 2012, 2012 Formal Methods in Computer-Aided Design (FMCAD).
[9] Armin Biere,et al. Resolution-Based Certificate Extraction for QBF - (Tool Presentation) , 2012, SAT.
[10] Roderick Bloem,et al. Finding and fixing faults , 2005, J. Comput. Syst. Sci..
[11] Klaus Schneider,et al. Solving Games Using Incremental Induction , 2013, IFM.
[12] Florian Lonsing,et al. Incremental QBF Solving , 2014, CP.
[13] Martina Seidl,et al. SAT-Based Synthesis Methods for Safety Specs , 2014, VMCAI.