基于部分计值的信息个人化智能Agent系统

提出了一个基于部分计值技术的信息个人化系统PIPEAgent。部分计值理论源于程序转换中如何在给定部分输入的情况下，对程序完成尽可能多的运算从而对程序进行优化这一问题的探讨，PIPEAgent将部分计值理论与信息个人化相结合，以PIPE(Personalization is Partial Evaluation)理论为基础，结合机器学习技术并采用智能人机交互的Agent构架。该系统已应用于Web信息检索、电子商务应用。     

TUILI(推理)语言编译系统的Java实现

1引言Sun公司发明的Java语言[1]是当今国际公认的长期以来最卓越的程序设计语言,它集简单、独立于平台、面向对象、分布式、安全、可靠、可移植、动态性和多线程等特性于一身,为Internet的使用提供了一个良好的开发和运行环境,开创了计算机的网络计算新时代．由于Java开发的软件“一次写成,到处可用”,故开发和运用Java对于软件与国际接轨并同步发展具有重要的现实意义和长远意义．Java的应用正在普及之中．目前,用于开发游戏一消遣软件或制作具有动化效果主页的小程序applet较多,尚未见用于实现复杂的AI系统．技术上,由于Java…     

Java的安全特性分析及安全代码开发

Java语言是基于类型安全的类型语言，它通过Java语法和Java语义规定Java类型，并保证Java程序的安全性，从JDK1．0到JDK1．1再到从JDK1．2，Java的安全性不断得到加强和完善。然而，安全是相对的，要设计出安全性好的Java程序，就必须深入理解Java的安全特性和安全机制，文章分析了上述问题。     

CORBA/Java在分布式系统中的应用

随着分布式对象技术的逐渐成熟，多层分布式应用体系结构得到了越来越多的应用，CORBA与Java的结合是目前开发分布式应用的研究热点。分析了CORBA中接口定义语言的基本原理，结合Java语言开发分布式应用的特点，设计出基于CORBA／Java开发分布式应用程序的模型，并通过一个具体实例给予详细说明。     

一种基于Java技术的聊天室系统的设计与实现

文章简要介绍了JSP（Java Server Page)以及JDBC（Java Database Connectivity)两项Java新 技术，设计出了用Java技术实现的聊天室系统的模型和结构。最后给出了本聊天室系统中的JSP应用和JDBC数据库连接的部分具体实例。     

Java和Lisp接口问题的研究

文章研究了大型应用系统开发中的混合语言编程问题，列举了Java和Lisp这两种不同的程序设计语言之间的接口编码方式，其中的各种接口模式也可以通过相互封装来实现一些特殊的应用要求。     

Java语言程序例化中的扩展对象别名分析

随着计算机技术的不断进步和发展,Java语言程序凭借着自身的优势得到了广泛的应用,并取得了显著的成效。同时为了推动Java语言程序在计算机技术的作用,需要提高其精度,这就需要借助一定的对象别名分析技术。本文笔者对对象别名分析技术进行了分析和探讨,主要是为提高求值的深度,同时为实现Java语言程序中部分求值器的绑定时间分析的实现,进而为Java语言程序的应用提供指导和借鉴。     

一种用于Java虚拟机的类型化低级语言

为了能够减小运算系统的需信任计算基础、描述较小粒度的安全策略，目前的研究倾向于从程序设计语言和编译器入手来提高软件的安全性．基于以上研究背景设计了一种类型化的低级语言TLL,TLL是一种为Java虚拟机即时编译器设计的类型安全中间语言，以构造一个具有更小需信任计算基础的Java虚拟机系统为目的．TLL的类型系统基于多态的类型化λ演算，它具有丰富的表现力且能够编码各种高级语言的抽象．基于TLL的一个虚拟机原型系统已经实现，它可以作为实现一个高安全且面向多种源语言的运行时系统的起点．     

Java在嵌入式系统中的应用与实现

