ShengYu Shen

According to our database1, ShengYu Shen authored at least 20 papers between 2004 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Complementary Synthesis for Encoder with Flow Control Mechanism.
ACM Trans. Design Autom. Electr. Syst., 2015

2014
Structure-aware CNF obfuscation for privacy-preserving SAT solving.
Proceedings of the Twelfth ACM/IEEE International Conference on Formal Methods and Models for Codesign, 2014

Cloud-Oriented SAT Solver Based on Obfuscating CNF Formula.
Proceedings of the Web Technologies and Applications, 2014

2012
Inferring Assertion for Complementary Synthesis.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2012

2011
A Halting Algorithm to Determine the Existence of the Decoder.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2011

Extracting minimal unsatisfiable subformulas in satisfiability modulo theories.
Comput. Sci. Inf. Syst., 2011

Finding First-Order Minimal Unsatisfiable Cores with a Heuristic Depth-First-Search Algorithm.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2011, 2011

Inferring assertion for complementary synthesis.
Proceedings of the 2011 IEEE/ACM International Conference on Computer-Aided Design, 2011

2010
Synthesizing Complementary Circuits Automatically.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2010

A halting algorithm to determine the existence of decoder.
Proceedings of 10th International Conference on Formal Methods in Computer-Aided Design, 2010

2009
Tracking Unsatisfiable Subformulas from Reduced Refutation Proof.
J. Softw., 2009

Synthesizing complementary circuits automatically.
Proceedings of the 2009 International Conference on Computer-Aided Design, 2009

2007
Finding Unsatisfiable Subformulas with Stochastic Method.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2007

A Heuristic Local Search Algorithm for Unsatisfiable Cores Extraction.
Proceedings of the Computational Science and Its Applications, 2007

2006
Extracting Minimum Unsatisfiable Cores with a Greedy Genetic Algorithm.
Proceedings of the AI 2006: Advances in Artificial Intelligence, 2006

2005
Minimizing Counterexample with Unit Core Extraction and Incremental SAT.
Proceedings of the Verification, 2005

A Faster Counterexample Minimization Algorithm Based on Refutation Analysis.
Proceedings of the 2005 Design, 2005

Minimizing Counterexample of ACTL Property.
Proceedings of the Correct Hardware Design and Verification Methods, 2005

A fast counterexample minimization approach with refutation analysis and incremental SAT.
Proceedings of the 2005 Conference on Asia South Pacific Design Automation, 2005

2004
Localizing Errors in Counterexample with Iteratively Witness Searching.
Proceedings of the Automated Technology for Verification and Analysis: Second International Conference, 2004


  Loading...