초록 ▼

The closure device includes interlocking fastening strips and a slider. The ends of the fastening strips are heat sealed, melted or otherwise secured together. The fastening strips include a slit near the end of the fastening strips. The slit prevents the separator of the slider from deoccluding the

The closure device includes interlocking fastening strips and a slider. The ends of the fastening strips are heat sealed, melted or otherwise secured together. The fastening strips include a slit near the end of the fastening strips. The slit prevents the separator of the slider from deoccluding the fastening strips when the slider is at the occluded end. The slit allows the top edge of the fastening strips to bend around the separator while the fastening strips remain occluded.

대표청구항 ▼

The closure device includes interlocking fastening strips and a slider. The ends of the fastening strips are heat sealed, melted or otherwise secured together. The fastening strips include a slit near the end of the fastening strips. The slit prevents the separator of the slider from deoccluding the

The closure device includes interlocking fastening strips and a slider. The ends of the fastening strips are heat sealed, melted or otherwise secured together. The fastening strips include a slit near the end of the fastening strips. The slit prevents the separator of the slider from deoccluding the fastening strips when the slider is at the occluded end. The slit allows the top edge of the fastening strips to bend around the separator while the fastening strips remain occluded. viding a second design circuit having a second candidate cut point, the first and second candidate cut points corresponding to each other; preparing an at least one input vector for random symbolic simulation; executing symbolic trajectory evaluation simulation and filling all simulation traces of any verification nodes; determining if mode of operation is cut points identification or semi-exhaustive verification, and when it is determined that the mode of operation is cut points identification, then dividing the first and second cut point candidates into equivalence classes by their simulation traces. 12. The method of claim 11, further comprising before preparing the at least one input vector for random symbolic simulation, executing a logic simulator trace simulation and filling the simulation traces of the corresponding first and second verification nodes when a logic simulator file is predetermined to run. 13. The method of claim 11, further comprising dumping cut points information into a file. 14. The method of claim 13, wherein the method is used in verifying Very Large Scale Integration circuits. 15. The method of claim 14, further comprising: allocating identification of an area of the first and second design circuits to employ the method to at least one of a user, automatic manipulated device and a manually manipulated device. 16. The method of claim 11, wherein the at least one input vector includes at least one of a number of input vectors and a simulation length. 17. The method of claim 16, wherein the at least one of the number of input vectors and the simulation time length for the method are predetermined by a user. 18. The method of claim 11, further comprising: generating a signal to the user when the cut points are dumped into the file, the file being a digital file and being accessible by the user. 19. A formal equivalence verification simulation system of two design circuits comprising: a simulation length and density controller to control simulation length and density parameters; an initial state finder to provide for various input vectors; a compatibility engine checker to check the two design circuits and to check compatibility of any verification nodes of the two design circuits during each simulation step; a counter example generator to generate a counter example to when the compatibility engine checker determines that corresponding verification nodes of the two design circuits are not similar. 20. The system of claim 19, wherein the simulation length is a number of clock cycles in the simulation and the density parameters is a number of symbolic variables introduced in each phase of the simulation. 21. The system of claim 20, wherein the simulation length is about 20 to about 100 cycles and the density parameters is between about 1 to about 4 depending upon at least one of an amount of pipe stages and an amount of logic stages to yield better cut point identification. 22. The system of claim 19, wherein the various input vectors include at least one of a number of input vectors and a simulation length. 23. The system of claim 22, wherein the input vectors are at least one of predetermined by a user and by random symbolic simulation process which starts at an initial state. 24. The system of claim 19, wherein the initial state finder finds an initial state using at least one of a combinational fixed-point algorithm, a random binary initialization patterns, and a user given initialization pattern. 25. The system of claim 19, further comprising: a process splitter to split the simulation system into at least two circuit area phases so that a memory allocated in a first of the at least two circuit area phases is capable of being made available for use in a second of the at least two circuit area phases. 26. A set of instructions residing in a storage medium, the set of instructions capable of being executed by a processor to implement a method for formal equivalence verificat ion comprising: providing a first design circuit having a first verification node; providing a second design circuit having a second verification node, the first and second verification nodes corresponding to each other; preparing an at least one input vector for random symbolic simulation; executing symbolic trajectory evaluation simulation and filling any simulation traces of the first and second verification nodes; determining if mode of operation is cut points identification or semi-exhaustive verification, and when it is determined that the mode of operation is semi-exhaustive verification, then comparing any simulation traces of the corresponding first and second verification nodes; producing an answer to indicate whether the simulation traces of the corresponding first and second verification nodes were similar or non-similar. 27. The set of instructions residing in a storage medium of claim 26, further comprising: generating a counter example when the answer is determined as non-similar; before preparing the at least one input vector for random symbolic simulation, executing a logic simulator trace simulation and filling the simulation traces of the corresponding first and second verification nodes when a logic simulator file is predetermined to run; and wherein the at least one input vector includes at least one of a simulation length and a number of the input vectors. 28. A set of instructions residing in a storage medium, the set of instructions capable of being executed by a processor to implement a method for formal equivalence verification comprising: providing a first design circuit having a first candidate cut point; providing a second design circuit having a second candidate cut point, the first and second candidate cut points corresponding to each other; preparing an at least one input vector for random symbolic simulation; executing symbolic trajectory evaluation simulation and filling all simulation traces of any verification nodes; determining if mode of operation is cut points identification or semi-exhaustive verification, and when it is determined that the mode of operation is cut points identification, then dividing the first and second cut point candidates into equivalence classes by their simulation traces. 29. The set of instructions residing in a storage medium of claim 28, further comprising: before preparing the at least one input vector for random symbolic simulation, executing a logic simulator trace simulation and filling the simulation traces of corresponding first and second verification nodes when a logic simulator file is predetermined to run; dumping cut points information into a file; allocating identification of an area of the first and second design circuits to employ the method to at least one of a user, automatic manipulated device and a manually manipulated device; generating a signal to the user when the cut points are dumped into the file, the file being a digital file and being accessible by the user.