随着Java的广泛应用及后PC时代的来临,在嵌入式系统中应用Java具有很大的实用价值。本文先归纳了Java的主要特征,介绍了嵌入式产品的特点,分析了在嵌入式系统中应用Java存在的问题,并在对嵌入式系统中实现Java虚拟机的不同实现方法进行评估的基础上,介绍了我们设计的嵌入式Java芯片内该JC401的设计思想与主要技术特点。     

IBM VisualAge for Java 1.0

IBM设计出了VisualAge(VA)开发工具家族，使您可以不用编写代码，只需以可视化的方式即可以将一个应用程序各个独立的部分联接在一起。最新的版本，VisualAge for Java 1．0可以使您很方便地利用组件设计Java应用程序、Applet程序和JavaBeans。     

Improving the Decompilation of Java Bytecode to Prolog by Partial Evaluation

The interpretative approach to compilation allows compiling programs by partially evaluating an interpreter w.r.t. a source program. This approach, though very attractive in principle, has not been widely applied in practice mainly because of the difficulty in finding a partial evaluation strategy which always obtain “quality” compiled programs. In spite of this, in recent work we have performed a proof of concept of that, at least for some examples, this approach can be applied to decompile Java bytecode into Prolog. This allows applying existing advanced tools for analysis of logic programs in order to verify Java bytecode. However, successful partial evaluation of an interpreter for (a realistic subset of) Java bytecode is a rather challenging problem. The aim of this work is to improve the performance of the decompilation process above in two respects. First, we would like to obtain quality decompiled programs, i.e., simple and small. We refer to this as the effectiveness of the decompilation. Second, we would like the decompilation process to be as efficient as possible, both in terms of time and memory usage, in order to scale up in practice. We refer to this as the efficiency of the decompilation. With this aim, we propose several techniques for improving the partial evaluation strategy. We argue that our experimental results show that we are able to improve significantly the efficiency and effectiveness of the decompilation process.     

The narrowing-driven approach to functional logic program specialization

Partial evaluation is a semantics-based program optimization technique which has been investigated within different programming paradigms and applied to a wide variety of languages. Recently, a partial evaluation framework for functional logic programs has been proposed. In this framework, narrowing—the standard operational semantics of integrated languages—is used to drive the partial evaluation process. This paper surveys the essentials of narrowing-driven partial evaluation. Elvira Albert, Ph.D.: She is an associate professor in Computer Science at the Technical University of Valencia, Spain. She received her bachelors degree in computer science in 1998 and her Ph.D. in computer science in 2001, both from the Technical University of Valencia. She has investigated on program optimization and on partial evaluation for declarative multi-paradigm programming languages. Her current research interests include term rewriting, multi-paradigm declarative programming, and formal methods, in particular semantics-based program analysis, transformation, specification, verification, and debugging. Germán Vidal, Ph.D.: He is an associate professor in Computer Science at the Technical University of Valencia, Spain. He obtained his bachelors degree in computer science in 1992 and his Ph.D. in computer science in 1996, both from the Technical University of Valencia. He is active on several research topics in Functional Logic Programming. He has worked on compositionality, on abstract interpretation, and on program transformation techniques for functional logic programs. Currently, his research interests include declarative multi-paradigm programming languages, term rewriting, and semantics-based program manipulation, in particular partial evaluation.     

Prology程序部分计算的研究与实现

部分计算是一种重要的程序变换方法和编译优化技术，Prolog程序特别适合于部分计算。目前，国际上已开始了几个Prolog程序部分计算的原理模型和专用工具，但其中存在以下若于问题:(1)关于Prolog程序部分计算的基本原理和特征缺乏系统的认识;(2)现有的两种检测逻辑程序中循环的方法，并没有最后解决部分计算的终止性问题》;(3)关于Prolog中内部谓词的处理不够究善，而且其中还隐含了许多语叉错误;(4)部分计算算法相当低效；(5)现有的部分计算器局限于各自的应用领域，缺乏通用性。本文结合我们研制GKD－Prolog编译系统[14]剖中一个实用源级部分计算器的工作实践，全面、系统地讨论了纯Prolog的部分计算、逻辑程序的循环检测以及全Prolog的内部谓词处理。     

一个基于部分求值的Java动态优化系统

