首页 | 本学科首页 官方微博 | 高级检索

 按 中文标题 英文标题 中文关键词 英文关键词 中文摘要 英文摘要 作者中文名 作者英文名 单位中文名 单位英文名 基金中文名 基金英文名 杂志中文名 杂志英文名 栏目英文名 栏目英文名 DOI 责任编辑 分类号 杂志ISSN号 检索 检索词:

 收费全文 15篇 完全免费 7篇
 自动化技术 22篇
 2017年 1篇 2016年 1篇 2015年 1篇 2014年 2篇 2013年 4篇 2011年 3篇 2010年 2篇 2009年 3篇 2008年 4篇 2006年 1篇

1.
“编译原理”课程的教学内容选择的探讨   总被引：2，自引：1，他引：1

2.

3.

4.

5.

6.

7.
Analysis and verification of pointer programs are still difficult problems so far. This paper uses a shape graph logic and a shape system to solve these problems in two stages. First, shape graphs at every program point are constructed using an analysis tool. Then, they are used to support the verification of other properties （e.g., orderedness）. Our prototype supports automatic verification of programs manipulating complex data structures such as splay trees, treaps, AVL trees and AA trees, etc. The proposed shape graph logic, as an extension to Hoare logic, uses shape graphs directly as assertions. It can be used in the analysis and verification of programs manipulating mutable data structures. The benefit using shape graphs as assertions is that it is convenient for acquiring the relations between pointers in the verification stage. The proposed shape system requires programmers to provide lightweight shape declarations in recursive structure type declarations. It can help rule out programs that construct shapes deviating from what programmers expect （reflected in shape declarations） in the analysis stage. As a benefit, programmers need not provide specifications （e.g., pre-/post-conditions, loop invariants） about pointers. Moreover, we present a method doing verification in the second stage using traditional Hoare logic rules directly by eliminating aliasing with the aid of shape graphs. Thus, verification conditions could be discharged by general theorem provers.  相似文献
8.
Pipeline parallelism is a popular parallel programming pattern for emerging applications. However, program-ming pipelines directly on conventional multithreaded shared memory is di?cult and error-prone...  相似文献
9.

10.