WO2012037732A1 - 建立数据结构及描述计算机运行状态及其状态迁移的方法 - Google Patents
建立数据结构及描述计算机运行状态及其状态迁移的方法 Download PDFInfo
- Publication number
- WO2012037732A1 WO2012037732A1 PCT/CN2010/077309 CN2010077309W WO2012037732A1 WO 2012037732 A1 WO2012037732 A1 WO 2012037732A1 CN 2010077309 W CN2010077309 W CN 2010077309W WO 2012037732 A1 WO2012037732 A1 WO 2012037732A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- calling
- instruction
- code
- computer
- current
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/3604—Software analysis for verifying properties of programs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/362—Software debugging
- G06F11/3636—Software debugging by tracing the execution of the program
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
Definitions
- the present invention relates to the field of computers, and more particularly to a method of establishing a data structure describing a computer code execution process and a method of describing a computer operating state and its state transition.
- the computer system security detection system, the system security management system, the active defense system, etc. in the prior art all have the following deficiencies: 1. Only a certain function point or an operation of the computer can be monitored, and only the operation can be judged by the single order. Whether it is allowed to happen. 2. This kind of monitoring is only the result monitoring, and it is impossible to monitor the process. 3. This monitoring and management is only an afterthought, that is, the process can only be judged through the results. The main reason is that the current technology can not realize the state of description of the operation of the computer, and it is impossible to accurately control the calculation running state. If you want to achieve the purpose of fully managing and controlling the computer system, you must manage every operation of the computer system, and analyze why it causes the current operation. Only when the current operation is fully analyzed, can the current operation be accurately determined. of Correctness, the effective management of the computer system, in order to achieve the full management and control of the computer system.
- the present invention provides a method of establishing a data structure describing a computer code execution process, including:
- the code segment where the calling instruction is located is a node, and the calling relationship between the code segment and the called code segment initiated by the calling instruction to initiate the calling instruction establishes a data structure for the calling path; the data structure includes each node. , and the calling path between each calling node and the called node.
- the establishing the data structure includes:
- the obtaining the calling instruction includes:
- the obtaining the code segment that initiates the calling instruction and the called code segment include:
- the present invention has the following advantages:
- the invention uses the code segment between the calling instructions as a node to establish a data structure for the calling path by calling the calling relationship between the code segment of the calling instruction and the called code segment.
- a data structure for the calling path by calling the calling relationship between the code segment of the calling instruction and the called code segment.
- the present invention also provides a method of describing a computer operating state using the data structure described above, including:
- the data structure consisting of all nodes and call paths before the call instruction describes the running state of the computer when the call instruction is executed.
- it also includes:
- the present invention has the following advantages:
- the present invention also provides a method for describing a computer operating state transition using the data structure described above, including:
- the current computer running state is described by a data structure consisting of all nodes and call paths before the current call instruction;
- a new calling path is established by the code segment called by the current calling instruction as a node, the calling relationship between the code segment of the calling current instruction and the called code segment established by the calling instruction, the new node, the new calling path and
- the data structure formed by all the nodes and the calling path of the current computer running state is the running state of the next computer;
- the process of generating a new node and a new invocation path is used to describe the migration of the current computer operating state to the next computer running state.
- it also includes:
- the code fragment that is called by the current calling instruction is a new node, to be called
- the call relationship established between the code fragment and the called code fragment of the instruction that initiated the instruction is that the new call path includes:
- a new calling path is established with the established calling relationship.
- the obtaining the current calling instruction includes:
- the acquiring the code segment of the current calling instruction includes: obtaining an address of the called code segment of the current calling instruction from the calling parameter; acquiring the current calling instruction based on the address of the called code segment of the current calling instruction The code fragment being called.
- the present invention has the following advantages:
- the method for describing the running state of the computer in the present invention it can be known how the computer migrates from the current running state to the next running state, that is, the association between the current running state of the computer and the next running state can be known.
- the operating efficiency of the computer can be evaluated, the operating efficiency of the computer can be adjusted, and the operating efficiency of the computer can be improved; and the running state of the computer can be monitored as a whole, which is beneficial to the evaluation of the hardware and software.
- FIG. 1 is a flow chart of a method of establishing a data structure describing a computer code execution process in accordance with an embodiment of the present invention
- 2 is a schematic diagram of a code segment calling relationship according to a specific embodiment of the present invention
- FIG. 3 is a schematic diagram of a data structure established in a specific embodiment of the present invention.
- the method of the present invention for establishing a data structure describing a computer code execution process uses a code segment in which the instruction is located as a node to initiate a call between the code segment of the call instruction and the called code segment.
- the relationship establishes a data structure for the calling path; the data structure includes each node, and a calling path between each calling node and the called node. This way you can know who initiated the call (initiator) and to whom (invoking the target).
- the computer implements certain functions by executing code and calling between function functions, wherein a piece of code executed in sequence is defined as a code segment, and after executing a code segment in sequence, the next code segment is executed by calling the instruction jump, based on
- the present invention establishes a data structure that describes the execution of computer code.
- the method for establishing a data structure describing a computer code execution process when the computer is running, using a code segment in which the instruction is located as a node, calling between the code segment of the initiating call instruction and the called code segment established by the call instruction
- the relationship establishes a data structure for the calling path; the data structure includes each node, and a calling path between each calling node and the called node.
- the calling node refers to a node established by a code fragment that initiates a calling instruction
- the called node refers to a node established by a code fragment (ie, a called code fragment) to be called by the calling instruction, that is, adjacent to the establishment order.
- the calling node refers to the node established first
- the called node refers to the node established later.
- a method for establishing a data structure describing a computer code execution process according to an embodiment of the present invention includes:
- Step S1 acquiring a call instruction
- Step S2 Obtain a code segment that initiates the calling instruction and a code fragment of the called code
- Step S3 establishing a node by using the acquired code segment that initiates the calling instruction and the called code segment;
- step S4 a code segment initiating the calling instruction and a calling relationship between the called code fragments are established, and the established calling relationship is a calling path between the calling node and the called node.
- Step S1 Acquiring a call instruction: The call instruction divides the computer code into a plurality of code segments, each code segment is a sequence of executed code, and the last line of code of each code segment is a call instruction. .
- the calling instruction is an assembly instruction
- the code run by the computer is a machine code.
- the obtaining the calling instruction in the specific embodiment of the present invention includes: performing binary translation on the machine code of the computer to obtain Call the instruction. Specifically, the machine code is translated into assembly language by binary translation of the machine code when the computer is running. This process is a disassembly process. After the disassembled assembly language is obtained, the call instruction in the assembly language is obtained.
- FIG. 2 is a schematic diagram of a code segment calling relationship according to a specific embodiment of the present invention.
- FIG. 2 shows a plurality of code segments, which are respectively composed of code blocks 11 composed of Al ⁇ An lines and composed of B1 ⁇ Bn lines.
- Code fragment 12 a generation consisting of Cl ⁇ Cn line code Code segment 13 , a code segment 21 consisting of ⁇ 1 ⁇ ⁇ line code, a code segment 31 consisting of LI ⁇ Ln line codes, where An line code, Bn line code, Cn line code, Mn line code, Ln line code All are call instructions, the computer code shown in Figure 2 is divided into multiple code segments by An line code, Bn line code, Cn line code, Mn line code, Ln line code, that is, code segment 11, code segment 12, code Fragment 13, code segment 21, code segment 31. In the specific embodiment of the present invention shown in FIG. 2, after the computer executes the code segment 11, the code segment 21 is called by the An line code.
- the code segment 31 is called by the Mn line code, and the code segment is executed.
- the code segment 12 is called by the Ln line code, and after the code segment 12 is executed, the code segment 13 is called by the Bn line code.
- the An line code, the Bn line code, the Cn line code, the Mn line code, and the Ln line code are machine code, and binary translation is performed to obtain an assembly language call instruction.
- Step S2 is executed to obtain a code segment that initiates the call instruction and a called code segment. Still taking FIG. 2 as an example, after executing step S1 and acquiring the call instruction, the acquired call instruction divides the computer code into a plurality of code segments, namely, code segment 11, code segment 12, code segment 13, code. Fragment 21, code fragment 31. For example, if the call instruction obtained in step S1 is the call instruction indicated by the An line code, the code segment 11 that initiated the call instruction, the called code segment 21 is obtained in step S2. If the call instruction acquired in step S1 is the call instruction indicated by the Mn line code, the code segment 21 initiating the call instruction, the called code segment 31 is obtained in step S2.
- Step S3 is performed, and the obtained code segment that initiates the calling instruction is The called code fragment establishes a node. 2 and FIG. 3, the node P11 is created by the code segment 11; then, the calling instruction indicated by the An line code calls the code segment 21, and the node P21 is established with the code segment 21; then, the calling instruction calling code represented by the Mn line code Fragment 31, node P31 is established with code segment 31; then, the call instruction indicated by Ln line code calls code segment 12, and node P12 is established with code segment 12; then, the call instruction indicated by Bn line code calls code segment 13 to code segment 13 Create node P13.
- step S4 a code segment initiating the calling instruction and a calling relationship between the called code fragments are established, and the established calling relationship is a calling path between the calling node and the called node.
- the code segment 11 (the initiator of the call instruction corresponding to the An line code) is the code target 21 (the call target of the call instruction corresponding to the An line code, the Mn line code).
- the calling relationship of the initiator of the corresponding calling instruction establishes the calling path T1 between the node of the code fragment 11 and the node of the code fragment 21, and establishes the node and the code fragment of the code fragment 21 by the calling relationship of the code fragment 21 to the code fragment 31.
- the calling path T2 between the nodes of 31, the calling path T3 between the node of the code fragment 31 and the node of the code fragment 12 is established by the calling relationship of the code fragment 31 to the code fragment 12, and the call of the code fragment 13 by the code fragment 12
- the relationship establishes a call path T4 between the node of the code fragment 13 and the node of the code fragment 13, so that a call path between all nodes from the root node to the current node can be established.
- a node is created by a code segment that initiates the call instruction, so that all nodes from the root node to the current node, the calling node and the called node can be established.
- the root node refers to the original initiator of the current node, that is, the source of the current node, that is, the root node passes through a series of call paths, Dry the nodes so that they can be migrated to the current node.
- the code segment 13 is taken as the current code segment, the call instruction indicated by the Cn line code of the code segment 13 is the current call instruction; the code segment 11 is the original initiator of the current call instruction, and the code segment is 11 is the root node, code fragment 13 is the current node, code fragment 21, code fragment 31, and code fragment 12 are nodes between the root node and the current node.
- node P11 is the root node, and node P13 is the current node.
- nodes, nodes P21, P31, and P12 are nodes between the root node and the current node.
- the method for establishing a data structure describing a computer code execution process is a dynamic process. Each time a call instruction is acquired, a code segment that initiates the call instruction and a called code segment are acquired, and then acquired. The code segment that initiates the calling instruction and the called code fragment establishes a node, and establishes a calling path between the calling node and the called node by a calling relationship between the code segment initiating the calling instruction and the called code segment. This creates a continuous data structure that describes the execution of computer code.
- the existing computer is a stack type, wherein the stack area is automatically allocated and released by the compiler, and the calling parameter of the calling instruction is stored, and the calling parameter includes the address of the next code fragment (ie, the called code fragment) called by the calling instruction,
- the operation method and operation content of a code segment is how to complete an operation
- the operation content is the corresponding object of operation
- the following code fragment is for deleting a file as an example
- the operation method is deletion
- the operation content is a file.
- the obtaining the code segment that initiates the calling instruction and the called code segment include: obtaining an address of the called code segment from the calling parameter, such as an address of the first line code of the called code segment, taking FIG. 2 as an example. If the called code fragment is code fragment 21, the address of the acquired code fragment obtained is the address of the M1 line code, that is, Is the address of the first line of code of code fragment 21; the called code fragment is retrieved based on the address of the called code fragment, and the code fragment in which the call instruction is located is the code fragment that initiated the call instruction.
- the present invention also provides a method for describing the running state of the computer, when a certain call instruction is executed, using all the nodes before the certain call instruction and
- the data structure consisting of the call path describes the running state of the computer when the call instruction is executed.
- a certain calling instruction is executed, a data structure composed of all nodes and calling paths before the certain calling instruction is acquired.
- the running state of the computer is no longer an isolated running state at the current time, but an associated running state containing the running information of the previous time period.
- the running state of the computer is the node P11 including the code segment 11
- the node P21 indicated by the code segment 21, the node P31 indicated by the code segment 31, the node P12 indicated by the code segment 12, and the call path T1 of the code segment 11 to the code segment 21 i.e., the call path T1 between the node P11 and the node P21
- the calling path T2 of the code segment 21 to the code segment 31 i.e., the calling path T2 between the node P21 and the node P31
- the calling path T3 of the code segment 31 to the code segment 12 i.e., the calling path T3 between the node P31 and the node P12
- the data structure as illustrated in the data structure shown in FIG.
- the code indicates the running state of the computer when the call instruction is executed. After knowing the running state of the computer, it is possible to evaluate the operating efficiency of the computer according to the running state of the computer, adjust the operating efficiency of the computer according to the evaluation result of the operating efficiency of the computer, thereby improving the operating efficiency of the computer; The operating state facilitates the evaluation of hardware and software.
- the present invention is based on a data structure established by the method described above, and also provides a method of describing a state transition of a computer, wherein the term migration refers to a transition of a computer from an operational state to a next operational state in the present invention.
- a method for describing a computer running state transition includes: Step S11: When a current calling instruction is executed, describe a current computer running state by using a data structure composed of all nodes and a calling path before the current calling instruction;
- Step S12 the code segment that is called by the current calling instruction is a new node, and the calling relationship between the code segment that initiates the current calling instruction and the called code segment established by the calling instruction is a new calling path, and the new node, the new node, The new calling path and the current computer running state all the nodes and the calling path constitute the data structure for the next computer running state;
- the process of establishing a new node and a new calling path is used to describe the migration of the current computer running state to the next computer running state, that is, the process of establishing a new node and a new calling path in step S2 is performed by the current The computer is running down to the migration state of a computer.
- step S11 is performed, and the current computer running state is described by a data structure composed of all nodes and calling paths before the current calling instruction. Specifically, when the current calling instruction is executed, a data structure composed of all nodes and calling paths before the current calling instruction is obtained, and the data structure is used to describe the running state of the current computer. This describes the current computer running state.
- the running state of the computer is no longer an isolated running state at the current time, but an associated running state containing the running information of the previous time period.
- Step S12 is executed, the code segment called by the current calling instruction is a new node, the calling relationship between the code segment initiated by the calling instruction and the called code segment initiated by the calling instruction is a new calling path, and the new node is The new call path and the current computer running state of all nodes, the call path constitutes the data structure for the next computer running state.
- the establishing a new node and the new calling path includes: acquiring a current calling instruction; acquiring a called code fragment of the current calling instruction; and using the called code fragment of the current calling instruction as a new node; Establishing a code segment that initiates the call instruction and a call relationship between the called code segments; establishing a new call path with the established call relationship.
- obtaining the current call instruction comprises: performing a binary translation of the machine code run by the computer to obtain the current call instruction.
- the acquiring the code segment of the current calling instruction includes: obtaining an address of the called code segment of the current calling instruction from the calling parameter, that is, an address of the first line code of the called code segment; based on the current calling instruction The address of the called code fragment gets the called code fragment of the currently called instruction.
- the current calling instruction is a calling instruction represented by the Bn line code
- the current computer running state is a node P11 including the code segment 11 and a node P21 represented by the code segment 21, and the code segment 31.
- the data structure of the call path T3 of the code segment 31 to the code segment 12 ie, the call path T3 between the node P31 and the node P12
- the structure is described as a data structure including nodes P11, P21, P31, P12 and the calling paths T1, ⁇ 2, ⁇ 3 between the respective nodes, and the data structure describes the running state of the current computer.
- the code segment 13 is the new node P13, and the code segment 12 created by the calling instruction indicated by the Bn line code establishes a new calling path T4 for the calling relationship of the code segment 13.
- the node P13, the calling path P14 and the nodes P11, P21, P31, P12 and the calling paths T1, ⁇ 2, ⁇ 3 between the respective nodes constitute the next computer operating state.
- the process of forming the new node P13 and the new calling path ⁇ 4 is the migration of the computer system from the current computer running state to the running state of the computer.
- the method for describing the running state of the computer of the present invention it is possible to know how the computer migrates from one running state to the next running state, and the operation of the computer It is a continuous process, so that based on the method of the present invention, on the basis of knowing the migration state of the computer, the operating efficiency of the computer can be evaluated, the operating efficiency of the computer can be adjusted, thereby improving the operating efficiency of the computer; and the operation of the computer can be monitored as a whole.
- the status is useful for evaluating hardware and software; and the code association analysis can be performed based on the established code fragment association.
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/CN2010/077309 WO2012037732A1 (zh) | 2010-09-26 | 2010-09-26 | 建立数据结构及描述计算机运行状态及其状态迁移的方法 |
CN201080067254.5A CN103080898B (zh) | 2010-09-26 | 2010-09-26 | 建立数据结构及描述计算机运行状态及其状态迁移的方法 |
US13/814,150 US9519569B2 (en) | 2010-09-26 | 2010-09-26 | Method for constructing data structures and method for describing running states of computer and state transitions thereof |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/CN2010/077309 WO2012037732A1 (zh) | 2010-09-26 | 2010-09-26 | 建立数据结构及描述计算机运行状态及其状态迁移的方法 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2012037732A1 true WO2012037732A1 (zh) | 2012-03-29 |
Family
ID=45873392
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2010/077309 WO2012037732A1 (zh) | 2010-09-26 | 2010-09-26 | 建立数据结构及描述计算机运行状态及其状态迁移的方法 |
Country Status (3)
Country | Link |
---|---|
US (1) | US9519569B2 (zh) |
CN (1) | CN103080898B (zh) |
WO (1) | WO2012037732A1 (zh) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2012145916A1 (zh) | 2011-04-29 | 2012-11-01 | 北京中天安泰信息科技有限公司 | 数据安全存储方法及装置 |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1859359A (zh) * | 2005-07-12 | 2006-11-08 | 上海华为技术有限公司 | 用抽象语法规则描述的通信协议的实现方法及其装置 |
CN101216803A (zh) * | 2008-01-09 | 2008-07-09 | 四川大学 | 基于基路径的测试程序控制流路径集生成方法 |
CN101655782A (zh) * | 2009-09-10 | 2010-02-24 | 浙江大学 | 基于基本块的汇编代码得出程序的数据流图的实现方法 |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6226787B1 (en) * | 1999-01-25 | 2001-05-01 | Hewlett-Packard Company | Visualization method and system for dynamically displaying operations of a program |
US7389497B1 (en) * | 2000-07-06 | 2008-06-17 | International Business Machines Corporation | Method and system for tracing profiling information using per thread metric variables with reused kernel threads |
US8108839B2 (en) * | 2006-11-30 | 2012-01-31 | International Business Machines Corporation | Method and apparatus for tracing execution of computer programming code using dynamic trace enablement |
US8336033B2 (en) * | 2007-03-30 | 2012-12-18 | Sap Ag | Method and system for generating a hierarchical tree representing stack traces |
US8418148B2 (en) * | 2009-02-27 | 2013-04-09 | Microsoft Corporation | Thread execution analyzer |
US20100115494A1 (en) * | 2008-11-03 | 2010-05-06 | Gorton Jr Richard C | System for dynamic program profiling |
US8359584B2 (en) * | 2009-12-18 | 2013-01-22 | Microsoft Corporation | Debugging from a call graph |
US8473928B2 (en) * | 2010-04-19 | 2013-06-25 | Sap Ag | Call graph simplification/comparison and automatic initial suspects finding of performance degradations |
-
2010
- 2010-09-26 WO PCT/CN2010/077309 patent/WO2012037732A1/zh active Application Filing
- 2010-09-26 US US13/814,150 patent/US9519569B2/en not_active Expired - Fee Related
- 2010-09-26 CN CN201080067254.5A patent/CN103080898B/zh not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1859359A (zh) * | 2005-07-12 | 2006-11-08 | 上海华为技术有限公司 | 用抽象语法规则描述的通信协议的实现方法及其装置 |
CN101216803A (zh) * | 2008-01-09 | 2008-07-09 | 四川大学 | 基于基路径的测试程序控制流路径集生成方法 |
CN101655782A (zh) * | 2009-09-10 | 2010-02-24 | 浙江大学 | 基于基本块的汇编代码得出程序的数据流图的实现方法 |
Also Published As
Publication number | Publication date |
---|---|
CN103080898A (zh) | 2013-05-01 |
US20130174162A1 (en) | 2013-07-04 |
CN103080898B (zh) | 2015-07-08 |
US9519569B2 (en) | 2016-12-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10911479B2 (en) | Real-time mitigations for unfamiliar threat scenarios | |
US8898775B2 (en) | Method and apparatus for detecting the malicious behavior of computer program | |
WO2019184164A1 (zh) | 自动部署Kubernetes从节点的方法、装置、终端设备及可读存储介质 | |
CN110784476A (zh) | 一种基于虚拟化动态部署的电力监控主动防御方法及系统 | |
WO2017041657A1 (zh) | 一种应用接口管理方法和装置 | |
US11368479B2 (en) | Methods and apparatus to identify and report cloud-based security vulnerabilities | |
KR20060042149A (ko) | 소프트웨어 취약성의 이용을 방지하기 위한 통신 필터링 방법 및 시스템 | |
CN110445669A (zh) | 一种基于协程的服务器的监控方法、设备及可读介质 | |
CN104219316A (zh) | 一种分布式系统中的调用请求处理方法及装置 | |
JP2004199330A (ja) | 情報処理装置、トレース処理方法、プログラム及び記録媒体 | |
US20200044911A1 (en) | Automatic generation of threat remediation steps by crowd sourcing security solutions | |
US9021008B1 (en) | Managing targeted scripts | |
CN109543457B (zh) | 管控智能合约之间调用的方法及装置 | |
CN112632527B (zh) | 一种用于服务开放平台的api测试方法及系统 | |
US9330266B2 (en) | Safe data storage method and device | |
CN107797859A (zh) | 一种定时任务的调度方法及一种调度服务器 | |
CN105765531A (zh) | 对程序二进制文件的通用拆包 | |
Yuan et al. | Automated mining of software component interactions for self-adaptation | |
WO2012037732A1 (zh) | 建立数据结构及描述计算机运行状态及其状态迁移的方法 | |
Kodavali et al. | Adaptation of Blockchain using Ethereum and IPFS for Fog based E-Healthcare activity recognition system | |
CN108874569A (zh) | 事件响应及文件生成的方法、装置及电子设备 | |
JP2005509318A5 (zh) | ||
KR20160066291A (ko) | 프로세스 행위 프로파일 생성 장치 및 방법 | |
CN110889112A (zh) | 一种基于白名单机制的软件运行统一控制系统及方法 | |
US11922161B2 (en) | Scheduling a pausable automated process in a computer network |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 201080067254.5 Country of ref document: CN |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 10857446 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 13814150 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 10857446 Country of ref document: EP Kind code of ref document: A1 |