JP2018169693A - Information processing device, information processing method, and information processing program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To easily determine whether or not constraint is obeyed in a user program.SOLUTION: An information processing device 1 determines whether or not an application program which calls a function in a library having constraint described as a type satisfies the constraint. The information processing device comprises: search means 3 to search the library 2 for a single function or a combination of a plurality of functions which constructs the type required for the function call of the application program; and satisfaction determination means 4 to determine that the application program satisfies the constraint when the search means 3 succeeds in finding the single function or the combination of the plurality of functions.SELECTED DRAWING: Figure 6

Description

  The present invention relates to an information processing apparatus, an information processing method, and an information processing program that handle constraints as a mold.

  Compared to general business systems used in companies and the like, IoT (Internet of Things) systems often require more extensive knowledge. For example, in the physical layer, knowledge regarding restrictions on devices is required. When wireless communication is required, knowledge about the communication method is required. Furthermore, knowledge for efficiently storing collected data, knowledge about system design for data processing, knowledge about big data processing for processing a large amount of data, and the like are required. In addition to knowledge necessary for design, knowledge on the operation side such as laws and regulations such as privacy and protection of portrait rights is also required at the time of system development.

  Patent Document 1 describes a technique for collecting knowledge from a plurality of people or a plurality of organizations and making it into a software library (library).

Japanese Patent Laid-Open No. 11-184874

  A single developer rarely has extensive knowledge. In reality, it is envisaged that human resources with knowledge in each field will be gathered and each will share their knowledge. Since human resources with deep knowledge in a certain area are limited, it is often required to participate in a plurality of different projects at the same time. Their main work is design review, testing, attending meetings, responding to inquiries, etc. As the number of projects increases, it becomes difficult for system developers to secure human resources with deep knowledge in a certain area even if they can be procured. The difficulty of securing human resources can be a business bottleneck.

  Therefore, as described in Patent Document 1, it is a good idea to convert the collected knowledge into a reusable library.

  In general, generalized processing is described in a library, and general-purpose processing can be reproduced by calling the library. Further, if necessary, the usage restrictions may be made into a library as general-purpose test code. In that case, the code for calling the test code on the user program side is described, so that it is possible to test whether or not the constraint is satisfied at the test code calling location.

  However, in such a method, the inspection can be performed only at the test call location. For example, even if the user program A calls the library program B and further calls a test associated with the library program B, what is guaranteed by the inspection is the correctness of the library program B on the execution context. That is, it cannot be guaranteed that the library program B is properly called from the user program A. In other words, it is not determined whether or not usage restrictions are being followed.

  It is an object of the present invention to make it possible to easily determine whether or not restrictions are observed in a user program.

  An information processing apparatus according to the present invention is an information processing apparatus that determines whether or not an application program that calls a function of a library in which a constraint is described as a type satisfies the constraint, and is a type required for calling a function of the application program A search function that searches a library for a single function or a combination of functions, and the application program satisfies the constraints when the search means finds a single function or a combination of functions. It is characterized by comprising satisfaction determination means for determining that there is.

  The information processing method according to the present invention is an information processing method for determining whether or not an application program that calls a function of a library in which a constraint is described as a type satisfies the constraint, and is a type required for calling a function of the application program Search a library for a single function or a combination of functions, and determine that the application program satisfies the constraints if it can find a single function or a combination of functions Features.

  An information processing program according to the present invention is an information processing program for determining whether or not an application program that calls a function of a library in which a constraint is described as a type satisfies the constraint. The application program satisfies the constraints when it can find a single function or a combination of multiple functions from the library to find a single function or a combination of multiple functions that build the type required for It is characterized in that a process for determining that the image is detected is executed.

  ADVANTAGE OF THE INVENTION According to this invention, it can be made easy to determine now whether the restrictions are followed in the user's application program.

It is a block diagram showing an embodiment of an information processor. It is a flowchart for demonstrating operation | movement of information processing apparatus. It is explanatory drawing which shows an example of an application source code. It is explanatory drawing which shows an example of a library program. It is explanatory drawing which shows the relationship between type | mold GT1, type | mold Nat, type | mold O, and type | mold S. FIG. It is a block diagram which shows the principal part of the information processing apparatus by this invention.

