42 results about "Code refactoring" patented technology

Automated refactorings as implemented in modern IDEs for Java usually make no special provisions for concurrent code. Thus, refactored programs may exhibit unexpected new concurrent behaviors. We analyze the types of such behavioral changes caused by current refactoring engines and develop techniques to make them behavior-preserving, ranging from simple techniques to deal with concurrency-related language constructs to a framework that computes and tracks synchronization dependencies. By basing our development directly on the Java Memory Model we can state and prove precise correctness results about refactoring concurrent programs. We show that a broad range of refactorings are not influenced by concurrency at all, whereas other important refactorings can be made behavior-preserving for correctly synchronized programs by using our framework. Experience with a prototype implementation shows that our techniques are easy to implement and require only minimal changes to existing refactoring engines.

A successive approximation analog-to-digital converter and conversion method thereof are provided, the successive approximation analog-to-digital converter includes a segmented-multiple-stage capacitor array with redundancy bits, a comparator, a weight-storage circuit, a code reconstruction circuit and a control logic circuit. The successive approximation analog-to-digital converter helps to decrease the complexity of circuit design, featuring small size and low power. Without auxiliary capacitor array, switches and control logic, the circuit can work to precisely measure and correct capacitor mismatch errors.

A method of improving software architecture by untangling undesired code level dependencies is provided herein. The method includes the following stages: generating an abstract representation of a computer code in a form of a code model; recording manipulations to the computer code applied by a user to the code model; calculating a series of refactorings in the computer code that represents the recorded manipulation; and carrying out the refactorings within the computer code. Specifically, some of the refactorings include separating low level software elements on the method level in response to the user manipulations of the model.

The invention provides a fine power reconstruction method for a fuel assembly. The method includes the steps that 13 boundary conditions of fast group and thermal group node volume flux, neutron flux of the four faces of a node, neutron current and neutron flux of four angular points and a node x-direction and y-direction transverse one-dimensional integral neutron flux expansion function are acquired through calculation of a nodal method; a fast group neutron flux distribution expansion function and a thermal group neutron flux distribution expansion function based on an orthogonal function family primary function are acquired; four boundary conditions are added, bothway integration is conducted on the fast group neutron flux distribution expansion function and the thermal group neutron flux distribution expansion function, and neutron flux distribution restrained by a weighting function is acquired; 17-order expansion coefficients of fast group and thermal group neutron even flux distribution are calculated according to the acquired 13 boundary conditions and the neutron flux distribution restrained by the weighting function; fine power distribution of the fuel assembly is obtained accordingly. The calculation precision and calculation efficiency can be remarkably improved, calculation is easy and convenient, and code reconstruction is easy.