中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR

Search Results

Help

Item hits: (Results 1-10 of 23)

Items/Page:    Sort:
QBF encoding of temporal properties and QBF-based verification [会议论文]
7th International Joint Conference on Automated Reasoning, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 19, 2014 - July 22, 2014
Zhang, Wenhui (1)

 
proving liveness property under fairness requirements [会议论文]
19th Asia-Pacific Software Engineering Conference, APSEC 2012, Hong Kong, China, December 4, 2012 - December 7, 2012
Long Teng; Zhang Wenhui

 
proving liveness property under strengthened compassion requirements [会议论文]
9th Annual Conference on Theory and Applications of Models of Computation, TAMC 2012, Beijing, China, May 16, 2012 - May 21, 2012
Long Teng; Zhang Wenhui

 
solving difficult sat problems by using obdds and greedy clique decomposition [会议论文]
6th International Frontiers of Algorithmics Workshop, FAW 2012 and 8th International Conference on Algorithmic Aspects of Information and Management, AAIM 2012, Beijing, China, May 14, 2012 - May 16, 2012
Xu Yanyan; Chen Wei; Su Kaile; Zhang Wenhui

 
greedy clique decomposition for symbolic satisfiability solving [期刊论文]
International Journal of Advancements in Computing Technology, 2012-01-01, 卷号: 4, 期号: 10, 页码: 174-184
Xu Yanyan; Chen Wei; Su Kaile; Zhang Wenhui

 
formula-oriented compositional minimization in model checking [会议论文]
2010 19th IEEE Asian Test Symposium, ATS 2010, Shanghai, China, 40878
Chen Bowen; Shen Haihua; Zhang Wenhui
  |  
 
auxiliary constructs for proving liveness in compassion discrete systems [会议论文]
8th International Symposium on Automated Technology for Verification and Analysis, ATVA 2010, Singapore, Singapore, September
Long Teng; Zhang Wenhui
  |  
 
bounded model checking of actl formulae [会议论文]
3rd International Symposium on Theoretical Aspects of Software Engineering, Tianjin, PEOPLES R CHINA, JUL 29-31,
Chen Wei; Zhang Wenhui

 
bounded semantics of ctl and sat-based verification [学位论文]
, 2009-01-01
Zhang Wenhui

 
a direct construction of polynomial-size obdd proof of pigeon hole problem [期刊论文]
INFORMATION PROCESSING LETTERS, 2009-01-01, 卷号: 109, 期号: 10, 页码: 472-477
Chen Wei; Zhang Wenhui

 

1 2 3 next

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace