CN108845799B - Visual program verification method and device and computer readable storage medium - Google Patents

Visual program verification method and device and computer readable storage medium Download PDF

Info

Publication number
CN108845799B
CN108845799B CN201810565685.2A CN201810565685A CN108845799B CN 108845799 B CN108845799 B CN 108845799B CN 201810565685 A CN201810565685 A CN 201810565685A CN 108845799 B CN108845799 B CN 108845799B
Authority
CN
China
Prior art keywords
information
node
preset
level
piece
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201810565685.2A
Other languages
Chinese (zh)
Other versions
CN108845799A (en
Inventor
陈宏君
孔祥平
吕鹏飞
李鹏
王德林
高磊
谭林丰
阮思烨
王业
文继锋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NR Electric Co Ltd
Electric Power Research Institute of State Grid Jiangsu Electric Power Co Ltd
Original Assignee
NR Electric Co Ltd
Electric Power Research Institute of State Grid Jiangsu Electric Power Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NR Electric Co Ltd, Electric Power Research Institute of State Grid Jiangsu Electric Power Co Ltd filed Critical NR Electric Co Ltd
Priority to CN201810565685.2A priority Critical patent/CN108845799B/en
Publication of CN108845799A publication Critical patent/CN108845799A/en
Application granted granted Critical
Publication of CN108845799B publication Critical patent/CN108845799B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/30—Creation or generation of source code
    • G06F8/34—Graphical or visual programming

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Debugging And Monitoring (AREA)
  • Stored Programmes (AREA)

Abstract

The embodiment of the invention provides a visual program checking method, which comprises the steps of reading a first visual program and a second visual program to be checked; generating a node information list according to at least one first level node in the first visualization program and at least one second level node in the second visualization program, wherein the node information list comprises: node hierarchy information in which at least one first-level node and at least one second-level node are arranged in a contrasting manner; and obtaining a characteristic checking information table according to at least one first-level node and at least one second-level node in the node information list. The embodiment of the invention also discloses a visual program checking device and a computer readable storage medium, which can check two visual programs in a hierarchical manner, thereby improving the checking efficiency and the checking accuracy of the visual programs.

Description

Visual program verification method and device and computer readable storage medium
Technical Field
The present invention relates to the field of visual programming, and in particular, to a visual program verification method, apparatus, and computer-readable storage medium.
Background
Due to the characteristics of intuition and visibility, the visual programming is widely applied to the development of embedded devices such as power systems and industrial control, however, the visual program has the requirement of modification and maintenance, but a checking and analyzing method for the visual program is lacked at present.
Disclosure of Invention
The invention mainly aims to provide a visual program checking method, a visual program checking device and a computer readable storage medium, which can check two visual programs in a hierarchical and multi-dimensional manner, so that the checking efficiency and the checking accuracy of the visual programs are improved.
The technical scheme of the invention is realized as follows:
in a first aspect, an embodiment of the present invention provides a visual program verification method, where the method includes:
reading a first visualization program and a second visualization program to be verified;
generating a node information list according to at least one first level node in the first visualization program and at least one second level node in the second visualization program, wherein the node information list comprises: node hierarchy information of the at least one first hierarchical node and the at least one second hierarchical node in a contrasting arrangement;
and obtaining a characteristic check information table according to the at least one first level node and the at least one second level node in the node information list.
In the foregoing solution, the generating a node information list according to at least one first level node in the first visualization program and at least one second level node in the second visualization program includes:
extracting first node name information of the at least one first hierarchy node and second node name information of the at least one second hierarchy node;
and comparing and arranging the at least one first node name information and the at least one second node name information to obtain a node information list.
In the above solution, the obtaining a feature verification information table according to the at least one first-level node and the at least one second-level node in the node information list includes:
extracting at least one piece of first variable information in a preset first level node and at least one piece of second variable information in a preset second level node;
generating a classification information list according to the at least one first variable information and the at least one second variable information, wherein the classification information list comprises: the at least one first variable information and the at least one second variable information are classified and contrasted to arrange variable information;
and connecting and arranging at least one first variable information which belongs to the same category and has the same name in the classified information list, connecting and arranging at least one second variable information which belongs to the same category and has the same name in the classified information list, wherein the connected and arranged classified information list is the characteristic check information list.
In the above solution, the obtaining a feature verification information table according to the at least one first-level node and the at least one second-level node in the node information list includes:
respectively reading at least one first node index file in a preset first level node and at least one second node index file in a preset second level node;
generating a feature verification information table according to the at least one first node index file and the at least one second node index file, wherein the feature verification information table comprises: and the node storage sequence information in the at least one first node index file and the node storage sequence information in the at least one second node index file are compared with the arranged node storage sequence information.
In the above solution, the obtaining a feature verification information table according to the at least one first-level node and the at least one second-level node in the node information list includes:
reading at least one piece of first task chain symbolic information in a preset first level node and at least one piece of second task chain symbolic information in a preset second level node respectively;
generating a feature check information table according to the at least one first task chain symbol information and the at least one second task chain symbol information, wherein the feature check information table comprises: and the node execution sequence information in the at least one first task chain symbol information and the node execution sequence information in the at least one second task chain symbol information are compared with the arranged node execution sequence information.
In the above solution, the obtaining a feature verification information table according to the at least one first-level node and the at least one second-level node in the node information list includes:
reading at least one piece of first symbol information and at least one piece of first connection information in a preset first level node, and reading at least one piece of second symbol information and at least one piece of second connection information in a preset second level node;
generating a first directed acyclic network according to the at least one first symbol information and the at least one first connection information, and generating a second directed acyclic network according to the at least one second symbol information and the at least one second connection information;
generating a feature check information table according to the first directed acyclic network and the second directed acyclic network, wherein the feature check information table comprises: the symbol execution order information in the first directed acyclic network and the symbol execution order information in the second directed acyclic network are compared with arranged symbol execution order information.
In the above solution, the obtaining a feature verification information table according to the at least one first-level node and the at least one second-level node in the node information list includes:
reading at least one piece of first node attribute information and at least one piece of first node code information in a preset first level node, and reading at least one piece of second node attribute information and at least one piece of second node code information in a preset second level node;
generating a feature check information table according to the at least one first node attribute information, the at least one first node code information, the at least one second node attribute information, and the at least one second node code information, wherein the feature check information table comprises: the at least one first node attribute information and the at least one second node attribute information compare arranged node attribute information, and the at least one first node code information and the at least one second node code information compare arranged node code information.
In a second aspect, an embodiment of the present invention provides a visual program verification apparatus, where the apparatus includes: a processor and a memory for storing a computer program capable of running on the processor; wherein the content of the first and second substances,
the processor is configured to, when running the computer program, execute:
reading a first visualization program and a second visualization program to be verified;
generating a node information list according to at least one first level node in the first visualization program and at least one second level node in the second visualization program, wherein the node information list comprises: node hierarchy information of the at least one first hierarchical node and the at least one second hierarchical node in a contrasting arrangement;
and obtaining a characteristic check information table according to the at least one first level node and the at least one second level node in the node information list.
In the foregoing solution, the processor, when executing the computer program, is configured to execute:
extracting first node name information of the at least one first hierarchy node and second node name information of the at least one second hierarchy node;
and comparing and arranging the at least one first node name information and the at least one second node name information to obtain a node information list.
In the foregoing solution, the processor, when executing the computer program, is configured to execute:
extracting at least one piece of first variable information in a preset first level node and at least one piece of second variable information in a preset second level node;
generating a classification information list according to the at least one first variable information and the at least one second variable information, wherein the classification information list comprises: the at least one first variable information and the at least one second variable information are classified and contrasted to arrange variable information;
and connecting and arranging at least one first variable information which belongs to the same category and has the same name in the classified information list, connecting and arranging at least one second variable information which belongs to the same category and has the same name in the classified information list, wherein the connected and arranged classified information list is the characteristic check information list.
In the foregoing solution, the processor, when executing the computer program, is configured to execute:
respectively reading at least one first node index file in a preset first level node and at least one second node index file in a preset second level node;
generating a feature verification information table according to the at least one first node index file and the at least one second node index file, wherein the feature verification information table comprises: and the node storage sequence information in the at least one first node index file and the node storage sequence information in the at least one second node index file are compared with the arranged node storage sequence information.
In the foregoing solution, the processor, when executing the computer program, is configured to execute:
reading at least one piece of first task chain symbolic information in a preset first level node and at least one piece of second task chain symbolic information in a preset second level node respectively;
generating a feature check information table according to the at least one first task chain symbol information and the at least one second task chain symbol information, wherein the feature check information table comprises: and the node execution sequence information in the at least one first task chain symbol information and the node execution sequence information in the at least one second task chain symbol information are compared with the arranged node execution sequence information.
In the foregoing solution, the processor, when executing the computer program, is configured to execute:
reading at least one piece of first symbol information and at least one piece of first connection information in a preset first level node, and reading at least one piece of second symbol information and at least one piece of second connection information in a preset second level node;
generating a first directed acyclic network according to the at least one first symbol information and the at least one first connection information, and generating a second directed acyclic network according to the at least one second symbol information and the at least one second connection information;
generating a feature check information table according to the first directed acyclic network and the second directed acyclic network, wherein the feature check information table comprises: the symbol execution order information in the first directed acyclic network and the symbol execution order information in the second directed acyclic network are compared with arranged symbol execution order information.
In the foregoing solution, the processor, when executing the computer program, is configured to execute:
reading at least one piece of first node attribute information and at least one piece of first node code information in a preset first level node, and reading at least one piece of second node attribute information and at least one piece of second node code information in a preset second level node;
generating a feature check information table according to the at least one first node attribute information, the at least one first node code information, the at least one second node attribute information, and the at least one second node code information, wherein the feature check information table comprises: the at least one first node attribute information and the at least one second node attribute information compare arranged node attribute information, and the at least one first node code information and the at least one second node code information compare arranged node code information.
In a third aspect, embodiments of the present invention provide a computer readable storage medium storing one or more programs, which are executable by one or more processors to implement a method as described in any above.
The visual program verification method, the visual program verification device and the computer readable storage medium provided by the embodiment of the invention read a first visual program and a second visual program to be verified; generating a node information list according to at least one first level node in the first visualization program and at least one second level node in the second visualization program, wherein the node information list comprises: node hierarchy information in which at least one first-level node and at least one second-level node are arranged in a contrasting manner; and obtaining a characteristic checking information table according to at least one first-level node and at least one second-level node in the node information list. The visual program verification method, the visual program verification device and the computer-readable storage medium provided by the embodiment of the invention can respectively compare and arrange the hierarchical nodes in the two visual programs to be verified, perform characteristic verification on the hierarchical nodes after comparison and arrangement, and finally obtain the characteristic verification information table, so that the two visual programs can be verified hierarchically, and verification speed and verification accuracy are provided.
Drawings
Fig. 1 is a first schematic flow chart illustrating an implementation process of a visual program verification method according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a node information list according to an embodiment of the present invention;
fig. 3 is a schematic flow chart illustrating an implementation process of a visual program verification method according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating a feature check information representation according to an embodiment of the present invention;
fig. 5 is a diagram illustrating feature check information according to an embodiment of the present invention;
fig. 6 is a schematic diagram of a task scheduling page according to an embodiment of the present invention;
fig. 7 is a schematic diagram of a directed acyclic network according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of a visual program verifying apparatus according to an embodiment of the present invention.
Detailed Description
The technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.
Fig. 1 is a schematic flow chart of an implementation of a visual program verification method according to an embodiment of the present invention, as shown in fig. 1, in an embodiment of the present invention, the visual program verification method includes the following steps:
s101, reading a first visualization program and a second visualization program to be verified.
The first visualization program may be a visualization program modified by a manufacturer for a specific business requirement, and the second visualization program may be a visualization program modified by a field technical support staff for the specific business requirement.
The execution subject of the embodiment of the invention is a visual program verification device, that is, the visual program verification device reads a first visual program and a second visual program to be verified, and the visual program verification device can be specifically installed on a computer.
Specifically, the user operates and selects the first visualization program and the second visualization program to be verified on the computer, and the computer receives a selection instruction of the user and reads the first visualization program and the second visualization program to be verified.
S102, a node information list is generated according to at least one first level node in the first visualization program and at least one second level node in the second visualization program.
Here, the first visualization program and the second visualization program each employ a hierarchical organization, and further, the first visualization program and the second visualization program each employ a 5-level organization of devices, plug-ins, processors, elements, and pages, since the first visualization program and the second visualization program have the same structure, the above-mentioned 5-layer organization structure is described in detail by taking the first visualization program as an example, and the first visualization program may specifically include 1 device, the apparatus may specifically include 32 plug-ins, each plug-in may specifically include 8 processors, each processor may specifically include N elements, each element having a memory that may include M pages, wherein N is generally determined according to the actual number of functions required by the specific service, and M is generally specified by a user, which is not specifically limited herein in the embodiment of the present invention.
It should be noted that, for the first visualization program, all the devices, plug-ins, processors, elements, and pages in the hierarchical organization structure may be referred to as first hierarchical nodes, that is, the first visualization program includes at least one first hierarchical node; similarly, for the second visualization program, the devices, plug-ins, processors, elements, and pages in the hierarchical organization structure may all be referred to as second hierarchy nodes, that is, the second visualization program includes at least one second hierarchy node.
Specifically, after the visual program verifying device reads the first visual program and the second visual program to be verified, the visual program verifying device may automatically compare and arrange at least one first hierarchical node in the first visual program and at least one second hierarchical node in the second visual program to generate a node information list, which may also be understood as that the visual program verifying device generates a node information list according to at least one first hierarchical node in the first visual program and at least one second hierarchical node in the second visual program, where the node information list includes: and the at least one first-level node and the at least one second-level node are compared to form node hierarchy information.
Wherein generating a node information list according to at least one first level node in a first visualization program and at least one second level node in a second visualization program comprises:
extracting first node name information of at least one first-level node and second node name information of at least one second-level node;
and comparing and arranging the at least one first node name information and the at least one second node name information to obtain a node information list.
Here, each first-level node has node name information, which is referred to as first node name information, and likewise, each second-level node has node name information, for distinguishing from the first node name information, it is called the second node name information, and the first node name information is taken as an example for explanation, the first node name information may be a project name if the first level node is a device, a slot number where a plug-in is located if the first level node is a plug-in, if the first level node is a processor, the first node name information may be a number of the processor, if the first level node is an element, the first node name information may be the structure name plus instance name of the element, if the first level node is a page, the first node name information may be a page name of the page.
Exemplarily, as shown in fig. 2, after reading the first visualization program and the second visualization program, comparing and arranging the first node name information and the second node name information to obtain a node information list, where the left side of the node information list is node hierarchy information of the first visualization program, and the method includes: the device comprises the following steps: PCP1, wherein the device: PCP1 includes: plug-in components: BO1, insert: BO2, insert: BO3, wherein the insert: BO1 includes: a processor: main1, processor: main2, wherein the processor: main1 includes: element (b): MSQAPP: MSQ1, element: SOLAPP: SOL1, element: TCCAPP: TCC1, wherein the elements: TCCAPP: the TCC1 includes: page: tasskschedule _ TCC, page: COMM _ IN, page, COMM _ OUT, page: TCC _ VOLT, wherein tasskschedule _ TCC is a task schedule page; the right side of the node information list is node hierarchy information of a second visualization program, and the node hierarchy information comprises the following information: the device comprises the following steps: PCP1, wherein the device: PCP1 includes: plug-in components: BO1, insert: BO2, wherein the insert: BO1 includes: a processor: main1, processor: main2, wherein the processor: main1 includes: element (b): SOLAPP: SOL1, element: MSQAPP: MSQ1, element: TCCAPP: TCC1, wherein the elements: TCCAPP: the TCC1 includes: page: tasskschedule _ TCC, page: COMM _ IN, page, COMM _ OUT, where taskchedule _ TCC is the task schedule page.
S103, obtaining a characteristic checking information table according to at least one first-level node and at least one second-level node in the node information list.
Specifically, after the node information list is obtained, the visual program verification device obtains the feature verification information table according to at least one first-level node and at least one second-level node in the node information list, so that a user can conveniently judge whether the first visual program and the second visual program are modified consistently by using the feature verification information table.
The visual program verification method provided by the embodiment of the invention reads a first visual program and a second visual program to be verified; generating a node information list according to at least one first level node in the first visualization program and at least one second level node in the second visualization program, wherein the node information list comprises: node hierarchy information in which at least one first-level node and at least one second-level node are arranged in a contrasting manner; and obtaining a characteristic verification information table according to at least one first-level node and at least one second-level node in the node information list, so that two visual programs can be verified hierarchically, and verification speed and verification accuracy are provided.
Fig. 3 is a schematic view of an implementation flow of a visual program verification method according to an embodiment of the present invention, which is applied to a power system, and as shown in fig. 3, in an embodiment of the present invention, the visual program verification method includes the following steps:
s301, reading a first visualization program and a second visualization program to be verified.
The execution main body of the embodiment of the present invention may be a Visual program verification device, that is, the Visual program verification device reads a first Visual program and a second Visual program to be verified, and the Visual program verification device may be a Visual integrated programming debugging Tool (VICT) for the power system, at this time, the execution main body of the Visual program verification method may be the VICT, that is, the user operates on the VICT to implement the Visual program verification.
Specifically, the user operates the VICT to select the first visualization program and the second visualization program to be verified, the VICT receives a selection instruction of the user and reads the first visualization program and the second visualization program to be verified, or the VICT reads the first visualization program and the second visualization program selected by the user.
Here, there is no precedence order between reading the first visualization program and reading the second visualization program, which may be reading the first visualization program first, then reading the second visualization program, or reading the second visualization program first, then reading the first visualization program, or reading the first visualization program and the second visualization program at the same time.
S302, extracting first node name information of at least one first level node and second node name information of at least one second level node.
Specifically, the first visualization program and the second visualization program may each be based on a 5-layer index structure of the device, the plug-in, the processor, the element, and the page, or may refer to the device, the plug-in, the processor, the element, and the page as a first level node in the first visualization program and refer to the device, the plug-in, the processor, the element, and the page as a second level node in the second visualization program, that is, the first visualization program includes at least one first level node, and the second visualization program includes at least one second level node.
Here, each first hierarchy node has node name information, referred to as first node name information, and similarly, each second hierarchy node has node name information, referred to as second node name information, for distinguishing from the first node name information.
Specifically, after the VICT tool reads the first visualization program and the second visualization program to be verified, the VICT tool automatically extracts first node name information of at least one first-level node and second node name information of at least one second-level node.
S303, comparing and arranging the at least one first node name information and the at least one second node name information to obtain a node information list.
Specifically, after the VICT tool extracts first node name information of at least one first-level node and second node name information of at least one second-level node, the VICT tool automatically compares and arranges the at least one first node name information and the at least one second node name information to obtain a node information list, and displays the node information list on a VICT tool interface.
S304, obtaining a characteristic checking information table according to at least one first-level node and at least one second-level node in the node information list.
Specifically, after the VICT tool compares and arranges at least one first node name information and at least one second node name information to obtain a node information list, a feature verification information table is obtained according to at least one first-level node and at least one second-level node in the node information list, so that a user can conveniently judge whether the first visualization program and the second visualization program are modified consistently by using the feature verification information table.
Optionally, obtaining the feature verification information table according to at least one first-level node and at least one second-level node in the node information list may include:
extracting at least one piece of first variable information in a preset first level node and at least one piece of second variable information in a preset second level node;
generating a classification information list according to the at least one first variable information and the at least one second variable information, wherein the classification information list comprises: the variable information is arranged by classifying and comparing at least one first variable information with at least one second variable information;
and connecting and arranging at least one first variable information which belongs to the same category and has the same name in the classified information list, connecting and arranging at least one second variable information which belongs to the same category and has the same name in the classified information list, wherein the connected and arranged classified information list is a characteristic check information list.
Here, the preset first level node may be one or more first level nodes in the node information list, and preferably, the preset first level node is a page, that is, the preset first level node is one or more pages; the second level node is preset as one or more second level nodes in the node information list, and preferably, the second level node is preset as a page, that is, the second level node is preset as one or more pages.
It should be noted that, each page includes: inputting variable information, outputting variable information, function information and connecting line information; the function information is function information with input and output points, the input variable information can be connected to the input point of the function to indicate that the input of the function is from one output variable information of other pages, and the output point of the function can be connected to the output variable information to indicate that the output of the function can be used by other pages; the connecting line is used for connecting input variable information and output variable information; the input variable information represents variable information of other pages referred by the current page, the output variable information represents variable information that the current page can be referred by other pages, the input variable information and the output variable information are collectively referred to as variable information, and the page comprises at least one piece of variable information.
Here, in order to distinguish the variable information in the preset first level node from the variable information in the preset second level node, it is defined that the variable information in the preset first level node is first variable information, and the variable information in the preset second level node is second variable information, that is, the preset first level node includes at least one first variable information, and the preset second level node includes at least one second variable information.
It should be noted that, in general, a user may directly set variable names and variable use ranges of input variable information and output variable information in an editing interface of the VICT tool when writing a visualization program, and when the variable names of the input variable information and the variable names of the output variable information are the same and the variable use ranges of the input variable information and the output variable information are the same, it indicates that the input variable information and the output variable information form a pair of input-input variable connections.
Wherein, the variable use range information may include: cross plug-ins, cross elements, and cross pages.
Specifically, after the VICT tool compares and arranges at least one first node name information and at least one second node name information to obtain a node information list, the VICT tool extracts at least one first variable information preset in a first level node and at least one second variable information preset in a second level node; classifying at least one first variable information according to the variable use range information, classifying at least one second variable information according to the variable use range information, and comparing and arranging the classified at least one first variable information and the classified at least one second variable information to obtain a classification information list; and finally, at least one first variable information which belongs to the same category and has the same variable name in the classified information list is connected and arranged, at least one second variable information which belongs to the same category and has the same variable name in the classified information list is connected and arranged, and the connected and arranged classified information list is a characteristic check information list.
Illustratively, as shown in fig. 4, since the variable usage range information can be three types, namely, cross-plug, cross-element, and cross-page, three different categories are finally obtained, which are exemplified by b01.msq1.dig _ FR1- > b02.tcc1.dig _ FR1, and b01.msq1.dig _ FR1 and b02.tcc1.dig _ FR1 are variable information of two cross-plugs, and the variable names of both are FR1, so that b01.msq1.dig _ FR1 and b02.tcc1.dig _ FR1 are connected to obtain b01.msq1.dig _ FR1- > b02.tcc1.dig _ FR 1.
Optionally, obtaining the feature verification information table according to at least one first-level node and at least one second-level node in the node information list, which may further include:
respectively reading at least one first node index file in a preset first level node and at least one second node index file in a preset second level node;
generating a characteristic check information table according to the at least one first node index file and the at least one second node index file, wherein the characteristic check information table comprises: and comparing the node storage sequence information in the at least one first node index file with the node storage sequence information in the at least one second node index file to obtain the arranged node storage sequence information.
Here, the first level node is preset as one or more first level nodes in the node information list, and preferably, the first level node is preset as a processor, that is, the first level node is preset as one or more processors; the second-level node is preset as one or more second-level nodes in the node information list, and preferably, the second-level node is preset as a processor, that is, the second-level node is preset as one or more processors.
It should be noted that, a processor index file is provided in each processor, and the storage sequence of elements included in the processor is recorded in the processor index file and stored according to the execution sequence, so that the storage sequence of the elements can be used as the execution sequence of the elements, and in order to distinguish a processor index file in a preset first level node from a processor index file in a preset second level node, it is defined that the processor index file in the preset first level node is a first node index file, and the processor index file in the preset second level node is a second node index file, that is, the preset first level node includes at least one first node index file, and the preset second level node includes at least one second node index file.
Here, the processor index file generally adopts an xml format, and in this case, the first node index file may be represented as:
<？xml version＝"1.0"encoding＝"UTF-8"？>
<Main1>
<App Name＝"MSQAPP"Path＝"MSQAPP/MSQAPP.dcfx"Inst＝"MSQ1"/>
<App Name＝"SOLAPP"Path＝"SOLAPP/SOLAPP.dcfx"Inst＝"SOL1"/>
<App Name＝"TCCAPP"Path＝"TCCAPP/TCCAPP.dcfx"Inst＝"TCC1"/>
</Main1>
the second node index file may be represented as: :
<？xml version＝"1.0"encoding＝"UTF-8"？>
<Main1>
<App Name＝"SOLAPP"Path＝"SOLAPP/SOLAPP.dcfx"Inst＝"SOL1"/>
<App Name＝"MSQAPP"Path＝"MSQAPP/MSQAPP.dcfx"Inst＝"MSQ1"/>
<App Name＝"TCCAPP"Path＝"TCCAPP/TCCAPP.dcfx"Inst＝"TCC1"/>
</Main1>
specifically, after the VICT tool compares and arranges at least one first node name information and at least one second node name information to obtain a node information list, the VICT tool reads at least one first node index file in a preset first level node and at least one second node index file in a preset second level node respectively; then extracting node storage sequence information from at least one first node index file and extracting node storage sequence information from at least one second node index file; and finally, comparing and arranging the node storage sequence information in the at least one first node index file and the node storage sequence information in the at least one second node index file to generate a characteristic check information table.
Illustratively, as shown in fig. 5, the execution sequence of the elements in the first visualization program in the feature verification information table is as follows: MSQAPP: MSQ1, SOLAPP: SOL1, TCCAPP: TCC1, the execution order of the elements in the second visualization procedure is: SOLAPP: SOL1, MSQAPP: MSQ1, TCCAPP: TCC1, so it can be seen that the execution order of the two is not the same.
Optionally, obtaining the feature verification information table according to at least one first-level node and at least one second-level node in the node information list, which may further include:
reading at least one piece of first task chain symbolic information in a preset first level node and at least one piece of second task chain symbolic information in a preset second level node respectively;
generating a characteristic check information table according to at least one first task chain symbol information and at least one second task chain symbol information, wherein the characteristic check information table comprises: and comparing the node execution sequence information in the at least one first task chain symbol information with the node execution sequence information in the at least one second task chain symbol information.
Here, the first level node is preset as one or more first level nodes in the node information list, and preferably, the first level node is preset as an element, that is, the first level node is preset as one or more elements; the second level node is preset as one or more second level nodes in the node information list, and preferably, the second level node is preset as an element, that is, the first level node is preset as one or more elements.
It should be noted that each element may set a task scheduling page, set a task chain symbol information in the task scheduling page, fill page names in the task chain symbol information, configure a page execution sequence, and define that the task chain symbol information in the preset first level node is a first task chain symbol information and the task chain symbol information in the preset second level node is a second task chain symbol information in order to distinguish the task chain symbol information in the preset first level node from the task chain symbol information in the preset second level node, that is, the preset first level node includes at least one first task chain symbol information, and the preset second level node includes at least one second task chain symbol information.
Illustratively, as shown in fig. 6, a task chain is set in the task scheduling page, and the task chain includes eight LEVELs, LEVEL1 to LEVEL8, taking LEVEL1 as an example, the page names in LEVEL1 are respectively: MC1_ INPUTS, MC2_ INPUTS, COMMBSQ, COMMENABL, COMMCUST, DSPA4_1, COMMLOWAC, SSQSTM, State in LEVEL1 is page State, and all are ACTIVE State.
Specifically, after the VICT tool compares and arranges at least one first node name information and at least one second node name information to obtain a node information list, the VICT tool reads at least one first task chain symbol information in a preset first level node and at least one second task chain symbol information in a preset second level node respectively; then extracting node execution sequence information from at least one first task chain symbol information, and extracting node execution sequence information from at least one second task chain symbol information; and finally, comparing and arranging the node execution sequence information in the at least one first task chain symbol information with the node execution sequence information in the at least one second task chain symbol information to generate a characteristic check information table.
Illustratively, as shown in fig. 5, the execution order of the pages in Level2 set by element MSQ1 in the first visualization program in the feature verification information table is as follows: MC1_ INPUT, MC2_ INPUT, COMMBSQ, COMMCUST, etc., and the execution order of pages in Level2 set by element MSQ1 in the second visualization program is: MC1_ INPUT, COMMCUST, COMMBSQ, MC2_ INPUT, etc., so that it can be seen that the execution order of the two is not the same.
Optionally, obtaining the feature verification information table according to at least one first-level node and at least one second-level node in the node information list, which may further include:
reading at least one piece of first symbol information and at least one piece of first connection information in a preset first level node, and reading at least one piece of second symbol information and at least one piece of second connection information in a preset second level node;
generating a first directed acyclic network according to the at least one first symbol information and the at least one first connection information, and generating a second directed acyclic network according to the at least one second symbol information and the at least one second connection information;
generating a feature check information table according to the first directed acyclic network and the second directed acyclic network, wherein the feature check information table comprises: the symbol execution order information in the first directed acyclic network and the symbol execution order information in the second directed acyclic network are compared with the arranged symbol execution order information.
Here, the first level node is preset as one or more first level nodes in the node information list, and preferably, the first level node is preset as a page, that is, the first level node is preset as one or more pages; the second level node is preset as one or more second level nodes in the node information list, and preferably, the second level node is preset as a page, that is, the second level node is preset as one or more pages.
It should be noted that each page is composed of symbol information and connection information, where the symbol information specifically may include: in order to distinguish symbol information and connection information in a preset first level node from symbol information and connection information in a preset second level node, the symbol information and the connection information in the preset first level node are defined as first symbol information, the connection information in the preset first level node is first connection information, the symbol information in the preset second level node is second symbol information, and the connection information in the preset second level node is second connection information.
Specifically, after the VICT tool compares and arranges at least one first node name information and at least one second node name information to obtain a node information list, the VICT tool reads at least one first symbol information and at least one first connection information in a preset first level node, and reads at least one second symbol information and at least one second connection information in a preset second level node; then traversing at least one first symbol information and at least one first connection information to obtain a first directed acyclic network, and traversing at least one second symbol information and at least one second connection information to obtain a second directed acyclic network; next, extracting symbol execution sequence information from the first directed acyclic network and extracting symbol execution sequence information from the second directed acyclic network; and finally, comparing and arranging the symbol execution sequence information in the first directed acyclic network and the symbol execution sequence information in the second directed acyclic network to generate a characteristic check information table.
The traversing at least one piece of first symbol information and at least one piece of first connection information to obtain a first directed acyclic network may specifically include: traversing at least one first symbol information and at least one first connection information by adopting a depth-first traversal algorithm to obtain a first directed acyclic network; here, the depth-first traversal algorithm is the prior art, and the embodiment of the present invention is not described herein again; fig. 7 shows the obtained first directed acyclic network, where in fig. 7, the input variable information is: var1, Var2, Var3 and Var4, and the functional function information is as follows: AND2, OR2, SR, the output variable information is: var 5.
Here, the manner of obtaining the second directed acyclic network is the same as the manner of obtaining the first directed acyclic network, and details of the embodiment of the present invention are not described herein.
Illustratively, as shown in fig. 5, the execution order of the symbols in the page1 in the first visualization program in the feature verification information table is: AND2, OR2 AND SR, AND the execution sequence of the symbols in the page1 in the second visualization program is: OR2, AND2, AND SR, it can be seen that the execution order of the two is not the same.
Optionally, obtaining the feature verification information table according to at least one first-level node and at least one second-level node in the node information list, which may further include:
reading at least one piece of first node attribute information and at least one piece of first node code information in a preset first level node, and reading at least one piece of second node attribute information and at least one piece of second node code information in a preset second level node;
generating a feature check information table according to the at least one first node attribute information, the at least one first node code information, the at least one second node attribute information and the at least one second node code information, wherein the feature check information table comprises: the at least one first node attribute information and the at least one second node attribute information are compared with the arranged node attribute information, and the at least one first node code information and the at least one second node code information are compared with the arranged node code information.
Here, the first level node is preset as one or more first level nodes in the node information list, and preferably, the first level node is preset as a page, that is, the first level node is preset as one or more pages; the second level node is preset as one or more second level nodes in the node information list, and preferably, the second level node is preset as a page, that is, the first level node is preset as one or more pages.
It should be noted that, page attribute information and page code information are set in each page, where the page attribute information may include: information such as page type, page modifier, version, page description and the like; the page code information may include: the variable statement code, page initialization code, page task code and other information of the page; in order to distinguish the page attribute information and the page code information in the preset first level node from the page attribute information and the page code information in the preset second level node, the page attribute information in the preset first level node is defined as first page attribute information, the page code information in the preset first level node is defined as first page code information, the page attribute information in the preset second level node is defined as second page attribute information, and the page code information in the preset second level node is defined as second page code information.
Specifically, after the VICT tool compares and arranges at least one first node name information and at least one second node name information to obtain a node information list, the VICT tool reads at least one first symbol information and at least one first connection information in a preset first level node, and reads at least one second symbol information and at least one second connection information in a preset second level node; and then comparing and arranging at least one first node attribute information and at least one second node attribute information, and comparing and arranging at least one first node code information and at least one second node code information to generate a characteristic check information table.
Comparing the at least one first node attribute information with the at least one second node attribute information may specifically include: comparing at least one first node attribute information with at least one second node attribute information by adopting a longest subsequence character string comparison algorithm; here, the longest subsequence string comparison algorithm is the prior art, and the embodiment of the present invention is not described herein again.
Here, a manner of comparing the at least one first node code information with the at least one second node code information is the same as a manner of comparing the at least one first node attribute information with the at least one second node attribute information, and details of the embodiment of the present invention are not repeated herein.
The visual program verification method provided by the embodiment of the invention reads a first visual program and a second visual program to be verified; generating a node information list according to at least one first level node in the first visualization program and at least one second level node in the second visualization program, wherein the node information list comprises: node hierarchy information in which at least one first-level node and at least one second-level node are arranged in a contrasting manner;
and obtaining a characteristic verification information table according to at least one first-level node and at least one second-level node in the node information list, so that two visual programs can be verified hierarchically and multi-dimensionally, and verification speed and verification accuracy are provided.
An embodiment of the present invention further provides a visual program verifying apparatus 80, as shown in fig. 8, where the warning root cause positioning apparatus 80 at least includes: a processor 81 and a memory 82 for storing computer programs capable of running on the processor, wherein,
the processor 81 is configured to, when running the computer program, execute:
reading a first visualization program and a second visualization program to be verified;
generating a node information list according to at least one first level node in the first visualization program and at least one second level node in the second visualization program, wherein the node information list comprises: node hierarchy information of the at least one first hierarchical node and the at least one second hierarchical node in a contrasting arrangement;
and obtaining a characteristic check information table according to the at least one first level node and the at least one second level node in the node information list.
In this embodiment of the present invention, further, the processor 81 is configured to, when running the computer program, perform:
extracting first node name information of the at least one first hierarchy node and second node name information of the at least one second hierarchy node;
and comparing and arranging the at least one first node name information and the at least one second node name information to obtain a node information list.
In this embodiment of the present invention, further, the processor 81 is configured to, when running the computer program, perform:
extracting at least one piece of first variable information in a preset first level node and at least one piece of second variable information in a preset second level node;
generating a classification information list according to the at least one first variable information and the at least one second variable information, wherein the classification information list comprises: the at least one first variable information and the at least one second variable information are classified and contrasted to arrange variable information;
and connecting and arranging at least one first variable information which belongs to the same category and has the same name in the classified information list, connecting and arranging at least one second variable information which belongs to the same category and has the same name in the classified information list, wherein the connected and arranged classified information list is the characteristic check information list.
In this embodiment of the present invention, further, the processor 81 is configured to, when running the computer program, perform:
respectively reading at least one first node index file in a preset first level node and at least one second node index file in a preset second level node;
generating a feature verification information table according to the at least one first node index file and the at least one second node index file, wherein the feature verification information table comprises: and the node storage sequence information in the at least one first node index file and the node storage sequence information in the at least one second node index file are compared with the arranged node storage sequence information.
In this embodiment of the present invention, further, the processor 81 is configured to, when running the computer program, perform:
reading at least one piece of first task chain symbolic information in a preset first level node and at least one piece of second task chain symbolic information in a preset second level node respectively;
generating a feature check information table according to the at least one first task chain symbol information and the at least one second task chain symbol information, wherein the feature check information table comprises: and the node execution sequence information in the at least one first task chain symbol information and the node execution sequence information in the at least one second task chain symbol information are compared with the arranged node execution sequence information.
In this embodiment of the present invention, further, the processor 81 is configured to, when running the computer program, perform:
reading at least one piece of first symbol information and at least one piece of first connection information in a preset first level node, and reading at least one piece of second symbol information and at least one piece of second connection information in a preset second level node;
generating a first directed acyclic network according to the at least one first symbol information and the at least one first connection information, and generating a second directed acyclic network according to the at least one second symbol information and the at least one second connection information;
generating a feature check information table according to the first directed acyclic network and the second directed acyclic network, wherein the feature check information table comprises: the symbol execution order information in the first directed acyclic network and the symbol execution order information in the second directed acyclic network are compared with arranged symbol execution order information.
In this embodiment of the present invention, further, the processor 81 is configured to, when running the computer program, perform:
reading at least one piece of first node attribute information and at least one piece of first node code information in a preset first level node, and reading at least one piece of second node attribute information and at least one piece of second node code information in a preset second level node;
generating a feature check information table according to the at least one first node attribute information, the at least one first node code information, the at least one second node attribute information, and the at least one second node code information, wherein the feature check information table comprises: the at least one first node attribute information and the at least one second node attribute information compare arranged node attribute information, and the at least one first node code information and the at least one second node code information compare arranged node code information.
An embodiment of the present invention provides a computer-readable storage medium storing one or more programs, the one or more programs being executable by one or more processors to implement the steps of:
reading a first visualization program and a second visualization program to be verified;
generating a node information list according to at least one first level node in the first visualization program and at least one second level node in the second visualization program, wherein the node information list comprises: node hierarchy information of the at least one first hierarchical node and the at least one second hierarchical node in a contrasting arrangement;
and obtaining a characteristic check information table according to the at least one first level node and the at least one second level node in the node information list.
The above description of the computer-readable storage medium embodiments, similar to the above description of the method, has the same beneficial effects as the method embodiments. For technical details not disclosed in the embodiments of the computer-readable storage medium of the present invention, a person skilled in the art shall understand with reference to the description of the embodiments of the method of the present invention.
It should be appreciated that reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, the appearances of the phrases "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. It should be understood that, in various embodiments of the present invention, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention. The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The above-described device embodiments are merely illustrative, for example, the division of the unit is only a logical functional division, and there may be other division ways in actual implementation, such as: multiple units or components may be combined, or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the coupling, direct coupling or communication connection between the components shown or discussed may be through some interfaces, and the indirect coupling or communication connection between the devices or units may be electrical, mechanical or other forms.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units; can be located in one place or distributed on a plurality of network units; some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, all functional units in the embodiments of the present invention may be integrated into one processor, or each unit may be separately regarded as one unit, or two or more units may be integrated into one unit; the integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
Those of ordinary skill in the art will understand that: all or part of the steps for realizing the method embodiments can be completed by hardware related to program instructions, the program can be stored in a computer readable storage medium, and the program executes the steps comprising the method embodiments when executed; and the aforementioned storage medium includes: various media that can store program codes, such as a removable Memory device, a Read Only Memory (ROM), a magnetic disk, or an optical disk.
Alternatively, the integrated unit of the present invention may be stored in a computer-readable storage medium if it is implemented in the form of a software functional module and sold or used as a separate product. Based on such understanding, the technical solutions of the embodiments of the present invention may be essentially implemented or a part contributing to the prior art may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the methods described in the embodiments of the present invention. And the aforementioned storage medium includes: a removable storage device, a ROM, a magnetic or optical disk, or other various media that can store program code.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the appended claims.

Claims (13)

1. A visual program verification method, the method comprising:
reading a first visualization program and a second visualization program to be verified;
generating a node information list according to at least one first level node in the first visualization program and at least one second level node in the second visualization program, wherein the node information list comprises: node hierarchy information of the at least one first hierarchical node and the at least one second hierarchical node in a contrasting arrangement;
extracting at least one piece of first variable information in a preset first level node and at least one piece of second variable information in a preset second level node;
generating a classification information list according to the at least one first variable information and the at least one second variable information, wherein the classification information list comprises: the at least one first variable information and the at least one second variable information are classified and contrasted to arrange variable information;
connecting and arranging the at least one first variable information which belongs to the same category and has the same name in the classified information list, connecting and arranging the at least one second variable information which belongs to the same category and has the same name in the classified information list, wherein the connected and arranged classified information list is a characteristic check information list; the characteristic checking information table is used for judging whether the first visualization program and the second visualization program are modified in a consistent mode.
2. The method of claim 1, further comprising:
extracting first node name information of the at least one first hierarchy node and second node name information of the at least one second hierarchy node;
and comparing and arranging the at least one first node name information and the at least one second node name information to obtain a node information list.
3. The method according to claim 1 or2, characterized in that the method further comprises:
respectively reading at least one first node index file in a preset first level node and at least one second node index file in a preset second level node;
generating a feature verification information table according to the at least one first node index file and the at least one second node index file, wherein the feature verification information table comprises: and the node storage sequence information in the at least one first node index file and the node storage sequence information in the at least one second node index file are compared with the arranged node storage sequence information.
4. The method according to claim 1 or2, characterized in that the method further comprises:
reading at least one piece of first task chain symbolic information in a preset first level node and at least one piece of second task chain symbolic information in a preset second level node respectively;
generating a feature check information table according to the at least one first task chain symbol information and the at least one second task chain symbol information, wherein the feature check information table comprises: and the node execution sequence information in the at least one first task chain symbol information and the node execution sequence information in the at least one second task chain symbol information are compared with the arranged node execution sequence information.
5. The method according to claim 1 or2, characterized in that the method further comprises:
reading at least one piece of first symbol information and at least one piece of first connection information in a preset first level node, and reading at least one piece of second symbol information and at least one piece of second connection information in a preset second level node;
generating a first directed acyclic network according to the at least one first symbol information and the at least one first connection information, and generating a second directed acyclic network according to the at least one second symbol information and the at least one second connection information;
generating a feature check information table according to the first directed acyclic network and the second directed acyclic network, wherein the feature check information table comprises: the symbol execution order information in the first directed acyclic network and the symbol execution order information in the second directed acyclic network are compared with arranged symbol execution order information.
6. The method according to claim 1 or2, characterized in that the method further comprises:
reading at least one piece of first node attribute information and at least one piece of first node code information in a preset first level node, and reading at least one piece of second node attribute information and at least one piece of second node code information in a preset second level node;
generating a feature check information table according to the at least one first node attribute information, the at least one first node code information, the at least one second node attribute information, and the at least one second node code information, wherein the feature check information table comprises: the at least one first node attribute information and the at least one second node attribute information compare arranged node attribute information, and the at least one first node code information and the at least one second node code information compare arranged node code information.
7. A visual program verification apparatus, the apparatus comprising: a processor and a memory for storing a computer program capable of running on the processor; wherein the content of the first and second substances,
the processor is configured to, when running the computer program, execute:
reading a first visualization program and a second visualization program to be verified;
generating a node information list according to at least one first level node in the first visualization program and at least one second level node in the second visualization program, wherein the node information list comprises: node hierarchy information of the at least one first hierarchical node and the at least one second hierarchical node in a contrasting arrangement;
extracting at least one piece of first variable information in a preset first level node and at least one piece of second variable information in a preset second level node;
generating a classification information list according to the at least one first variable information and the at least one second variable information, wherein the classification information list comprises: the at least one first variable information and the at least one second variable information are classified and contrasted to arrange variable information;
connecting and arranging the at least one first variable information which belongs to the same category and has the same name in the classified information list, connecting and arranging the at least one second variable information which belongs to the same category and has the same name in the classified information list, wherein the connected and arranged classified information list is a characteristic check information list; the characteristic checking information table is used for judging whether the first visualization program and the second visualization program are modified in a consistent mode.
8. The apparatus according to claim 7, wherein the processor, when executing the computer program, is configured to perform:
extracting first node name information of the at least one first hierarchy node and second node name information of the at least one second hierarchy node;
and comparing and arranging the at least one first node name information and the at least one second node name information to obtain a node information list.
9. The apparatus according to claim 7 or 8, wherein the processor, when executing the computer program, is configured to perform:
respectively reading at least one first node index file in a preset first level node and at least one second node index file in a preset second level node;
generating a feature verification information table according to the at least one first node index file and the at least one second node index file, wherein the feature verification information table comprises: and the node storage sequence information in the at least one first node index file and the node storage sequence information in the at least one second node index file are compared with the arranged node storage sequence information.
10. The apparatus according to claim 7 or 8, wherein the processor, when executing the computer program, is configured to perform:
reading at least one piece of first task chain symbolic information in a preset first level node and at least one piece of second task chain symbolic information in a preset second level node respectively;
generating a feature check information table according to the at least one first task chain symbol information and the at least one second task chain symbol information, wherein the feature check information table comprises: and the node execution sequence information in the at least one first task chain symbol information and the node execution sequence information in the at least one second task chain symbol information are compared with the arranged node execution sequence information.
11. The apparatus according to claim 7 or 8, wherein the processor, when executing the computer program, is configured to perform:
reading at least one piece of first symbol information and at least one piece of first connection information in a preset first level node, and reading at least one piece of second symbol information and at least one piece of second connection information in a preset second level node;
generating a first directed acyclic network according to the at least one first symbol information and the at least one first connection information, and generating a second directed acyclic network according to the at least one second symbol information and the at least one second connection information;
generating a feature check information table according to the first directed acyclic network and the second directed acyclic network, wherein the feature check information table comprises: the symbol execution order information in the first directed acyclic network and the symbol execution order information in the second directed acyclic network are compared with arranged symbol execution order information.
12. The apparatus according to claim 7 or 8, wherein the processor, when executing the computer program, is configured to perform:
reading at least one piece of first node attribute information and at least one piece of first node code information in a preset first level node, and reading at least one piece of second node attribute information and at least one piece of second node code information in a preset second level node;
generating a feature check information table according to the at least one first node attribute information, the at least one first node code information, the at least one second node attribute information, and the at least one second node code information, wherein the feature check information table comprises: the at least one first node attribute information and the at least one second node attribute information compare arranged node attribute information, and the at least one first node code information and the at least one second node code information compare arranged node code information.
13. A computer readable storage medium, characterized in that the computer readable storage medium stores one or more programs which are executable by one or more processors to implement the method of any one of claims 1 to 6.
CN201810565685.2A 2018-06-04 2018-06-04 Visual program verification method and device and computer readable storage medium Active CN108845799B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810565685.2A CN108845799B (en) 2018-06-04 2018-06-04 Visual program verification method and device and computer readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810565685.2A CN108845799B (en) 2018-06-04 2018-06-04 Visual program verification method and device and computer readable storage medium

Publications (2)

Publication Number Publication Date
CN108845799A CN108845799A (en) 2018-11-20
CN108845799B true CN108845799B (en) 2021-10-01

Family

ID=64210572

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810565685.2A Active CN108845799B (en) 2018-06-04 2018-06-04 Visual program verification method and device and computer readable storage medium

Country Status (1)

Country Link
CN (1) CN108845799B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110211453B (en) * 2019-05-26 2021-06-08 深圳市天天来玩科技有限公司 Method for assisting remote pairing programming by combining environmental privacy
CN117312292B (en) * 2023-11-28 2024-02-02 深圳市移卡科技有限公司 Method, device, equipment and medium for checking organization operation report form based on tree diagram

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106445513A (en) * 2016-09-12 2017-02-22 中山大学 Similarity calculation method based on mobile application interface element
CN106649805A (en) * 2016-12-29 2017-05-10 中国科学院软件研究所 High-efficiency Web application cross-browser layout compatibility detecting system and method
CN107665187A (en) * 2016-07-28 2018-02-06 百度在线网络技术（北京）有限公司 A kind of method and apparatus for judging mobile device application interface and whether changing

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10728120B2 (en) * 2016-12-13 2020-07-28 Sap Se Weighted node layering in graph drawing

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107665187A (en) * 2016-07-28 2018-02-06 百度在线网络技术（北京）有限公司 A kind of method and apparatus for judging mobile device application interface and whether changing
CN106445513A (en) * 2016-09-12 2017-02-22 中山大学 Similarity calculation method based on mobile application interface element
CN106649805A (en) * 2016-12-29 2017-05-10 中国科学院软件研究所 High-efficiency Web application cross-browser layout compatibility detecting system and method

Also Published As

Publication number Publication date
CN108845799A (en) 2018-11-20

Similar Documents

Publication Publication Date Title
CN106294164B (en) A kind of code check method and device
Tonella Using a concept lattice of decomposition slices for program understanding and impact analysis
JP5197688B2 (en) Integrated environment generator
US7861226B1 (en) Constraint solver to code based test data generation for improving software reliability and security
CN100390739C (en) Apparatus,system and method for identifying fixed memory address errors in source code
Shi et al. Integration testing of software product lines using compositional symbolic execution
Akehurst et al. Implementing associations: UML 2.0 to Java 5
Arcaini et al. AsmetaSMV: a way to link high-level ASM models to low-level NuSMV specifications
CN108845799B (en) Visual program verification method and device and computer readable storage medium
EP2141587A1 (en) Method and system for generating of a control flow graph for representing a program code
CN111880784B (en) SIMSCRIPT language-oriented discrete event simulation graphical modeling method
Torunski et al. Code style analytics for the automatic setting of formatting rules in ides: A solution to the tabs vs. spaces debate
Popoola et al. EMG: A domain-specific transformation language for synthetic model generation
Oluwagbemi et al. Automatic generation of test cases from activity diagrams for UML based testing (UBT)
CN103617122B (en) A kind of comparison method of source code
Fukamachi et al. Modularity for uncertainty
Khalid et al. Python based power system automation in PSS/E
CN109344083A (en) A kind of program debugging method, device, equipment and readable storage medium storing program for executing
CN114791808A (en) Data flow graph generation method and device
Nguyen et al. A test data generation method for c/c++ projects
Zhang An Approach for Extracting UML Diagram from Object-Oriented Program Based on J2X
US20090138249A1 (en) Defining operational elements in a business process model
JP3452960B2 (en) Object type model creation system and fault diagnosis system creation system
Hornos et al. Installation process and main functionalities of the Spin model checker
CN117234488B (en) Intelligent legal contract generation method and device based on EPC model

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant