A portable trace for the Pascal heap

Debugging aids for high-level languages supporting structured data types should provide diagnostic information in a form terminologically as close as possible to that of the original source code. In addition, it is desirable that such software be portable. The package HEAPTRACE satisfies both the above criteria. It is a precompiler for Pascal programs which enables the user to trace the heap, selectively dumping dynamically-created records in a high-level format. It is portable as it is written entirely in Pascal; furthermore, since it is implemented as additions and modifications to a well-known compiler, its principles may easily be built into any Pascal compiler or diagnostics system. However, there is a small price to pay for achieving portability in that three possibly desirable features cannot be satisfactorily implemented in a machine-independent manner.     

An interactive method for extracting grammar from programs

The grammar of the language in which some given code is written is essential for developing automated tools for maintenance, reengineering, and program analysis. Frequently grammar is available for a language but not for its variants that are implemented by various vendors and in which the given code may be written. In this work we address the problem of obtaining the grammar from source code, which can then be used for generating tools for the programs. We propose an incremental method for obtaining grammar for a particular language variant, from a set of programs written in the language variant and an approximate grammar (presumably of the standard language) with some user interaction. We also present the design of a tool for implementing this approach and our experience in working with grammars of C, C++ and COBOL. Copyright © 2004 John Wiley & Sons, Ltd.     

针对复杂用户评论的代码质量属性判断

随着开发者社区和代码托管平台成为程序员获取代码的主要途径,针对代码的用户评论数量急剧增加.用户在使用代码后给出的评论中包含多种静态和动态的代码质量属性信息,但是由于用户评论多为复杂句,使得评论中包含的代码质量属性难以判断.针对复杂用户评论的代码质量属性判断将有助于分析用户评论中的代码质量信息,有助于开发者在了解用户的代...     

Methods for interfacing analysis software to optimization software

Three methods are presented for interfacing analysis software to optimization software to create design software. These methods are referred to as the “conventional interface”, the “pro-gramming-free interface”, and the “generalized interface”. The latter two methods introduce new ideas which are attractive from the user's standpoint. The programming-free interface simplifies the interface process by eliminating the necessity for tlie user to modify the analysis source code. The generalized interface allows one to create a general-purpose design package from a general-purpose analysis package. Support for the methods has been implemented in a software package named OPTDES.BYU. Use of the methods with this package is illustrated with a simple example.     

Unifying program slicing and concept assignment for higher-level executable source code extraction

Program slicing and concept assignment have both been proposed as source code extraction techniques. Unfortunately, each has a weakness that prevents wider application. For slicing, the extraction criterion is expressed at a very low level; constructing a slicing criterion requires detailed code knowledge which is often unavailable. The concept assignment extraction criterion is expressed at the domain level. However, unlike a slice, the extracted code is not executable as a separate subprogram in its own right. This paper introduces a unification of slicing and concept assignment which exploits their combined advantages, while overcoming these two individual weaknesses. Our ‘concept slices’ are executable programs extracted using high-level criteria. The paper introduces four techniques that combine slicing and concept assignment and algorithms for each. These algorithms were implemented in two separate tools used to illustrate the application of the concept slicing algorithms in two very different case studies. The first is a commercially-written COBOL module from a large financial organization, the second is an open source utility program written in C. Copyright © 2005 John Wiley & Sons, Ltd.     

基于版本控制的中文文档到源代码的自动跟踪方法

软件文档和源代码之间的可追踪性研究广泛使用了信息检索（IR）技术,但由于中文文档和源代码用不同的语言书写,使用传统IR技术进行自动跟踪时会导致精度不高。针对上述问题,提出一种基于版本控制的中文文档到源代码的自动跟踪方法。首先,结合文本到源代码的启发式规则,采用IR方法计算出文本和源代码之间的相似度得分;然后,使用软件开发和维护过程中提交到版本控制软件的更新信息来修正该分数;最后,根据设定的阈值确定中文文档与源代码之间的跟踪关系。实验结果表明,改进方法的精确度和召回率相比传统IR方法均有一定的提高,并且该方法能提取出传统IR方法中遗漏的跟踪关系。     

A theory of command language dialogue for a knowledge‐based human‐computer interaction

