IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0270967
(2002-10-15)
|
발명자
/ 주소 |
|
출원인 / 주소 |
- Campus Loft Company, Inc.
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
3 인용 특허 :
6 |
초록
▼
A stand can support a conventional four-posted bed at an elevation substantially higher than floor level and provides open access to the greatly increased space beneath the bed. From above, the stand has a straight-sided-U shape with a leg at each corner. Two legs at the head and at the foot of the
A stand can support a conventional four-posted bed at an elevation substantially higher than floor level and provides open access to the greatly increased space beneath the bed. From above, the stand has a straight-sided-U shape with a leg at each corner. Two legs at the head and at the foot of the bed are connected by cross braces such that the stand has two opposing H-shaped end units. A a single longitudinal horizontally disposed truss extending along one side of the bed rigidly and strongly connects the end units.
대표청구항
▼
A stand can support a conventional four-posted bed at an elevation substantially higher than floor level and provides open access to the greatly increased space beneath the bed. From above, the stand has a straight-sided-U shape with a leg at each corner. Two legs at the head and at the foot of the
A stand can support a conventional four-posted bed at an elevation substantially higher than floor level and provides open access to the greatly increased space beneath the bed. From above, the stand has a straight-sided-U shape with a leg at each corner. Two legs at the head and at the foot of the bed are connected by cross braces such that the stand has two opposing H-shaped end units. A a single longitudinal horizontally disposed truss extending along one side of the bed rigidly and strongly connects the end units. the array, wherein an element within the one or more ranges is alive at the given point in the program if there is an execution sequence using the element in the program following the given point, and there is no assignment of the memory location assigned to the element intermediate the given point and the use of the element by the execution sequence. 13. A method according to claim 12, wherein identifying the one or more live ranges comprises performing a data flow analysis of the program in a backward direction relative to the execution sequence. 14. A method according to claim 1, wherein the array elements comprise references to objects used in the program. 15. A method according to claim 14, wherein the program comprises a program module, which is called by another program module, and wherein the references are indexed by program variables that are substantially encapsulated within the module. 16. A method according to claim 1, wherein passing the information comprises identifying elements in the array that are outside the range so that memory locations assigned thereto can be reclaimed by a garbage collection function. 17. A method according to claim 16, wherein identifying the elements outside the range comprises providing an explicit assignment of one or more of the elements to null responsive to the identification, so that the memory locations assigned to the one or more elements can be reclaimed during run time of the program. 18. A method according to claim 16, wherein identifying the elements in the array comprises providing to the garbage collection function an identification of the range of the elements, so that the garbage collection function will not trace at least some of the elements outside the range. 19. A method according to claim 18, wherein the program comprises a program module, which is called by another program module, and wherein passing the information comprises storing information identifying the range of the elements in a data field associated with the module. 20. A method according to claim 19, wherein the program module comprises a Java class, and wherein passing the information comprises setting a flag in a class data structure associated with the class to indicate that the information is available. 21. A method according to claim 19, wherein determining the range of the elements comprises analyzing the program module to find a range of live elements in the array while compiling the program module. 22. A method according to claim 21, wherein the program module comprises a Java program module, and wherein analyzing the program is performed by a Java compiler. 23. A method according to claim 22, wherein the Java compiler receives and compiles Java source code. 24. A method according to claim 22, wherein the Java compiler receives and compiles Java byte code. 25. A method for program execution, comprising: receiving code corresponding to a program module, which includes a data field containing information that identifies a range within an array of elements used in the program module such that at a specified point in execution of the program module, none of the elements in the array outside the range is alive; running the code so as to assign memory locations to the elements in the array; and reclaiming during run time of the code the memory locations assigned to at least some of the elements in the array that are outside the range, whereby the reclaimed locations may be assigned to other elements and a memory leak is prevented in the execution of the program. 26. A method according to claim 25, wherein receiving the code comprises receiving code in which a range of values of a program variable that indexes the elements in the array is identified. 27. A method according to claim 25, wherein receiving the code comprise receiving Java source code. 28. A method according to claim 25, wherein receiving the code comprise receiving Java byte code. 29. A method according to claim 25, wherein reclai ming the memory locations comprises actuating a garbage collection function. 30. A method for software verification, comprising: creating an array of vectors, each vector comprising an array of vector elements; adding a new vector to the array; adding a new vector element to the new vector, such that a memory location is assigned to the element; removing the element without explicitly assigning the element to null; repeating the steps of adding a new vector, adding a new vector element to the new vector, and removing the element a given number of times, whereby a memory error that occurs due to repeating the steps is detected. 31. Programming apparatus, comprising: a memory, which stores program code including an array of elements; and a processor, coupled to read from and write to the memory, which finds at a given point in the program a range of the elements within the array such that none of the elements in the array outside the range is alive at the point, responsive to which range the processor manages the assignment of memory locations to the elements in the array during execution of the program code. 32. Apparatus according to claim 31, wherein the elements in the array are indexed by a program variable, and wherein the processor finds a relation with respect to the program variable so as to identify the range. 33. Apparatus according to claim 32, wherein the processor performs a variable relations analysis of the program in a forward direction relative to an execution sequence of the program so as to find the program variable relation. 34. Apparatus according to claim 33, wherein the processor performs a liveness analysis of the program in a backward direction relative to an execution sequence of the program. 35. Apparatus according to claim 34, wherein the array elements comprise references to respective objects used in the program. 36. Apparatus according to claim 31, wherein a garbage collection function reclaims at least some of the memory locations assigned to the elements in the array that are outside the range, whereby the reclaimed locations may be assigned to other objects so as to prevent memory leaks in execution of the program code. 37. Apparatus according to claim 36, wherein the program comprises a Java program, and wherein the processor analyzes the program to find the range of elements while compiling the program. 38. Apparatus for program execution, comprising: a memory, which stores code corresponding to a program module, which includes a data field containing information that identifies a range within an array of elements used in the program module, such that at a specified point in execution of the program module, none of the elements in the array outside the range is alive; and a processor, which runs the code while assigning locations in the memory to the elements in the array, such that during run time, the memory locations assigned to at least some of the elements in the array that are outside the range are reclaimed, whereby the reclaimed locations may be assigned to other elements so that a memory leak is prevented in the execution of the program. 39. Apparatus according to claim 38, wherein the range within the array is identified by a program variable that indexes the elements in the array. 40. Apparatus according to claim 38, wherein the code comprises Java source code. 41. Apparatus according to claim 38, wherein the code comprises Java byte code. 42. Apparatus for software verification, comprising: a memory, having a given size; and a processor, coupled to read from and write to the memory, which creates an array of vectors, each vector comprising vector elements, and successively adds new vectors to the array and adds and then removes new elements to the new vectors a given number of times without explicitly assigning the removed elements to null, thereby to determine whether a memory error occurs due to an array memory leak. 43. A computer software product for
※ AI-Helper는 부적절한 답변을 할 수 있습니다.