中国科学院机构知识库网格系统: 检索

浏览/检索结果: 共4条，第1-4条

帮助

条数/页：排序方式：
	Pearl: A Multi-Derivation Approach to Efficient CFL-Reachability Solving 期刊论文 OAI收割 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2024, 卷号: 50, 期号: 9, 页码: 2379-2397 作者: Shi, Chenghang; Li, Haofeng; Sui, Yulei; Lu, Jie; Li, Lian \| 收藏 \| 浏览/下载：3/0 \| 提交时间：2024/12/06 Production Standards Termination of employment Redundancy Optimization Heuristic algorithms Symbols Program analysis CFL-reachability constraint solving transitive relations
	On ranking functions for single-path linear-constraint loops 期刊论文 OAI收割 INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2019, 页码: 12 作者: Li, Yi; Wu, Wenyuan; Feng, Yong \| 收藏 \| 浏览/下载：33/0 \| 提交时间：2020/08/24 Software reliability Program termination Linear ranking functions Farkas' lemma
	Witness to non-termination of linear programs 期刊论文 OAI收割 THEORETICAL COMPUTER SCIENCE, 2017, 卷号: 681, 页码: 75-100 作者: Li, Yi \| 收藏 \| 浏览/下载：36/0 \| 提交时间：2018/03/05 Linear loops Program termination Semi-algebraic sets Witness to non-termination
	Symbolic termination analysis of solvable loops 期刊论文 OAI收割 JOURNAL OF SYMBOLIC COMPUTATION, 2013, 卷号: 50, 页码: 28-49 Xu, Ming; Li, Zhi-Bin \| 收藏 \| 浏览/下载：31/0 \| 提交时间：2014/12/16 Program verification Termination analysis Polynomial loops Symbolic computation Quantifier elimination Real root bounds