The flexibility and usability of graphic‐based HCIs can be increased by adding a natural language interface with command menus. Among the several other advantages, such embellishment offers the user an opportunity for direct expression of his or her behaviors, goals, intentions, and objectives along the continuum of the task knowledge. The existing graphic‐based HCIs that operate on active symbologies and icons assume the user's mental models to correlate with perceptual and cognitive levels of the task understanding. This obviously increases mental loads and the frustration of the human adapting to the system. In reality, the system should be designed to adapt to the user's behavior and skill level. In order to improve the current design of graphic‐based HCIs, we have formulated theories of command production language that will enhance the user's ability to interact with the system. The methods developed combine the theory of expert database with formal grammar to develop command‐production rules using a natural language dictionary prototype. We show that the commands are linear, regular, and symmetric, although conforming to the formal rules of grammar.     

基于移动端协助的硬口令认证密钥交换协议

针对现有口令认证密钥交换协议易受各种网络攻击,影响用户私密信息安全的问题,提出一种基于移动端协助的硬口令认证密钥交换协议,在移动端的辅助下,允许用户使用单一口令建立与服务器之间的安全会话。协议中,用户无须记忆任何复杂的私钥信息,即使移动设备丢失、被盗或遭受恶意软件侵袭,也不会损害用户信息。安全性和性能分析表明,协议明显降低了服务器的计算消耗,大大提高了用户私密信息的安全性,可以抵御字典攻击、中间人攻击等的影响,减轻用户记忆负担,缓解存储压力,易于部署。     

An empirical study of the textual similarity between source code and source code summaries

Source code documentation often contains summaries of source code written by authors. Recently, automatic source code summarization tools have emerged that generate summaries without requiring author intervention. These summaries are designed for readers to be able to understand the high-level concepts of the source code. Unfortunately, there is no agreed upon understanding of what makes up a “good summary.” This paper presents an empirical study examining summaries of source code written by authors, readers, and automatic source code summarization tools. This empirical study examines the textual similarity between source code and summaries of source code using Short Text Semantic Similarity metrics. We found that readers use source code in their summaries more than authors do. Additionally, this study finds that accuracy of a human written summary can be estimated by the textual similarity of that summary to the source code.     

基于MySQL的可定制强制访问控制的研究与实现

结合MySQL数据库系统,通过在其源代码中增加安全策略函数、修改原有数据字典、扩展SQL 语句以及建立安全策略统一管理平台的方法,实现了可定制强制访问控制机制.所实现的安全数据库原型系统使数据库安全管理员可以根据应用领域不同的安全需求灵活定义标签结构和访问规则,为增强安全数据库产品可用性、灵活性提供了一种新思路.     

Toward a Privacy Agent for Information Retrieval

In this paper, we tackle the private information retrieval (PIR) problem associated with the use of Internet search engines. We address the desire for a user to retrieve information from the Web without the search provider learning about it. Traditional PIR protocols present two main shortcomings for their application: (i) They assume cooperation by the database, which is not affordable for a real‐world search engine like Google and (ii) their computational complexity is linear in the size of the database, which is unfeasible in the case of the Web. More recent approaches relax PIR conditions to overcome these limitations and present some level of privacy. Mostly, they aim to distort server logs regardless of the loss of information that is involved. Server logs are used by search engines for profiling and, thereby, provide personalized results. This becomes a user's need given the growth of the Web and can also be used for targeted advertising. This study focuses on a noncooperative agent for private search that considers profiling as valuable data used for both sides of the search process. It is based on the assumption that the user's identity is formed by the union of various areas of interests or facets. Managing the HTTP connections properly, submitted queries are mapped to different server logs according to these facets. The rationale is that these logs cannot be used for tracing the user while they are still helpful for profiling. We present a personalized query classification approach based on the user's browsing history and to provide empirical results; we developed an attacking algorithm against the agent that shows that the disclosure risk is reduced.     

SAH guided spatial split partitioning for fast BVH construction

We present a new SAH guided approach to subdividing triangles as the scene is coarsely partitioned into smaller sets of spatially coherent triangles. Our triangle split approach is integrated into the partitioning stage of a fast BVH construction algorithm, but may as well be used as a stand alone pre‐split pass. Our algorithm significantly reduces the number of split triangles compared to previous methods, while at the same time improving ray tracing performance compared to competing fast BVH construction techniques. We compare performance on Intel's Embree ray tracer and show that BVH construction with our splitting algorithm is always faster than Embree's pre‐split construction algorithm. We also show that our algorithm builds significantly improved quality trees that deliver higher ray tracing performance. Our algorithm is implemented into Embree's open source ray tracing framework, and the source code will be released late 2015.     

Syntax driven COBOL compilers—an assessment

