Java代码信息查询语言

程序理解在软件维护和软件复用中扮演着重要的角色,基于编译技术的程序信息抽取与分析是程序理解辅助工具的主要技术手段.为了降低信息抽取和信息分析的代价,提高程序理解工具的质量和构建效率,本文使用Java文档对象模型作为程序代码结构模型,提出并实现了针对Java代码的信息查询语言JPATH.通过构造JPATH查询表达式,信息抽取与分析程序能够定位感兴趣的元素在代码结构模型中的位置.同时,本文对JPATH做了进一步的扩展,提供了一种对象一关系的查询机制,便于编程人员提取具有特定语义关系的语法对象组合.     

基于Android平台的城市公交查询系统的设计与实现

为了提高城市公交信息化水平,方便智能手机用户查询城市公交信息,在深入进行需求分析的基础上,基于Android开发平台,给出了以南通城市为例的城市公交查询系统的设计与实现过程,实现了公交线路查询、公交站点查询和公交换乘查询等功能。该系统使用Android软件开发工具包和SQLite数据库进行开发,应用程序代码实现基于Java语言。该系统已经在Android智能手机上测试通过。     

多媒体对象查询语言及其查询处理

文章研究了多媒体数据库的查询需求,提出结构化的多媒体对象查询语言MOQL(multi-media object query language).它能够支持基于类型、结构特征、同步关系、时态关系和内容信息的多媒体查询.以DB2数据库为存储机制,定义了一组代数算子和变换规则,利用它们可以将用户定义的MOQL查询变换为代数表达式,进行代数优化,并将代数查询表达式转换为能够在DB2数据库上运行的DB2SQL和C++查询过程.     

XML查询语言

本文综述XML查询语言的研究现状，重点分析W3C的XML查询语言XQuery1.0，同时也介绍了XQuery需要增加的更新功能．本文还介绍了XML查询处理的两种不同思路：基于关系数据库的XML查询处理和基于内存的XML文档的查询处理．     

基于Dreamweaver Mx的成绩查询系统

它是基于ACCESS为后台数据库支持，ASP为主要代码完成，DREAMWEAVEP．MX为主要前台界面设计，此查询系统做成网络版，学生可以在有网络的情况下进行查分，教师就可以不用很大的工作量即可完成工作。实现了成绩查询的全部过程，现将制作过程及重点部分代码列出，抛砖引玉，互相学习。     

LINQ数据库访问技术研究

LINQ是微软公司提供的一项新技术,LINQ查询操作可以通过编程语言自身传达,而不是以字符串方式嵌入到应用程序代码中.通过使用编程语言编写查询具有简化查询,不必使用单独的查询语言等优势.LINQ允许编写C#或者Visual Basic代码以查询数据库相同的方式操作内存数据,它改变了程序和数据之间的关系.因此借助于LIN...     

基于VSS代码数据解析的实现

为了方便代码检查分析、数据统计,为开发管理提供数据依据。本文基于Visual SourceSafe提供的API,采用JAVA语言、SQL等相关技术,建立一个针对开发人员代码修改、查询的数据解析实现。实际测试表明,应用此解析产生的数据可以为开发人员、管理人员提供相关查询数据作依据。目前,本系统已经为开发团队代码统计、查询等提供直接数据参考。     

PAR平台数据库查询优化方案

数据库系统的查询优化技术是提高数据库系统效率的重要技术。当今Java和C＋＋等主流程序设计语言依靠SQL语句,造成数据库系统中查询复杂、繁琐、效率低下、可靠性得不到保证等。针对上述问题,在PAR（Partition And Recur）平台数据库关系代数实现机制基础上,提出和实现基于关系代数的查询优化规则设计方法。这种设计不仅提高了数据库查询效率,也为高可靠数据库的形式化开发提供了依据。     

AADL模型的代码自动生成及集成技术

体系结构分析设计语言（AADL）是一种基于模型驱动体系结构的建模语言,针对如何将AADL模型自动生成框架代码的问题,提出AADL模型元素同C语言元素间的转换规则,设计AADL模型转换为C语言框架代码的自动代码生成器Generator。实例证明了AADL模型自动转换为可执行C代码的有效性。     

XRQL--基于XML的新型RDF查询语言

W3C组织以RDF等标准为基础致力于推广语义WEB的应用,期望能以更为结构化的方式组织和处理WEB数据.文中提出一个基于XML的新型RDF查询语言--XRQL,并构建了一个以XRQL为查询语言的RDF引擎(NSRE)的体系结构,最后简要探讨了相关实现技术.     

A query algebra for program databases

