Downloads & Free Reading Options - Results

A computer program called "Rational Sequence" generates Universal Modeling Language (UML) sequence diagrams of a target Java program running on a Java virtual machine (JVM). Rational Sequence thereby performs a reverse engineering function that aids in the design documentation of the target Java program. Whereas previously, the construction of sequence diagrams was a tedious manual process, Rational Sequence generates UML sequence diagrams automatically from the running Java code.

Binary decision diagrams (BDDs) are a data structure that can efficiently represent large relations and provide efficient set operations. BDDs have traditionally been used for model checking, formal verification, optimizing circuit diagrams, etc. My research applies BDDs to the area of program analysis. In this talk, I will describe a scalable context-sensitive, inclusion-based pointer alias analysis for Java programs. My approach to context sensitivity is to create a clone of a method for every context of interest, and run a context-insensitive algorithm over the expanded call graph to get context-sensitive results. Normally, this formulation is hopelessly intractable as a call graph often has 10 14 acyclic paths or more. I show that these exponential relations can be computed efficiently using BDDs. I applied my algorithm to the most popular applications available on Sourceforge and found that even the largest programs can be analyzed in under 20 minutes. Using BDDs for program analysis also allows us to specify program analyses at a higher level. The pointer analysis, along with many other algorithms, can be described succinctly and declaratively using Datalog, a logic programming language. I have developed a system called 'bddbddb' that automatically translates Datalog programs into highly efficient BDD implementations. I and others have used bddbddb to develop a variety of context-sensitive algorithms, including side effect analysis, escape analysis, external lock analysis, and analyses to detect and prevent various security vulnerabilities in C and Java programs. Experiments have shown that the code generated by bddbddb is up to five times faster than a hand-coded, hand-tuned solver. ©2005 Microsoft Corporation. All rights reserved.