A dynamic optimization system for Java programs based on partial evaluation is presented in this paper. It consists of four subsystems: Java program transformation, binding time analysis, program specialization generation and application interface generation.     

Challenging problems in partial evaluation and mixed computation

This paper collects together a variety of problems in partial evaluation and mixed computation that appear to be worth solving but as yet lack solutions or (in some cases) precise formulations. The problems come largely from discussions with and notes by participants in the 1987 workshop on Partial Evaluation and Mixed Computation.     

面向对象程序设计语言的绑定时间分析技术

为了实现面向对象语言的部分求值,提出了一种绑定时间分析技术.该技术通过针对引用类型变量和指针变量的上下文敏感分析,能够比较精确地分析面向对象语言中诸如对象元素、数组元素等复杂数据结构元素的绑定时间,进而扩大了部分求值的作用范围.这种方法采用两层BTA环境来保存静态变量和局部变量的BTA状态,设置一种专用句柄来表示不同程序点创建的对象,进而采用这种句柄的集合表示引用类型变量的BTA状态.在为面向对象语言程序标注绑定时间信息的过程中,采用一个正向分析和一个反向分析过程,借助于BTA环境来跟踪和设定各种变量、对象和引用变量的绑定时间.该技术已经用于实现Java程序的绑定时间分析,能够有效地分析大多数单线程的Java程序,为实现高性能Java程序部分求值提供了必要的手段.     

PIPE: Web personalization by partial evaluation

Partial evaluation is a technique popular in the programming languages community. It is applied here as a methodology for personalizing Web content. PIPE (Personalization is Partial Evaluation) is able to personalize Web resources, without enumerating the interaction sequences beforehand. It supports information integration, and varying levels of input by Web visitors. PIPE models personalization as a form of partial evaluation, a technique that uses incomplete input information to specialize programs. This article describes the PIPE methodology and presents experimental results demonstrating its effectiveness in two different domains     

Towards efficient partial evaluation in logic programming

Partial evaluation is a symbolic manipulation technique used to produce efficient algorithms when part of the input to the algorithm is known. Other applications of partial evaluators such as universal compilation and compiler generation are also known to be possible. A partial evaluator receives as input a program and partially known input to that program, and outputs a residual program which should run at least as efficient as the input program with restricted input. In this paper we study the case where both the input and residual programs are logic programs, being the partial evaluator itself a logic program. Up to now, partial evaluators have failed to process large “non=toy” examples. Here we present extensions to partial evaluators whic will allow us to produce more efficient residual programs using less computing resources, during partial evaluation. First, the introduced extensions allow the processing of large examples, which is not possible with the previous techniques. This is now possible since the extensions use less CPU time and memory consumption during the partial evaluation process. Second, the extended partial evaluator produces smaller residual programs, producing important CPU time optimizing effects. With the standard techniques, a partial evaluator will most probably act as a pessimizer, not as an optimizer. Examples are given.     

Specifying and Automatically Generating a Specialization Tool for Fortran 90

Partial evaluation is an optimization technique traditionally used in compilation. We have adapted this technique to the understanding of scientific application programs during their maintenance. We have implemented a tool that analyzes Fortran 90 application programs and performs an interprocedural pointer analysis. This paper presents a dynamic semantics of Fortran 90 and manually derives a partial evaluator from this semantics. The tool implementing the specifications is also detailed. The partial evaluator has been implemented in a generic programming environment and a graphical interface has been developed to visualize the information computed during the partial evaluation (values of variables, already analyzed procedures, scope of variables, removed statements, etc.).     

Inductive assertions and operational semantics

This paper shows how classic inductive assertions can be used in conjunction with a formal operational semantics to prove partial correctness properties of programs. The method imposes only the proof obligations that would be produced by a verification condition generator – but does not require the definition of a verification condition generator. All that is required is a theorem prover, a formal operational semantics, and the object program with appropriate assertions at user-selected cut points. The verification conditions are generated in the course of the theorem-proving process by straightforward symbolic evaluation of the formal operational semantics. The technique is demonstrated by proving the partial correctness of simple bytecode programs with respect to a preexisting operational model of the Java Virtual Machine.