Querying source code is an essential aspect of a variety of software engineering tasks such as program understanding, reverse engineering, program structure analysis and program flow analysis. In this paper, we present and demonstrate the use of an algebraic source code query technique that blends expressive power with query compactness. The query framework of Source Code Algebra (SCA) permits users to express complex source code queries and views as algebraic expressions. Queries are expressed on an extensible, object-oriented database that stores program source code. The SCA algebraic approach offers multiple benefits such as an applicative query language, high expressive power, seamless handling of structural and flow information, clean formalism and potential for query optimization. We present a case study where SCA expressions are used to query a program in terms of program organization, resource flow, control flow, metrics and syntactic structure. Our experience with an SCA-based prototype query processor indicates that an algebraic approach to source code queries combines the benefits of expressive power and compact query formulation     

Approximate verification in an open source world

This article details advances in a lightweight technology we have evolved to handle post hoc verification in the very large, uncontrolled and rapidly evolving code-bases exemplified by C language open source projects such as the Linux kernel. Successful operation in this context means timeliness, and we are currently treating millions of lines of unrestricted mixed C and assembler source code in a few hours on very modest platforms. The technology is soundly based, in that it delivers false alarms (in a ratio of about 8 to 1 in practice), rather than misses true alarms. Speed of operation is traded off against accuracy via configuration of a program logic tailored to each analysis. The program logic specification language and the theory behind it will be described here.     

基于序列到序列模型的代码片段推荐

在软件开发过程中,开发者经常会以复用代码的方式,提高软件开发效率。已有的研究通常采用传统的信息检索技术来实现代码推荐。这些方法存在自然语言查询的高层级的意图与代码的低层级的实现细节不匹配的问题。提出了一种基于序列到序列模型的代码片段推荐方法DeepCR。该方法结合程序静态分析技术与序列到序列模型,训练自然语言查询生成模型,为代码片段生成查询,通过计算生成的查询和开发者输入的自然语言查询的相似度得分来实现代码片段推荐。所构建的代码库的数据来源于Stack Overflow问答网站,确保了数据的真实性。通过计算代码片段推荐结果的平均倒数排名(MRR)和Hit@K来验证方法的有效性。实验结果表明,DeepCR优于现有研究工作,能够有效提高代码片段推荐效果。     

Design of flexible static program analyzers with PQL

Static program analyzers (SPA) are interactive tools that enhance program understanding during maintenance by answering queries about programs. Depending on the maintenance task in hand, SPAs must process different source programs and answer different types of program queries. Flexibility is, therefore, a desirable property of SPAs. The author describes a program query language, called PQL, that facilitates the design of flexible SPAs. PQL is a conceptual level, source language-independent notation to specify program queries and program views. In PQL, one can query global program design as well as search for detail code patterns. PQL queries are answered automatically by a query evaluation mechanism built into an SPA. Program design models and POL form the core of an SPA conceptual model. He based the SPA's architecture on this conceptual model. By separating the conceptual model from the implementation decisions, one can design SPAs that are customizable to the needs of the maintenance project at hand. Depending on criteria such as efficiency of query evaluation or simplicity of the SPA design, one can implement the same functional specifications of an SPA on a variety of program representations to meet the required criteria. Apart from its role in the design of SPAs, the conceptual model also allows one to rigorously study SPA functionality in the context of the underlying maintenance process and programmer behavior models, in isolation from tool implementation details     

实现Turbo C与汇编语言的接口

介绍了Turbo C与汇编语言的接口技术,通过实例来说明Turbo C调用汇编子程序和Turbo C行间嵌入汇编语句的接口方法。嵌入式汇编提供了一种简单而又明快的方法。使用这种方法可以直接将汇编语言代码放入C语言程序中,汇编语言代码的高速性和深层控制能力可以大大改善程序的性能,同时也避免了C语言与汇编语言的接口所固有的复杂性。     

DECLARE and SDS: Early efforts to commercialize deductive database technology

The Smart Data System (SDS) and its declarative query language, Declarative Reasoning, represent the first large-scale effort to commercialize deductive database technology. SDS offers the functionality of deductive reasoning in a distributed, heterogeneous database environment. In this article we discuss several interesting aspects of the query compilation and optimization process. The emphasis is on the query execution plan data structure and its transformations by the optimizing rule compiler. Through detailed case studies we demonstrate that efficient and very compact runtime code can be generated. We also discuss our experiences gained from a large pilot application (the MVV-expert) and report on several issues of practical interest in engineering such a complex system, including the migration from Lisp to C. We argue that heuristic knowledge and control should be made an integral part of deductive databases.     

基于Android技术校园信息平台客户端的研究与设计

为了提高高校信息化水平,方便智能手机用户查询学校相关信息,在深入进行需求分析基础上,利用Android技术和SQLite数据库,研究了以南通职业大学为例的校园信息平台客户端的设计与实现过程,该客户端实现了校园新闻公告查询、招生信息查询、就业信息查询和教务信息查询等功能。本文还探讨了校园地图、校园黄页的代码实现,应用程序是基于Java语言开发完成的,并且已经在Android 2.2仿真设备上测试通过。     

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.