Simulation of automatically-generated test programs is the primary means for verifying complex hardware designs and random test program generators therefore play a major role in the verification process of micro-proce...
详细信息
ISBN:
(纸本)0780376552
Simulation of automatically-generated test programs is the primary means for verifying complex hardware designs and random test program generators therefore play a major role in the verification process of micro-processors. The input for a test program generator is typically an abstract specification-a template-of the tests to be generated. Due to randomness, generators often encounter situations that were not anticipated when the test specification was written. In this paper, we introduce the concept of adaptive test program generation, which is designed to handle these unforeseen situations. We propose a technique that defines unexpected events together with their alternative program specifications. When an event is detected, its corresponding alternative specification is injected into the test program.
Scoped memory is perhaps the most novel contribution of the Real-Time Specification for Java (RTSJ) to the Java programming language. In this paper we show that scoped memory can be used to reduce the processor overhe...
详细信息
ISBN:
(纸本)0769515584
Scoped memory is perhaps the most novel contribution of the Real-Time Specification for Java (RTSJ) to the Java programming language. In this paper we show that scoped memory can be used to reduce the processor overhead of any possible garbage collection algorithm and to avoid all latency introduced by any garbage collection algorithm. These semantics make it easier to write correct real-time programs.
In this paper, we describe the pattern-based automatic program generator. The new approach that mitigates restrictions between general package approach and application-oriented approach in software development is desc...
详细信息
ISBN:
(纸本)0769514472
In this paper, we describe the pattern-based automatic program generator. The new approach that mitigates restrictions between general package approach and application-oriented approach in software development is described. It provides efficient solutions for developing application-oriented systems. Experimental results show that our approach results in significant improvement as compared to the traditional software development.
automatic program transformation, such as specialization, often introduces intermediate recursions that compute partial functions on parameters that are directly defined by simple recursive definitions. Replacing thes...
详细信息
automatic program transformation, such as specialization, often introduces intermediate recursions that compute partial functions on parameters that are directly defined by simple recursive definitions. Replacing these recursive definitions by one-step definitions not only simplifies the residual program, but also allows more useful information to be propagated to remaining parts of the program, for continuing specialization. We give an easily recognized characterization of a class of recursive definitions, called syntactical monomials, that can be transformed to one-step definitions. We show our transformation is meaningful for specialization of interpreters and self-application of specializers.
The purpose of this paper is to show that we can generate efficient string matching algorithms automatically by Generalized Partial Computation (GPC). GPC is a program transformation method utilizing partial informati...
详细信息
The purpose of this paper is to show that we can generate efficient string matching algorithms automatically by Generalized Partial Computation (GPC). GPC is a program transformation method utilizing partial information about input data and auxiliary functions as well as the logical structure of a source program. GPC uses both a classical partial evaluator and an inference engine such as a theorem prover to optimize programs. Here, we show that a Boyer-Moore type pattern matcher without the bad-character heuristic can be generated from a naive non-linear backward matcher by GPC. This sort of problem has already been discussed in a literature using off-line partial evaluator. However, to the best of our knowledge, this is the first paper to prove that every generated matcher runs in the same way as the BM. Here we will show with a proof that the problem can be solved starting from a simple and naive pattern matcher as a source program. We also show with a proof that a KMP type linear string matcher can be generated from a naive non-linear forward matcher by GPC.
An approach to software composition from heterogeneous components is presented. The focus is on heterogeneity of interaction styles. The interface of a component is described in an abstract manner, hiding the componen...
详细信息
We present a programming methodology that reduces parallel programming complexity, while creating portable and automatically scalable parallel software. To support this methodology two separate tools have been develop...
详细信息
We present a programming methodology that reduces parallel programming complexity, while creating portable and automatically scalable parallel software. To support this methodology two separate tools have been developed - the PARSA software development environment, and an accompanying thread manager. The development environment addresses programming issues via an object-based graphical programming methodology that transforms a project automatically into a portable and scalable source code. The generated source code makes calls to the user-level thread manager, which manages the run time execution of the parallel software. Two sample applications that contain various forms of parallelism have been developed and are compiled on three different systems with diverse native threading mechanisms to demonstrate portability. Finally, the automatic scalability is demonstrated with the run time performance of the applications on multiprocessor systems.
To reuse an electronic educational material, a teacher has to understand its availability and methodology. This paper proposed the technique of integrating electronic class text, such as HTML/XML, into automated recor...
详细信息
To reuse an electronic educational material, a teacher has to understand its availability and methodology. This paper proposed the technique of integrating electronic class text, such as HTML/XML, into automated records of activities in a class. Our hypothesis is that an activity has influence on both the automated records and the class text. We designed structured record expression and event rules. The system integrates a class text into the records by forward deductive inference.
In this paper, we describe an agent based a programming language learning support system for novice programmers in a distance-learning environment. The intention of this research work is to construct a learning suppor...
详细信息
In this paper, we describe an agent based a programming language learning support system for novice programmers in a distance-learning environment. The intention of this research work is to construct a learning support system, which enables learners to efficiently study a programming language. Generally, agent systems for a pedagogical purpose have a special role of adapting learners' needs, arranging collaboration among learners and making the system to be easy to author, etc. The present agent system follows such matters, however, this system mainly deals with programming principles and concepts to be taught based on the result of automatic diagnoses of students' psychological factors during learning. Usually self-study is one of the inextricable problems for novice students who are generally unmotivated to learn it, or even too complex a language is a big obstacle for students who are motivated to learn programming languages. The agent system, reported in this paper attempts to understand students' behavior by observing their typing events, behaviors on different purpose of web browser of lessons, tasks and examples, error types made by students and debugging events on a programming editor, then support students with relevant information. The system has a special programming language environment to provide students with lessons, tasks, and examples of tasks in a web integrated environment.
The emergence of networked lightweight portable computing devices can potentially enable accessibility to a vast array of remote applications and data. In order to cope with shortage of local resources such as memory,...
详细信息
The emergence of networked lightweight portable computing devices can potentially enable accessibility to a vast array of remote applications and data. In order to cope with shortage of local resources such as memory, CPU and bandwidth, such applications are typically designed as a thin-client thick-server applications. However, another highly desirable yet conflicting requirement is to support disconnected operation, due to the low quality and high cost of online connectivity. We present a novel programming model and a runtime infrastructure that addresses these requirements by automatically reconfiguring the application to operate in disconnected mode of operation, when voluntary disconnection is requested, and automatically resorting to normal distributed operation, upon reconnection. The programming model enables developers to design disconnected aware applications by providing a set of component reference annotations with special disconnection and reconnection semantics. Using these annotations, designers can identify critical components, priorities, dependencies, local component alternatives with reduced functionality, and state merging policies. The runtime infrastructures carries out dis- and re-connection semantics using component mobility and dynamic application layout. The disconnected operation framework, FarGo-DA, is an extension of FarGo, a mobile component framework for distributed applications.
暂无评论