Quantifier Elimination via Functional Composition
暂无分享,去创建一个
[1] Thomas Sturm. New domains for applied quantifier elimination (plenary talk) , 2006 .
[2] Robert K. Brayton,et al. Scalable don't-care-based logic optimization and resynthesis , 2009, FPGA '09.
[3] Kenneth L. McMillan,et al. Applying SAT Methods in Unbounded Symbolic Model Checking , 2002, CAV.
[4] Jie-Hong Roland Jiang,et al. Bi-decomposing large Boolean functions via interpolation and satisfiability solving , 2008, 2008 45th ACM/IEEE Design Automation Conference.
[5] Christoph Scholl,et al. Advanced Unbounded CTL Model Checking By Using AIGs, BDD Sweeping, and Quantifier Scheduling , 2006, MBMV.
[6] Robert K. Brayton,et al. DAG-aware AIG rewriting: a fresh look at combinational logic synthesis , 2006, 2006 43rd ACM/IEEE Design Automation Conference.
[7] Herbert B. Enderton,et al. A mathematical introduction to logic , 1972 .
[8] B. F. Caviness,et al. Quantifier Elimination and Cylindrical Algebraic Decomposition , 2004, Texts and Monographs in Symbolic Computation.
[9] Volker Weispfenning,et al. The Complexity of Linear Problems in Fields , 1988, Journal of symbolic computation.
[10] Jie-Hong Roland Jiang,et al. Scalable exploration of functional dependency by interpolation and incremental SAT solving , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.
[11] R. Brayton,et al. FRAIGs: A Unifying Representation for Logic Synthesis and Verification , 2005 .
[12] Olivier Coudert,et al. A unified framework for the formal verification of sequential circuits , 1990, ICCAD 1990.
[13] Jie-Hong R. Jiang,et al. To SAT or not to SAT: Ashenhurst decomposition in a large scale , 2008, ICCAD 2008.
[14] Kenneth L. McMillan,et al. Interpolation and SAT-Based Model Checking , 2003, CAV.
[15] Olivier Coudert,et al. A unified framework for the formal verification of sequential circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[16] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .
[17] Robert K. Brayton,et al. Implicit state enumeration of finite state machines using BDD's , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[18] M. Ganai,et al. Efficient SAT-based unbounded symbolic model checking using circuit cofactoring , 2004, ICCAD 2004.
[19] A Pettorossi. Automata theory and formal languages , 2008 .
[20] William Craig,et al. Linear reasoning. A new form of the Herbrand-Gentzen theorem , 1957, Journal of Symbolic Logic.
[21] Ranjit Jhala,et al. Interpolant-Based Transition Relation Approximation , 2005, CAV.
[22] George E. Collins,et al. Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.
[23] Andreas Seidl,et al. Boolean Quantification in a First-Order Context , 2006 .
[24] G. Sacks. A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .