WO2008056419A1 - Dispositif de vérification de logiciel et procédé d'évaluation d'interface api - Google Patents

Dispositif de vérification de logiciel et procédé d'évaluation d'interface api Download PDF

Info

Publication number
WO2008056419A1
WO2008056419A1 PCT/JP2006/322398 JP2006322398W WO2008056419A1 WO 2008056419 A1 WO2008056419 A1 WO 2008056419A1 JP 2006322398 W JP2006322398 W JP 2006322398W WO 2008056419 A1 WO2008056419 A1 WO 2008056419A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
software
event
interface
state transition
Prior art date
Application number
PCT/JP2006/322398
Other languages
English (en)
Japanese (ja)
Inventor
Nobuaki Tanaka
Original Assignee
Panasonic Corporation
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 Panasonic Corporation filed Critical Panasonic Corporation
Priority to PCT/JP2006/322398 priority Critical patent/WO2008056419A1/fr
Publication of WO2008056419A1 publication Critical patent/WO2008056419A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/28—Error detection; Error correction; Monitoring by checking the correct order of processing

Definitions

  • the present invention relates to a software verification apparatus and an API interface verification method, and in particular, verifies the validity of an API call sequence when using a software module via a software body API (application programming 'interface). This is related to verification technology.
  • the correctness of how to use a software module is determined by information such as the correctness of parameters and flags.
  • Figure 21 shows the conventional interface check method.
  • configuration data 2109 is data handled by the target system 2110, and its validity has been determined by the validity checking module 2107.
  • the rules for validation were shown by validation rule set 1 (2104 in Figure 21) and validation rule set 2 (2105 in Figure 21). Developers or users describe rule sets for validation as source rule set 1 (2101) and source rule set 2 (2102), and generation module 2103 defines these rules with validation module 2107. It was converted to validation rule set 1 (2104) and validation rule set 2 (2105), which are in an interpretable format.
  • Patent Document 1 JP 2000-232516 A
  • Non-Patent Document 1 Masataka Sasa, “Programming Language Processing System”, Iwanami Shoten, October 31, 1989
  • Non-Patent Document 2 Compiler Principle “Technique” Tool ⁇ 1>, ⁇ 2> Information & ComputingA.
  • the conventional technique is a technique for checking the validity of data before passing it to an application, and simply checks parameters and data. Therefore, it is not possible to check the validity of the sequence when calling a software module using the API.
  • the present invention has been made on the basis of such considerations. It is possible to determine at the time of execution whether or not the user is following the usage procedure of the software module, and to determine the cause when a failure occurs. The purpose is to make it easier.
  • a software verification apparatus includes a software main body that is a main body of software execution, a software module used by the software main body, and an interface sequence definition that defines a calling sequence for calling the software main body power software module. And a sequence check module that checks the calling sequence of the API (application 'programming' interface) and a sequence check module that generates the sequence check module based on the interface sequence definition.
  • a Joule generator is a software main body that is a main body of software execution, a software module used by the software main body, and an interface sequence definition that defines a calling sequence for calling the software main body power software module.
  • a sequence check module that checks the calling sequence of the API (application 'programming' interface) and a sequence check module that generates the sequence check module based on the interface sequence definition.
  • a sequence check module is generated based on a sequence definition that defines a correct calling method, and the sequence check module constantly checks the API call sequence during execution of the software. The correctness of the order can be checked while the software is running. Therefore, when an abnormality is detected during software verification, it is possible to accurately distinguish whether it is due to an abnormality of the called software module or a problem that occurred in the calling method of the software module. This makes it possible to easily verify the software under development and improve efficiency.
  • the sequence check module includes an event extraction unit that extracts an interface call force state transition event, and a state transition according to the event extracted by the event extraction unit. And at least one state transition means for performing and a state storage means for storing the state.
  • the state transition means determines a state transition when receiving the event with reference to a state transition table.
  • the state transition is checked for correctness based on the state transition table.
  • the state transition table is generated by the sequence check module generator based on the interface sequence definition.
  • Sequence check module generator power It is clarified that the transition table is generated based on the interface sequence definition.
  • the software module includes a plurality of entities (entities), and a calling sequence allowed for each of the plurality of entities is set.
  • the sequence check module includes a plurality of the entries.
  • a plurality of the state transition means corresponding to each of the utilities, and further, an entity determination means for determining one entity to be operated based on the extracted event call force, and the entity determination Event distribution means for sending subsequent events to the entity determined by the means, and the state transition table performs state transition when the event is distributed.
  • a state transition corresponding to each of the entities may occur. So, first we identify the entities that should act on the events, distribute the events to those entities, and verify the state transitions for those entities, so that the API call sequence is multiple entities (that is, multiple entities) It is possible to check the correctness even if there is a state transition route.
  • the entity determination unit holds a set of an event and an entity when determining the entity.
  • the sequence check module generator generates the combination of the event and the entity to be held by the entity determination unit based on the interface sequence definition. To do.
  • the event / entity pair to be held by the entity determination means is a point that is generated based on the sequence check module generator force interface definition.
  • the software module has a plurality of entities (entities), and a call sequence allowed for each of the plurality of entities is set. And each of those calling sequences can be executed in parallel, and in order to allow checking of each of those calling sequences, the sequence checking module corresponds to each of the plurality of entities.
  • a plurality of the state transition means and further, based on the event extracted from the interface call force, an event distribution rule indicating to which entity the event is sent, and the event is distributed according to the event distribution rule Event distribution means, Each of the state transition means that has received the event performs state transition independently.
  • the sequence check module generator generates the event distribution rule based on the interface sequence definition.
  • the event distribution rule clearly has a point that it is generated based on the sequence check module power interface sequence definition.
  • the event distribution rule is expressed in a table format.
  • the event distribution rule is expressed in a tree format.
  • Fig. 17 shows another example of a format of an event distribution rule.
  • the event distribution rule is expressed by a hash table.
  • the sequence check module further includes a parameter check means when the interface is called.
  • sequence check module Yule further has means for checking global variables when calling the interface.
  • the sequence check module further includes a parameter checking unit at the time of calling the interface and a global variable checking unit at the time of calling the interface.
  • the call parameter check and global variable check are also performed. This makes it possible to more accurately confirm (verify) how to call a software module.
  • the API call verification method of the present invention is a method in which the software main body, which is the main body of software execution, calls and uses a software module via an API (application programming interface).
  • An API call sequence verification method for checking the validity of the API call sequence which is generated based on an interface sequence definition that defines a call sequence when the software body calls the software module.
  • the sequence check module monitors at least one API call sequence, extracts events from the call, and performs state transition power according to the event for the monitored sequence.
  • a first scan Tetsupu determines force not is, if the non-state transition in accordance with the interface definition comprises a second step of notifying the abnormality of the call sequence, the.
  • the sequence check module checks at least one of a call parameter and a global variable in addition to the call sequence.
  • the validity of the call sequence of the software module can be confirmed during the execution of the software. Due to the abnormality of the called software module at the time of occurrence, it is possible to obtain effective information for isolating whether there is a problem in the calling method of the software module.
  • each call sequence It is possible to perform a validity check.
  • an abnormal operation of software due to an abnormal API call sequence can be detected at an early stage.
  • FIG. 1 is a diagram showing a configuration of a software verification apparatus that implements an interface sequence check method according to the first embodiment of the present invention.
  • FIG. 2 is a diagram showing details of interface sequence definition in Embodiment 1 of the present invention.
  • FIG. 3 is a state transition diagram in Embodiment 1 of the present invention.
  • FIG. 4 is a state transition table according to the first embodiment of the present invention.
  • FIG. 5 is a diagram showing details of the configuration of the sequence check module according to the first embodiment of the present invention.
  • FIG. 6 is a flowchart of the sequence check module in the first embodiment of the present invention.
  • FIG. 7 is a diagram showing an interface sequence definition in the second embodiment of the present invention.
  • FIG. 8 is a state transition diagram according to the second embodiment of the present invention.
  • FIG. 9 is a diagram showing a state transition table of sequence X in Embodiment 2 of the present invention.
  • FIG. 10 is a diagram showing a state transition table of sequence Y in Embodiment 2 of the present invention.
  • FIG. 11 is a diagram showing details of the configuration of a sequence check module according to the second embodiment of the present invention.
  • FIG. 12 is a flowchart of the sequence check module according to the second embodiment of the present invention.
  • FIG. 13 is a diagram showing a state transition table generation method according to the second embodiment of the present invention.
  • FIG. 14 is a diagram showing a method for obtaining a first set according to the second embodiment of the present invention.
  • FIG. 15 is a diagram showing an interface sequence definition according to the third embodiment of the present invention.
  • FIG. 16 is a diagram showing state transition in the third embodiment of the present invention.
  • FIG. 17 is a diagram showing details of the configuration of a sequence check module according to the third embodiment of the present invention.
  • FIG. 18 shows an event distribution table according to the third embodiment of the present invention.
  • FIG. 19 is a diagram showing a state transition table generation method according to the third embodiment of the present invention.
  • FIG. 20 is a diagram showing a method for obtaining an event distribution table in the first embodiment of the present invention.
  • API Application Programming Interface
  • OS software for platforms
  • rules that define program procedures for using them.
  • it is often provided as a function for file control, window control, image processing, character control, and the like.
  • Individual software developers have software Since it is difficult and wasteful to program all functions, the functions that many software use in common are provided together in the form of OS and middleware. Individual developers can simply “call” the function according to the convention and create software that uses the function without programming it.
  • FIG. 1 is a diagram showing a configuration of a software verification apparatus that implements the call interface check method according to Embodiment 1 of the present invention.
  • a software main body 101 is software that calls and uses a software module 102 at the time of execution.
  • the software module 101 is passed through the sequence check module 103. Call 102! /
  • the software module 102 is a software module called from the software main body 101 and is called via the sequence check module 103.
  • the sequence check module 103 checks whether the sequence in which the software body 101 calls the software module 102 is correct.
  • the interface sequence definition 104 is data defining how to call a valid software module 102, and is usually defined as a grammar using BNF (Buckus Nowa Form) or the like.
  • Non-patent document 1 is detailed about BNF.
  • the power of using BNF to define the token string grammar in programming languages In the present invention, focusing on events instead of tokens, it is used to define event string grammars.
  • the API call of the software module from the software main body 101 is used as an event.
  • the sequence check module generator 105 is software that reads the interface sequence definition 104 and generates a sequence check module 103 that checks whether or not it is a sequence according to the definition.
  • FIG. here Indicates the grammar of the sequence allowed by the sequence check module 103 in the regular right-hand side grammar.
  • Non-patent document 1 provides details on the regular right-hand side grammar. The entire sequence shall be shown on the right side of the expression with sequence written on the left side. Here we show that repetition of the non-terminal symbol X is allowed (line 201).
  • X and Y written in capital letters as a convention here indicate a series of event sequences, and B NNF is a force that is called a non-terminal symbol. Therefore, they are also called sequence X and sequence Y. Further, FIG. 202 shows that the non-terminal symbol X is composed of the sequence a, b, c, or b, a.
  • FIG. 3 shows a state transition diagram showing the state transition within the non-terminal symbol X described above.
  • the software main body 101 calls the software module 102 according to the valid sequences a, b, and c, the state transitions in the order of state state 2, state 3, and state 1. If the sequence is b, a, the state transitions in the order of state 4 and state 1. If these transitions are made, the sequence is considered valid. Conversely, if these transitions are not followed, an error can be determined.
  • FIG. 4 shows a state transition table 401 when the state transition of FIG. 3 is performed.
  • the sequence check module 103 actually operates, the sequence is checked using the state transition machine and this state transition table.
  • FIG. 5 shows the configuration of sequence check module 103.
  • the event extraction means 501 is called when the check module 103 is called from the software main body 101, and transmits the interface call to the state transition means 503 as an event.
  • the state transition means 503 obtains the transition destination state from the state transition table 401 based on the event obtained from the event extraction means 501 and the state obtained from the state storage means 502, and stores the state in the state storage means 503 for event extraction.
  • Means 501 causes the software module 102 to execute the interface call from the software main body 101 as it is.
  • the message output means 504 is notified of an abnormal calling sequence.
  • the message output means 504 outputs the received notification of the calling sequence abnormality by some means. After that, the operation of the entire system may be terminated, or an abnormality notification is output. You can continue the operation just by pressing.
  • FIG. 6 shows a flowchart of the operation of the sequence check module 103.
  • the control means 505 sets the state stored in the state storage means 503 to the initial state (step 601).
  • the event extraction means 501 waits for the sequence check module 103 to be called from the software main body 101 (step 602).
  • the event extraction unit 501 creates an event based on the type of interface that has been called (step 603). Specifically, a unique event may be assigned to each API function interface, or an event may be assigned to each group by grouping multiple function interfaces.
  • the state transition unit 503 obtains the next transition destination state by referring to the state transition table 401 from the event received from the event extraction unit 501 and the state stored in the state storage unit 502 (step 604).
  • step 605 it is determined whether or not there is a transition destination (step 605). If there is a transition destination state, the state transition means 503 stores the next state in the state storage means (step 606), and then The event extraction means 501 calls the software module 102 with the same interface and parameters as those called from the software main body 101 (step 607). If there is no transition destination in step 605, the message output means 504 outputs a message by some method (step 608), and the operation is terminated.
  • FIG. 7 is a diagram showing an interface sequence definition according to the second embodiment of the present invention.
  • Description in line 701 in Figure 7 X [] Y indicates a sequence of either X or Y, (X port ⁇ ) * on line 701 indicates that the non-terminal symbol X or ⁇ can be repeatedly executed (Line 701).
  • the non-terminal symbol X indicates that it consists of the sequence a, b, c, or b, a (line 702).
  • non-terminal symbol Y indicates that it consists of the sequence d, e, f or e, d! /, (Line 7 03).
  • X and Y are each a unit of function. Specifically, one sequence is assigned to each function, such as X for the mail function and Y for the Web browser function.
  • FIG. 8 shows a state transition diagram when the state transition of FIG. 7 is performed.
  • the first event input determines whether the force Y to execute the sequence X is executed.
  • the event is a or b
  • the sequence X is executed
  • d, e the sequence Y is executed.
  • the state transition diagram shown in Fig. 9 is used. Therefore, if d, e, and 3 ⁇ 4, which are events (inputs) when sequence Y is executed, are judged as errors. Therefore, processing can be performed when an abnormal input is received during sequence X execution.
  • error processing can be performed when events a, b, and c are received during execution of sequence Y.
  • FIG. 9 shows a state transition table 901 when the state transition in X in FIG. 8 is performed.
  • Fig. 10 to Fig. 8 The state transition table 1001 when state transition in Y is performed is shown.
  • FIG. 11 shows a configuration diagram of an API call sequence check method according to the present embodiment.
  • the software main body 1101 and the software module 1102 are assumed to have a plurality of entities in the software module 1102 which is a relationship that calls the software module 1102 from the software main body 1101 as in the first embodiment. It is characterized by setting the permissible call sequence for each of these multiple entities and verifying each call sequence! /
  • 1103 is a sequence check module for checking a sequence when the software main body 1101 calls the software module 1102.
  • 1104 is an interface sequence definition in FIG. 7, and 1105 is a sequence check module generator for generating a sequence check module 1103.
  • Reference numeral 1106 denotes an event extracting means for extracting an event when the software main body 1101 calls the software module 1102.
  • the event extraction unit 1106 has substantially the same function as the event extraction unit 501 of the first embodiment, but the entity determination unit 1110 selects an entity that operates according to an event that does not send an event to the state transition unit.
  • the event distribution means 1109 for sending the event to the corresponding state transition means based on the determination of the entity determination means 1110 is different.
  • Reference numeral 1107 denotes state storage means for storing a state when the state transition means 1107 executes state transition relating to the sequence X.
  • Reference numeral 1108 denotes state transition means for executing the state transition of sequence X in FIG. 1109 is an event distribution unit that sends an event to either the state transition unit 1108 or the state transition unit 1111 based on the determination of the entity determination unit 1110.
  • 1110 is an entity determination unit that determines a branch between the sequence X and the sequence Y.
  • Reference numeral 1111 denotes state transition means for executing the sequence Y in FIG.
  • a state storage unit 1112 stores a state when the state transition unit 1111 executes the state transition.
  • 9 01 is a state transition table of X in FIG. 1001 is a state transition table of Y in FIG.
  • 1113 is a message output means for outputting a message and notifying the user when the state transition means 1108 or the state transition means 1111 detects a sequence abnormality.
  • Reference numeral 1114 denotes control means for controlling the inside of the sequence check module.
  • FIG. 12 shows a flowchart showing the operation of the sequence check module 1103.
  • control unit 1114 sets the state storage unit 1107 and the state storage unit 1112 to the initial state (step 1201 in FIG. 12).
  • the event extraction unit 1106 waits for the software main body 1101 to call the software module 1102 via the interface (step 1202).
  • the event extraction means 1106 receives a call from the software main body 1101, converts it into an event, and pre-reads one event (step 1203).
  • look ahead means that when the first token of one sequence is read, the sequence to be moved to the next is determined according to the type of the token, and the first token is re-nexted.
  • This is a general technique in parsing that interprets the first token of a sequence that has moved to, and is widely disclosed in documents such as Non-Patent Document 2. In this embodiment, this method is used not for token string processing but for event string processing.
  • the entity determination unit 1110 receives the event prefetched by the event extraction unit 1106, and whether it is a or b to be transferred to the sequence X or d or e to be transferred to the sequence Y. Is determined (step 1204). If this is a or b, go to step 1205. If d is! /, E, go to step 1213.
  • the event extraction means 1106 waits for the next interface call if there is no prefetched event, and proceeds to the next step if there is a prefetched event (step 1205). Next, the event extraction means 1106 converts the interface call into an event (step 1206). However, if there is prefetching, the prefetched event is interpreted as a called event even if there is no interface call, and the process proceeds to the next step.
  • the state transition means 1108 receives the event and the state of the state storage means 1107 as input, and the state The state transition destination is obtained with reference to the state transition table 901 (step 1207). If the obtained state transition destination is the initial state, the sequence X returns to step 1202 and starts a new iteration (step 1208).
  • step 1211 If there is no transition destination, a call is made according to the sequence, a warning message indicating that this is output (step 1211), and execution is terminated (step 1212). If there is a transition destination, the state is transitioned to that transition destination (step 1209), the same call as that received from the software main unit 1 101 is made to the software module 1102 (1210), and the process returns to step 1205 and executed. repeat.
  • step 1204 If the event is d, e in step 1204, the process proceeds to step 1213, and the same processing as in step 1205 and subsequent steps is performed on sequence Y.
  • FIG. 13 is a diagram showing a method for generating the state transition tables 901 and 1001 from the interface sequence definition 1104.
  • the power of the details of the interface sequence definition 1104 is shown in 1304 in FIG. This content is the same as the interface sequence definition 7001 in FIG.
  • the disassembling operation 1305 shows one stage of the sequence check module generator 1105 in FIG.
  • the symbol 130 indicates that either the sequence X or the sequence Y operates on the line 1301. Create temporary interface sequence definitions with only one of the sequences before and after "[]" as 1309 and 1313. The same processing as that performed by the sequence check module generator 1105 is performed on these, and the state transition tables 1113 and 1114 are generated.
  • FIG. 14 is a diagram showing a method for setting information serving as a determination reference in the entity determination unit 1110.
  • 1404 indicates the contents of the interface sequence definition 1104 in FIG.
  • Reference numeral 1405 denotes one stage of the operation of the sequence check module generator 1105.
  • Line 1401 in 1404 indicates that either sequence X or sequence Y is selected and executed and the operation is repeated.
  • the sequence of calling the software module 1102 from the software main body 1101 is monitored by the sequence check module 1103, and a plurality of state transition tables corresponding to a plurality of partial sequences are created and the state transition is managed. By doing so, it is possible to detect abnormalities in the calling sequence during execution for multiple modules.
  • Non-Patent Document 1 and Non-Patent Document 2 disclose a method for generating a syntax analyzer in a general context-free grammar. It is possible to perform a more general interface call check by applying to the embodiment.
  • FIG. 15 is a diagram showing an interface sequence definition according to the third embodiment of the present invention.
  • FIG. 16 is a state transition diagram of the sequence check module in the present embodiment.
  • FIG. 17 shows the internal structure of sequence check module 1703 in the present embodiment.
  • the event distribution unit 1709 determines whether to pass to the state transition unit 1708 or the state transition unit 1711 depending on the type of event, and passes the event.
  • the event distribution table 1710 is used for this determination.
  • the event distribution table 1710 will be described later with reference to FIG.
  • state transition means 1708 and the state transition means 1711 are activated simultaneously when two sequences start simultaneously.
  • the state storage unit 1707 and the state storage unit 171 2 are initialized by the control unit 1714. In this way, by performing the state transition of sequence X and sequence Y in parallel, it is possible to check the interface sequence when multiple sequences operate in parallel.
  • FIG. 18 shows the contents of the event distribution table 1710 of FIG.
  • an event that can be accepted in each sequence comes into sequence X and sequence Y, it is a table that can be divided into which sequence the event is transferred to!
  • the event distribution table 1710 is generated by the sequence check module generator 1705 based on the interface sequence definition 1704. The generation method will be described later.
  • FIG. 19 shows a method for generating a state transition table of sequence X and a state transition table of sequence Y from interface sequence definition 1704.
  • the power of the sequence X and sequence Y connected by the expression “X II Y” in line 1901 of 1904 is the same as the generation of the state transition table in the second embodiment.
  • sequence Y operates in parallel.
  • the interface sequence definition 1909 with the symbol after “ ⁇ ” removed is separated into the interface sequence definition 1913 with the symbol before “II” removed. If you use a method to create an analyzer.
  • FIG. 20 is a diagram showing a method for generating an event distribution table.
  • sequence X and sequence Y the events that may be received by each are extracted from interface sequence definition 2004, linked to each sequence, and inserted into event distribution table 1710.
  • the software main unit 1701 calls the software 1702
  • the sequence check module 1703 constantly monitors the sequence, and by creating a plurality of state transition means corresponding to a plurality of partially parallel operating sequences and managing the state transition, the calling sequence for the plurality of modules operating in parallel is controlled. Abnormalities can be detected.
  • event distribution table and! / Data in table format are used for event distribution. This is a data format in which a corresponding sequence can be searched from an event, and In addition to the table that uses an algorithm, the same effect can be obtained in a tree format, a no table, and a shush table format.
  • the correctness of the calling sequence of the software module can be confirmed during the execution of the software. It is possible to obtain useful information to determine whether there is a problem with the power of the software module that has been detected and how to call the software module.
  • each call sequence It is possible to perform a validity check.
  • an abnormal software operation due to an abnormal API call sequence can be detected at an early stage.
  • the interface call sequence check method that is useful in the present invention is a software module. This has the effect that the call sequence of Yule can be confirmed, and is therefore useful as a software verification technology and maintenance 'management technology.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Debugging And Monitoring (AREA)
  • Stored Programmes (AREA)

Abstract

L'invention concerne un dispositif de vérification de logiciel destiné à contrôler l'exactitude d'une séquence d'appel API pour appeler le module d'un logiciel, permettant ainsi d'éclaircir les causes d'une défaillance d'action du logiciel. Le dispositif de vérification de logiciel comprend un module de logiciel (102), un corps de logiciel (101) destiné à appeler le module de logiciel (102) et un module de contrôle de séquence (103) destiné à contrôler la séquence d'appel du corps de logiciel (101) vers le module de logiciel (102). Un générateur de module de contrôle de séquence (105) génère le module de contrôle de séquence (103) à partir d'une définition de séquence d'interface (104), de sorte qu'il peut confirmer la validité de la séquence d'appel du corps de logiciel (101) vers le module de logiciel (102), permettant ainsi de découvrir plus tôt la défaillance d'action due à la défaillance de la séquence.
PCT/JP2006/322398 2006-11-09 2006-11-09 Dispositif de vérification de logiciel et procédé d'évaluation d'interface api WO2008056419A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP2006/322398 WO2008056419A1 (fr) 2006-11-09 2006-11-09 Dispositif de vérification de logiciel et procédé d'évaluation d'interface api

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2006/322398 WO2008056419A1 (fr) 2006-11-09 2006-11-09 Dispositif de vérification de logiciel et procédé d'évaluation d'interface api

Publications (1)

Publication Number Publication Date
WO2008056419A1 true WO2008056419A1 (fr) 2008-05-15

Family

ID=39364248

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2006/322398 WO2008056419A1 (fr) 2006-11-09 2006-11-09 Dispositif de vérification de logiciel et procédé d'évaluation d'interface api

Country Status (1)

Country Link
WO (1) WO2008056419A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2012032947A (ja) * 2010-07-29 2012-02-16 Fujitsu Ltd 文脈違反検出支援方法、文脈違反検出支援装置、及び文脈違反検出支援プログラム

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH06124216A (ja) * 1992-10-09 1994-05-06 Hitachi Ltd プログラム矛盾検出装置および方法
JPH07129430A (ja) * 1993-11-02 1995-05-19 Fujitsu Ltd プログラムの試験方法
JPH07262044A (ja) * 1994-03-25 1995-10-13 Hitachi Ltd イベントトレース解析方法
JPH08115107A (ja) * 1994-10-17 1996-05-07 Hitachi Ltd 機器制御プログラム生成方式
JPH10105435A (ja) * 1996-08-02 1998-04-24 Hewlett Packard Co <Hp> ソフトウェア・ライブラリのオペレーションに関する情報を提供する方法
JPH10320234A (ja) * 1997-05-21 1998-12-04 Hitachi Ltd ソフトウェアの自動テスト方法
JPH11175369A (ja) * 1997-12-10 1999-07-02 Toshiba Corp プログラム開発支援装置、プログラム開発支援方法及びプログラム開発支援プログラムを記録した媒体
JPH11232136A (ja) * 1998-02-17 1999-08-27 Ricoh Co Ltd オブジェクト指向ソフトウエア開発支援装置
JP2002333992A (ja) * 2001-05-09 2002-11-22 Denso Corp 実行順序検査装置及びプログラム
JP2004094374A (ja) * 2002-08-29 2004-03-25 Ntt Comware Corp ロギングシステム
JP2005025543A (ja) * 2003-07-03 2005-01-27 Mitsubishi Denki Information Technology Corp 整合性チェックシステム及び整合性チェック方法及び整合性チェックプログラム及び管理情報作成システム

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH06124216A (ja) * 1992-10-09 1994-05-06 Hitachi Ltd プログラム矛盾検出装置および方法
JPH07129430A (ja) * 1993-11-02 1995-05-19 Fujitsu Ltd プログラムの試験方法
JPH07262044A (ja) * 1994-03-25 1995-10-13 Hitachi Ltd イベントトレース解析方法
JPH08115107A (ja) * 1994-10-17 1996-05-07 Hitachi Ltd 機器制御プログラム生成方式
JPH10105435A (ja) * 1996-08-02 1998-04-24 Hewlett Packard Co <Hp> ソフトウェア・ライブラリのオペレーションに関する情報を提供する方法
JPH10320234A (ja) * 1997-05-21 1998-12-04 Hitachi Ltd ソフトウェアの自動テスト方法
JPH11175369A (ja) * 1997-12-10 1999-07-02 Toshiba Corp プログラム開発支援装置、プログラム開発支援方法及びプログラム開発支援プログラムを記録した媒体
JPH11232136A (ja) * 1998-02-17 1999-08-27 Ricoh Co Ltd オブジェクト指向ソフトウエア開発支援装置
JP2002333992A (ja) * 2001-05-09 2002-11-22 Denso Corp 実行順序検査装置及びプログラム
JP2004094374A (ja) * 2002-08-29 2004-03-25 Ntt Comware Corp ロギングシステム
JP2005025543A (ja) * 2003-07-03 2005-01-27 Mitsubishi Denki Information Technology Corp 整合性チェックシステム及び整合性チェック方法及び整合性チェックプログラム及び管理情報作成システム

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2012032947A (ja) * 2010-07-29 2012-02-16 Fujitsu Ltd 文脈違反検出支援方法、文脈違反検出支援装置、及び文脈違反検出支援プログラム

Similar Documents

Publication Publication Date Title
US20080126867A1 (en) Method and system for selective regression testing
Mohammadi et al. Detecting cross-site scripting vulnerabilities through automated unit testing
US7823144B2 (en) Computer program code comparison using lexemes
US8707252B1 (en) Techniques for automatic generation of parsing code
US8495593B2 (en) Method and system for state machine translation
US8051408B1 (en) Method of providing interactive usage descriptions based on source code analysis
JP2007241906A (ja) Ｗｅｂアプリケーション脆弱性動的検査方法およびシステム
US7721250B2 (en) System and method for interactive and integrated software development process and phases
CN102123058A (zh) 一种对网络协议解码器进行测试的测试设备和方法
Baker et al. Automatic generation of conformance tests from message sequence charts
JP2015204065A (ja) テストケース生成装置及びテストケース生成方法
Saxena et al. Scriptgard: Preventing script injection attacks in legacy web applications with automatic sanitization
Lin et al. Reverse engineering input syntactic structure from program execution and its applications
JP2010267266A (ja) 試験支援装置および試験支援方法
CN106681852B (zh) 一种浏览器兼容性的调整方法及装置
WO2008056419A1 (fr) Dispositif de vérification de logiciel et procédé d&#39;évaluation d&#39;interface api
JP2008165342A (ja) ソースコード生成方法及び装置並びにプログラム
Kaliappan et al. On the formalization of UML activities for component-based protocol design specifications
CN113660230B (zh) 云安全防护测试方法、系统、计算机及可读存储介质
Gerasimov et al. Reachability confirmation of statically detected defects using dynamic analysis
WO2012049816A1 (fr) Dispositif, procédé et programme de vérification de modèle
KR20110135966A (ko) 복합 시스템의 개발 또는 사용을 지원하는 방법 및 장치, 그리고 그 지원 방법을 사용하는 프린터
Gordon Provable implementations of security protocols
Sultan et al. AMULET: a Mutation Language Enabling Automatic Enrichment of SysML Models
JP2005316710A (ja) ソフトウェア試験支援装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 06832459

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 06832459

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: JP