Embodiment 1. FIG.
Hereinafter, embodiments of the present invention will be described with reference to the drawings.

  FIG. 1 is a block diagram illustrating an embodiment of an information processing apparatus. An information processing apparatus 10 illustrated in FIG. 1 includes a library 100, a type structure extraction apparatus 101, a type construction function extraction apparatus 102, and a type construction function search apparatus 103. The application source code 200 exists in a terminal such as a personal computer of a user who uses the library 100, for example.

  In the library 100, data relating to knowledge collected from a plurality of persons or a plurality of organizations is stored as a software library. The library 100 includes a library program in which constraints are described as types.

  The type structure extraction apparatus 101 reads the contents of the input application source code 200 and the library 100, extracts the type definition, and acquires information indicating the type structure (type structure information). The type structure information is a directed graph structure.

  The type construction function extracting device 102 reads the contents of the application source code 200 and the library 100, analyzes the input / output relation of the function, and extracts the relation of the type construction function. The type construction function also has a directed graph structure.

  The type construction function search device 103 uses the relationship between the application source code 200, the obtained type structure information and the type construction function, and creates a single type for constructing a type required for the function call described in the application source code. Search the connection structure of a function or multiple functions. The type construction function search device 103 outputs a necessary single function or a connection relation of a plurality of functions as a result of the search.

  The type construction function search device 103 uses the relationship of the type construction function obtained by the type construction function extraction device 102 with respect to the type structure extracted by the type structure extraction device 101, and uses the function included in the application source code. Searches for the function needed to generate the type to be called. Since the constraint is described as a type in the library 100, the type construction function search apparatus 103 can find a function that generates the type.

  The type structure extraction device 101, the type construction function extraction device 102, and the type construction function search device 103 can be realized by a CPU (Central Processing Unit) executing processing based on a program stored in a program storage unit. .

  Next, the operation of the information processing apparatus 10 will be described. FIG. 2 is a flowchart for explaining the operation of the information processing apparatus 10.

  The type structure extraction apparatus 101 analyzes the contents of the application source code 200 and the library 100 input from the user terminal or the like in the type identifier extraction process in step S201, and extracts the type identifier. Further, the type structure extraction apparatus 101 extracts the parent-child relationship and the parameter relationship of each type indicated by the type identifier obtained by the type identifier extraction processing in the type relationship extraction processing in step S202.

  The type construction function extraction device 102 scans the function for the contents of the input application source code 200 and the library 100 in the function identifier extraction processing in step S211, and extracts the function identifier. The type construction function extraction device 102 extracts the input / output correspondence (function input / output relationship) for each of the identifier functions obtained by the function identifier extraction processing in the function input / output relationship extraction processing in step S212. .

  The type construction function search apparatus 103 performs the type inheritance relationship (parent-child relationship and parameter relationship) and the step obtained in the type relationship extraction processing in step S202 in addition to the application source code and library in the type search space generation processing in step S221. Based on the input / output relationship of the function obtained in the function input / output relationship extraction process of S212, search should be performed to specify the target type (the type required for the function call described in the application source code). A space (search space) is generated.

  The type construction function search device 103 is a single function or function to be used for generating the target type based on the space generated by the type search space generation process of step S221 in the type search process of step S222. Search for a combination of.

  The failure to find a single function or a combination of functions means that a combination of functions that can satisfy a constraint given as a type could not be found. Therefore, in that case, that is, when a single function or a combination of functions cannot be found, the type construction function search device 103 determines that the constraint has been violated and outputs an error (step S223; No).

  The ability to find a single function or a combination of functions means that a way to satisfy the constraint has been found. In that case, the type construction function search device 103 generates and outputs a function that satisfies the constraints in the function generation processing in step S231.

  Next, a specific example of the operation of the information processing apparatus 10 will be described.

  FIG. 3 is an explanatory diagram showing an example of the application source code. The application source code 200a illustrated in FIG. 3 is a code for determining S [S [S [O]]], which is an argument, using a truth value by a function called isGreaterThan1 in a library program existing in the library 100. is there.

  FIG. 4 is an explanatory diagram showing an example of the contents of the library (library program). In the example shown in FIG. 4, a function definition and constraints related to the input of the function are defined by a type structure (line 12), and values that satisfy the constraints are defined as a type generation function (lines 9 to 10). Yes. Further, as will be described later, the library program is a program in which a constraint satisfaction condition is defined using a type generation function having a recursive structure.

  Specifically, in the library program 100a illustrated in FIG. 4, the function isGreaterThan1 is defined on the 12th line. As a constraint given in the library 100 for the function isGreaterThan1, GT1 [K] exists. The application source code 200a is required to satisfy this restriction.

  More specifically, the function isGreaterThan1 expresses that the constraint that K, which is the first argument, is greater than 1. If this restriction is not satisfied, it is required to issue an error reliably at the time of compilation.

  In the information processing apparatus 10, the type structure extraction apparatus 101 extracts a type from the application source code 200a and the library program 100a by the type identifier extraction processing in step S201. The types extracted from the application source code 200a are S and O. There are four types extracted from the library program 100a: Nat, O, S, and GT1.

  The type structure extraction apparatus 101 extracts the type relationship in the type relationship extraction process in step S202. From the second line of the library program 100a, it can be extracted that the type O is a child of the type Nat. Then, the type structure extraction apparatus 101 can extract from the third row that the type S is a child of the type Nat having a child of the type Nat as a parameter. Further, the type structure extraction apparatus 101 can extract from the fifth line that the type GT1 has the types O and S which are child classes of the types Nat and GT1 as parameters.

  FIG. 5 is an explanatory diagram showing the relationship (parent-child relationship and parameter relationship) between the type GT1 and the type Nat, type O, and type S.

  The type construction function search device 103 extracts isGreaterThan1, GT1; apply, GT1; twoGT1, GT1; xGT1 as function identifiers in the type search space generation processing in step S221.

  Further, the type structure extraction apparatus 101 extracts the input / output relationship of the function as follows in the function input / output relationship extraction processing in step S212.