Most syntax analysis phases of COBOL compilers are written as sequences of procedural code instructions each of which validates a particular part of the syntax of a COBOL program. This paper examines the structure of a syntax driven COBOL compiler and a practical implementation is described. The problems encountered with this type of compiler construction are explained, and its advantages are examined. Finally, some other potential applications of syntax driven technology are suggested.     

基于SNMP的MIB库转化成C文件的实现

网络管理日益重要,SNMP以其简单、灵活的特点而得到广泛应用。MIB库是网络管理中的资源以及属性的集合,是网管的核心,要访问MIB库,必须将其转换成C语言。MIB库转换成C文件,先要按照一定的语法格式编写MIB文件,将新编写的MIB文件放入MIB库中,然后根据是转换简单变量还是表变量使用NET-SNMP源码包自带的模板转换。经实验证明,这种方法能够简单快速地将MIB文件转换成C文件,并且转换后的C文件代码格式统一,经过少量的修改,就可以重新编译到SNMP源码包中使用。     

适用于分布式静态检测的Java代码依赖性分析技术

为满足Java静态分布式检测系统对Java程序源代码解耦分包的需求,解决代码检测单节点单进程运行耗时过长问题,实现分布式检测系统单任务多节点并行运行的目的,本文提出了Java源代码文件间依赖性分析方法.该方法以生成源代码文件抽象语法树的方式抽取文件文本信息,遍历分析抽象语法树,获取文件与其他源代码文件类依赖关系,再通过定位类所在的文件方式得到文件与文件之间依赖关系.同时,以无入边顶点的带环有向图表示文件间依赖关系图,本文提出的方法基于该图进行了文件间解耦的分析.最后,通过对示例程序逐步剖析的实验以及对数个开源工具源代码解耦拆分的实验,验证了本文提出的文件间依赖性分析方法的可行性.     

层次聚类结合空间金字塔的图像分类

在图像分类中,视觉词典的质量直接影响着图像分类的结果,随着用户的要求提高,K-means聚类算法所构建的视觉词典已无法满足用户对图像分类的需求,为了得到高效的视觉词汇码本,针对构建视觉词典的算法进行研究,通过K-means算法和层次聚类算法的结合来达到这一目的。混合聚类算法采用K-means算法对数据样本进行初步聚类,得到一个粗略的划分;引入信息熵的属性加权,利用信息熵度量某个属性的关键性,信息熵越大的属性对聚类结果的影响越小,计算加权后的类间欧式距离,将距离相近的两个类进行合并;在空间金字塔模型框架中,将改进的混合聚类方法应用到视觉词典的构建中。实验结果表明,结合信息熵的层次聚类算法能有效提高空间金字塔模型的分类准确率。     

Assessing the impact of revisions to standards: the COBOL example

The advantages to be gained from the enhancement of standards for programming languages must be weighed against the costs of the associated conversion of existing code. Such an evaluation should address all of the potential costs and benefits; in particular, it must take into account the current operational environment, as well as the technical issues. A candidate set of criteria to guide this process is presented and discussed. COBOL is a good example of how language standards evolve. There is a review of the findings of a recent Federal study on the impact of currently proposed changes to the COBOL standard. This review made use of interviews with Federal users and also an extensive analysis of currently operational COBOL source code within the Federal government. The study demonstrates that the evaluation of revisions to standards can be done, in part, on a quantitative basis.     

企业级海量代码的检索与管理技术

在大型IT企业中,尤其像Google或者百度,代码搜索已是软件开发过程中不可或缺且频繁的活动,其通过借鉴或复用已有代码,加速开发过程的速度.多年以来,已有大量的研究人员关注代码搜索,且设计出很多优秀的工具.但是已有的研究和工具主要是在小规模或者编程语言单一的代码数据集上,没有从企业实际搜索需求出发,且对用户的查询输入也有所限制,尚缺少一套针对企业级海量代码的检索与管理技术方案.提出了一套企业级海量数据代码搜索引擎的方案和系统实现,面向开发过程中用户最直接的需求,通过离线分析与在线分析,完成对海量代码库的索引构建与检索.其中,离线分析负责代码相关数据的获取与分析、构建索引集群.在线过程负责变换用户的query、对搜索的结果进行高级排序、生成摘要.本系统部署在百度代码库上,为数十TB级的Git代码库构建了索引,平均一次检索时间在1s之内.在百度推出应用以来,访问量逐步增加,现每周平均用户有数千人,每周查询平均有数万次,广受百度工程师好评.