Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Volume 37, Issue 8August 2002
Reflects downloads up to 09 Nov 2024Bibliometrics
Skip Table Of Content Section
COLUMN: Forth
article
Quartus forth for the palm pilot
COLUMN: Technical correspondence
article
How many trivial getter methods does java have?

A recent SIGPLAN Notice [5] repeated a claim [4] that "accessor methods used to obtain the value of a field (getter methods) account for about one fourth of the total number of methods in the standard java.* package source classes". This article ...

article
Embedding built-in tests in hot spots of an object-oriented framework

This paper describes a scheme of encapsulating test support code as built-in test (BIT) components and embedding them into the hot spots of an object-oriented framework so that defects caused by the modification and extension of the framework can be ...

article
Implementing a real computational-environment jump in order to develop a runtime-adaptable reflective platform

Different techniques are emerging in order to build adaptable computing systems and software engineering methods. Two examples in the software engineering field are aspect-oriented programming and multi-dimensional separation of concerns. They ...

article
An overview of methods for dependence analysis of concurrent programs

Program dependence analysis is an analysis technique to identify and determine various program dependencies in source codes, which has been widely used in program understanding, debugging, testing, reverse engineering, and maintenance. However, there ...

article
E-path_PRE: partial redundancy elimination made easy

Partial redundancy elimination (PRE) subsumes the classical optimizations of loop invariant movement and common subexpression elimination. The original formulation of PRE involved complex bi-directional data flows and had two major deficiencies---missed ...

article
Detection of information leak by data flow analysis

This paper uses the standard technique of data flow analysis to statically find information leaks in simple imperative programs. The correctness of the analysis is discussed and the proof is sketched.

Subjects

Currently Not Available

Comments