REDUCE 2 is reported as a FORMAC program which symbolically calculates the transfer function(s) of any linear-block-diagram output variable to any or all input variables. The program requires as input a set of algebraic expressions representing the block diagram, the desired transfer function(s), and a string of variables indicating the desired order of reduction. The solution is presented in the compact form of a set of nested functions (super G's). The program can handle systems as large as 600 equations and is intended as a tool for the analysis of complex control and dynamic systems. A companion FORTRAN program, EVAL 2, which numerically evaluates the solution set to obtain amplitude ratio and phase angle as functions of frequency is also presented.

The Fe-Cl-H2O system provides a simple example of the application of the program. The metallic species which will be considered are shown in Table 1. Later, a more complex example will be given. Since computer line printers display only capital letters, it is necessary to develop a suitable convention for writing chemical equations entirely on one line (no subscripts) and in capital letters. Any reasonable, internally consistent, convention may be employed. Further reference to Table 1 will supply insight into the type of convention employed by the authors in this example. In order to avoid confusion in reading the balanced chemical equations, the computer places an asterisk between all coefficients and the chemical species to which they refer.

Binary decision diagrams (BDDs) are a data structure that can efficiently represent large relations and provide efficient set operations. BDDs have traditionally been used for model checking, formal verification, optimizing circuit diagrams, etc. My research applies BDDs to the area of program analysis. In this talk, I will describe a scalable context-sensitive, inclusion-based pointer alias analysis for Java programs. My approach to context sensitivity is to create a clone of a method for every context of interest, and run a context-insensitive algorithm over the expanded call graph to get context-sensitive results. Normally, this formulation is hopelessly intractable as a call graph often has 10 14 acyclic paths or more. I show that these exponential relations can be computed efficiently using BDDs. I applied my algorithm to the most popular applications available on Sourceforge and found that even the largest programs can be analyzed in under 20 minutes. Using BDDs for program analysis also allows us to specify program analyses at a higher level. The pointer analysis, along with many other algorithms, can be described succinctly and declaratively using Datalog, a logic programming language. I have developed a system called 'bddbddb' that automatically translates Datalog programs into highly efficient BDD implementations. I and others have used bddbddb to develop a variety of context-sensitive algorithms, including side effect analysis, escape analysis, external lock analysis, and analyses to detect and prevent various security vulnerabilities in C and Java programs. Experiments have shown that the code generated by bddbddb is up to five times faster than a hand-coded, hand-tuned solver. ©2005 Microsoft Corporation. All rights reserved.

The aim of XLOOPS is to calculate one-particle irreducible Feynman diagrams with one or two closed loops for arbitrary processes in the Standard model of particles and related theories. Up to now this aim is realized for all one-loop diagrams with at most three external lines and for two-loop diagrams with two external lines.

The software modules which comprise the IGDS/TRAP Interface Program are described. A hierarchical input processing output (HIPO) chart for each user command is given. The description consists of: (1) function of the user command; (2) calling sequence; (3) moduls which call this use command; (4) modules called by this user command; (5) IGDS commands used by this user command; and (6) local usage of global registers. Each HIPO contains the principal functions performed within the module. Also included with each function are a list of the inputs which may be required to perform the function and a list of the outputs which may be created as a result of performing the function.

REDUCE 2 is reported as a FORMAC program which symbolically calculates the transfer function(s) of any linear-block-diagram output variable to any or all input variables. The program requires as input a set of algebraic expressions representing the block diagram, the desired transfer function(s), and a string of variables indicating the desired order of reduction. The solution is presented in the compact form of a set of nested functions (super G's). The program can handle systems as large as 600 equations and is intended as a tool for the analysis of complex control and dynamic systems. A companion FORTRAN program, EVAL 2, which numerically evaluates the solution set to obtain amplitude ratio and phase angle as functions of frequency is also presented.

This specification establishes the requirements, concepts, and preliminary design for a set of software known as the IGDS/TRAP Interface Program (ITIP). This software provides the capability to develop at an Interactive Graphics Design System (IGDS) design station process flow diagrams for use by the NASA Coal Gasification Task Team. In addition, ITIP will use the Data Management and Retrieval System (DMRS) to maintain a data base from which a properly formatted input file to the Time-Line and Resources Analysis Program (TRAP) can be extracted. This set of software will reside on the PDP-11/70 and will become the primary interface between the Coal Gasification Task Team and IGDS, DMRS, and TRAP. The user manual for the computer program is presented.

We explain the construction of Forcer, a FORM program for the reduction of four-loop massless propagator-type integrals to master integrals. The resulting program performs parametric IBP reductions similar to the three-loop Mincer program. We show how one can solve many systems of IBP identities parametrically in a computer-assisted manner. Next, we discuss the structure of the Forcer program, which involves recognizing reduction actions for each topology, applying symmetries, and transitioning between topologies after edges have been removed. This part is entirely precomputed and automatically generated. We give examples of recent applications of Forcer, and study the performance of the program. Finally we demonstrate how to use the Forcer package and sketch how to prepare physical diagrams for evaluation by Forcer.

A computer program for studying linear ocean wave refraction is described. The program features random-access modular bathymetry data storage. Three bottom topography approximation techniques are available in the program which provide varying degrees of bathymetry data smoothing. Refraction diagrams are generated automatically and can be displayed graphically in three forms: Ray patterns with specified uniform deepwater ray density, ray patterns with controlled nearshore ray density, or crest patterns constructed by using a cubic polynomial to approximate crest segments between adjacent rays.

4 Diagrams of Pulsa Programs from the files of Bill Duesing. Date range 1968 to 2003. We assume these programs were for the new control system created by Fuge and Kindlmann. Bill Duesing wrote: "The first four are pencil drawings on yellowed heavy paper which I believe are diagrams of some of the programs we did at the A & A Building. One has the name High Speed, another is Clicks."  

We present the program BOKASUN for fast and precise evaluation of the Master Integrals of the two-loop self-mass sunrise diagram for arbitrary values of the internal masses and the external four-momentum. We use a combination of two methods: a Bernoulli accelerated series expansion and a Runge-Kutta numerical solution of a system of linear differential equations.

We present the program BOKASUN for fast and precise evaluation of the Master Integrals of the two-loop self-mass sunrise diagram for arbitrary values of the internal masses and the external four-momentum. We use a combination of two methods: a Bernoulli accelerated series expansion and a Runge-Kutta numerical solution of a system of linear differential equations.

Computer program for symbolic reduction of block diagrams to obtain transfer functions