GT1; apply: (K <: Nat) GT1 [K] → GT1 [K] (from the 7th line of the library program 100a)
GT1; twoGT1: GT1 [S [S [O]]] (From the 9th line of the library program 100a)
GT1; xGT1: (K <: Nat) GT1 [K] → GT1 [S [K]] (From the 10th line of the library program 100a)
isGreaterThan1: (K <: Nat) K → GT1 [K] → Boolean (From the 12th line of the library program 100a)

  The type construction function search device 103 uses the above information to generate a search space in the type search space generation process in step S221. In the library program 100a, since isGreaterThan1 [S [S [O]]] is the target function, the input / output relationship of the function extracted from the 12th line of the library program 100a is “K → GT1 [K] → Boolean”. Among these, it is specified that GT1 [S [S [O]]] needs to be searched. That is, a space related to GT1 [S [S [O]]] is specified as a search space.

  Specifically, the type construction function search apparatus 103 determines a single function or a combination of functions that should be used to generate the type GT1 [S [S [O]]] in the type search process in step S222. Explore. Hereinafter, the function used to generate the type GT1 [S [S [O]]] is referred to as a function that satisfies a condition.

  The type construction function search device 103 first determines whether or not the input / output correspondence specified in the function input / output relationship extraction processing in S212 meets the condition (first search). GT1; xGT1 GT1 [K] → GT1 [S [K]] that meets the conditions.

  Here, if K = S [S [O]], xGT1 is established, so that GT1 [S [S [O]]] needs to be established. Therefore, the type construction function search apparatus 103 recursively determines whether GT1 [S [S [O]]] is satisfied (second search). Here, GT1; twoGT1 and GT1; xGT1 meet the conditions. Therefore, the type construction function search apparatus 103 determines each of them.

  For xGT1 to meet the requirements, GT [S [O]] must be satisfied. Therefore, GT [O] needs to be satisfied in the third search, but it is determined that it does not hold here. This is because K that satisfies S [K] = O cannot be found.

  Therefore, it returns to the determination of the conformity of GT1; twoGT1 as the second search. In the library program 100a, it is defined that no argument is taken from the input / output relationship of the functions of twoGT1, that is, GT1 [S [S [O]] is satisfied without any preconditions. Therefore, in the second search, it can be seen that twoGT1 meets the conditions.

  The type construction function search device 103 generates and outputs a function that satisfies the constraints in the function generation processing in step S231. In this example, it was isGreaterThan1 (S [S [S [O]]]) (GT1 [K]) that needed to be examined.

  And it was xGT1 that met the conditions in the first search. Therefore, it is transformed into isGreaterThan1 (S [S [S [O]]]) (xGT1 [K ′]). It is twoGT1 that met the conditions in the second search. Therefore, it is further transformed to isGreaterThan1 (S [S [S [O]]]) (xGT1 [twoGT1]).

  Furthermore, the argument gt (corresponding to xGT1 [twoGT1]) does not appear in the definition of the right side of isGreaterThan1 on the 12th line. Therefore, xGT1 [K ′] can be removed from isGreaterThan1 (S [S [S [O]]]) (xGT1 [K ′]). That is, the type construction function search device 103 outputs isGreaterThan1 (S [S [S [O]]]) = true as a function that satisfies the constraints in the function generation processing in step S231.

  Next, the operation of the information processing apparatus 10 will be described taking as an example the case where the function isGreaterThan1 (O) whose argument is (O) is specified in the application source code 200a. The processing in steps S201 to S221 is the same as the processing in the above case.

  In this case, the type construction function search device 103 searches for the type GT [O] in the type search process of S222. However, the function that should be used to generate type GT [O] cannot be found from the input / output relationship of the function. This is because xGT1 [K] has recursion to decrease with respect to K, but there is no decrease from 0 in the definition of Nat in the library program 100a shown in FIG.

  Therefore, the type construction function search device 103 issues an error to the source code that includes the function call isGreaterThan1 (O) as not satisfying the constraints.

  In the present embodiment, a single function for constructing a type necessary for a function call of an application program is found, but a combination of a plurality of functions may be found.

  In the present embodiment, constraints are defined as types in the library 100. The information processing apparatus 10 generates a structure of a necessary type (steps S201 to S202) and searches for a function that satisfies the type (step S222) and is necessary for generating a target type. A function that may be taken is extracted (steps S211 to S212). Then, the information processing apparatus 10 extracts a parent-child relationship of functions and an input / output relationship of functions in order to generate a search space (step S221). As a result, it is possible to check for the existence of a function that satisfies the constraints defined as types.

  Further, in the present embodiment, it is possible to eliminate the need to describe the constraint on the application source code side that is one input, so that the creator of the application program is not required to know the constraint.

  In addition, the application source code can be inspected at the time of compilation by applying the present embodiment at the time of compiling the application program. Then, the constraint is embedded in the library as a type, and it can be guaranteed that the application program satisfies the constraint based on the correspondence (correspondence of the structure of the function) obtained by the search.

  In addition, the constraint is substantially hidden in the library, and the caller application program does not need the constraint information.

  As described above, according to the present embodiment, it is possible to automate the determination of restrictions in calling functions that have restrictions on calls to application software.

  FIG. 6 is a block diagram showing a main part of the information processing apparatus according to the present invention. The information processing apparatus 1 illustrated in FIG. 6 is an apparatus that determines whether or not an application program that calls a function of a library in which a constraint is described as a type satisfies the constraint, and a type that is required for a function call of the application program A search function 3 for searching the library 2 for a single function or a combination of a plurality of functions (in the embodiment, realized by the type construction function search device 103), and the search means 3 is a single function or Satisfaction determining means 4 (in the embodiment, realized by the type construction function search device 103) that determines that the application program satisfies the constraints when a combination of a plurality of functions can be found. .

DESCRIPTION OF SYMBOLS 1 Information processing apparatus 2 Library 3 Search means 4 Satisfaction determination means 10 Information processing apparatus 100 Library 100a Library program 101 Type structure extraction apparatus 102 Type construction function extraction apparatus 103 Type construction function search apparatus 200, 200a Application source code

Claims (10)

An information processing apparatus that determines whether an application program that calls a library function in which a constraint is described as a type satisfies the constraint,
Search means for searching from the library for a single function or a combination of a plurality of functions for constructing a type required for a function call of the application program;
Satisfaction determining means for determining that the application program satisfies a constraint when the search means can find the single function or a combination of a plurality of functions. . The information processing apparatus according to claim 1, wherein the library includes a library program in which constraints related to function inputs are defined by a type structure, and values satisfying the constraints are defined as a type generation function. The information processing apparatus according to claim 2, wherein the library program is a program in which a constraint satisfaction condition is defined using a type generation function having a recursive structure. The information processing apparatus according to any one of claims 1 to 3, wherein the search unit searches for a single function or a combination of a plurality of functions while removing unused variables. An information processing method for determining whether or not an application program that calls a library function in which a constraint is described as a type satisfies the constraint,
Search the library for a single function or a combination of functions that builds the types required for function calls in the application program,
An information processing method comprising: determining that the application program satisfies a restriction when a single function or a combination of a plurality of functions can be found. The information processing method according to claim 5, wherein the library includes a library program in which constraints related to function inputs are defined by a type structure, and values satisfying the constraints are defined as a type generation function. The information processing method according to claim 6, wherein the library program is a program in which a condition for satisfying a constraint is determined using a type generation function having a recursive structure. The information processing method according to any one of claims 5 to 7, wherein a search is made for a single function or a combination of a plurality of functions while removing unused variables. An information processing program for determining whether an application program that calls a function of a library in which a constraint is described as a type satisfies the constraint,
On the computer,
A process of searching the library for a single function or a combination of a plurality of functions for constructing a type required for the function call of the application program;
An information processing program for executing a process of determining that the application program satisfies a restriction when a single function or a combination of a plurality of functions can be found. The information processing program according to claim 9, wherein the library includes a library program in which constraints related to function inputs are defined by a type structure, and values satisfying the constraints are defined as a type generation function.

Images