公开(公告)号：JP2013128175A

公开(公告)日：2013-06-27

申请号：JP2011276303

申请日：2011-12-16

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Machines Corporation

Inventor： WATANABE YUJI ,  TATEISHI TAKAAKI

IPC: H04L9/32 ,  G06F17/30

CPC classification number: H04L9/28 ,  H04L9/008 ,  H04L2209/34

Abstract: PROBLEM TO BE SOLVED: To verify whether a character string is accepted by an automaton or not.SOLUTION: There is provided a server which is connectable to a client for receiving a character string as input, has an automaton whose state transits depending on a received character, and is for determining whether or not the automaton transits to a final state by the character string. The server receives a cipher sequence, in which a factor corresponding to each character included in the character string is made to be a value obtained from encrypting a non-unit element using a first encryption system having homomorphism and a factor except the factor corresponding to the character is made to be a value obtained from encrypting a unit element using the first encryption system, from the client; generates exchange data obtained from encrypting a post-state key using the first encrypting system on the basis of the cipher sequence, correspondingly to each state of a plurality of pre-states of the automaton, depending on the reception of the cipher sequence; and encrypts the exchange data by a corresponding pre-state key to transmit the data to the client.

Abstract translation: 要解决的问题：验证字符串是否被自动机接受。 解决方案：提供了一种可连接到客户端的服务器，用于接收字符串作为输入，具有其状态根据接收到的字符转移的自动机，并且用于确定自动机是否转换到最终状态 由字符串。 服务器接收密码序列，其中将与字符串中包含的每个字符相对应的因子设为从使用具有同态的第一加密系统加密非单元元素获得的值，以及除了与 使用第一加密系统从客户端加密单元获得的值; 根据密码序列的接收，根据密码序列，根据自动机的多个前置状态的各状态生成使用第一加密系统对后状态密钥进行加密而获得的交换数据; 并通过相应的前置状态密钥对交换数据进行加密，以将数据发送给客户端。 版权所有（C）2013，JPO＆INPIT

公开(公告)号：JP2006178835A

公开(公告)日：2006-07-06

申请号：JP2004373087

申请日：2004-12-24

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： TATEISHI TAKAAKI ,  KITAYAMA FUMIHIKO ,  FUJII KUNIKAZU

IPC: G06F9/45

Abstract: PROBLEM TO BE SOLVED: To raise efficiency in a program analyzing work by providing a method for efficiently extracting a execution condition required till the execution of a program reaches the code in program analysis, and providing a system therefor.
SOLUTION: A program analysis device is provided with: a graph generating part 10 for analyzing the program to be processed and generating a condition dependence graph where a condition and state change till the execution reaches the code to be noted are used as nodes; and a graph abstracting part 20 for replacing the plurality of conditions and state changes corresponding to the plurality of nodes of a perfect subgraph with the set of one or the plurality of state changes concerning the perfect subgraph which is a part where a path is divided into the plurality of paths by the condition corresponding to a prescribed node and subsequently joined together to one node again, in the condition dependence graph generated by the graph generating part 10, and converting it into the subgraph which is expressed by one path passing the node corresponding to the set of the state changes.
COPYRIGHT: (C)2006,JPO&NCIPI

Abstract translation: 要解决的问题：为了提高程序分析工作的效率，通过提供一种用于有效提取程序执行到执行程序所需的执行条件的方法，并提供其系统。 解决方案：程序分析装置具有：用于分析待处理程序的图形生成部分10，并且生成直到执行到达要注意的代码的条件和状态改变的条件依赖图被用作节点 ; 以及图形抽象部分20，用于将与完整子图的多个节点对应的多个条件和状态变化替换为关于作为路径被分割成的部分的完美子图的一个或多个状态变化的集合 所述多个路径通过与规定节点相对应的条件，并且随后在图生成部分10生成的条件依赖图中再次连接到一个节点，并将其转换成由通过节点对应的一个路径表示的子图 到状态的变化。 版权所有（C）2006，JPO＆NCIPI

公开(公告)号：JP2013127665A

公开(公告)日：2013-06-27

申请号：JP2011276198

申请日：2011-12-16

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Machines Corporation

Inventor： WATANABE YUJI ,  TATEISHI TAKAAKI

IPC: G06F21/62 ,  H04L9/32

CPC classification number: H04L43/00 ,  H04L9/008 ,  H04L43/0817

Abstract: PROBLEM TO BE SOLVED: To determine whether a state of a client is included in a set stored by a server.SOLUTION: A server connectable to a client capable of managing a state thereof that successively transit, comprises: a set storage unit for storing a set including predetermined states; a server-side communication unit for communicating with the client using a concealing common-set calculation protocol for detecting whether there is a common element among sets while concealing elements of one set from the other sets; and a determining unit for determining whether a state of the client is included in the set stored by the set storage unit on the basis of ciphertext received in accordance with the concealing common-set calculation protocol.

Abstract translation: 要解决的问题：确定客户端的状态是否包含在由服务器存储的集合中。 解决方案：可连接到能够管理其继续传送的状态的客户端的服务器，包括：设置存储单元，用于存储包括预定状态的集合; 服务器侧通信单元，用于使用隐藏共同计算协议来与客户端进行通信，用于检测集合中是否存在公共元素，同时从其他集合中隐藏一个集合的元素; 以及确定单元，用于基于根据所述隐藏共同计算协议接收的密文来确定所述设置的存储单元存储的所述集合中是否包括所述客户端的状态。 版权所有（C）2013，JPO＆INPIT

公开(公告)号：JP2013246294A

公开(公告)日：2013-12-09

申请号：JP2012119545

申请日：2012-05-25

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Machines Corporation

Inventor： TATEISHI TAKAAKI ,  WATANABE YUJI

IPC: G09C1/00

CPC classification number: H04L63/0428 ,  G06F17/271 ,  G06F17/30985 ,  G06F21/554

Abstract: PROBLEM TO BE SOLVED: To determine whether an automaton satisfies context free grammar.SOLUTION: There is provided a server which can be connected to a client holding an automaton and holds context free grammar, the server comparing an edge pair representing an array of encrypted values obtained by encrypting non-end characters corresponding to a previous state and a following state that the client holds with an encrypted character string value representing an array of encrypted values encrypted corresponding to a previous state and a following state allocated to a plurality of non-end characters included in a substituted symbol array of a generation rule of the context free grammar while making the encrypted character string value secret to the client, and then transmitting an encrypted value encrypted corresponding to the previous state and following state to which substitution symbols of the generation rule where the encrypted character string value matches the edge pair to the client together with the allocated previous state and following state.

Abstract translation: 要解决的问题：确定自动机是否满足上下文无关语法。解决方案：提供一个服务器，可以连接到持有自动机的客户机，并保存上下文无关语法，服务器比较表示加密值数组的边对 通过加密与先前状态相对应的非结束字符和客户端保存的以下状态获得的加密字符串值表示对应于先前状态加密的加密值阵列和分配给多个非终端的后续状态 包括在上下文无关语法的生成规则的替代符号阵列中的字符，同时使加密的字符串值对客户机进行密码，然后发送对应于先前状态加密的加密值，并且随后的状态，生成的替换符号 加密字符串值与边缘对匹配的规则 nt与分配的先前状态和后续状态一起。

公开(公告)号：JP2013128166A

公开(公告)日：2013-06-27

申请号：JP2011276118

申请日：2011-12-16

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Machines Corporation

Inventor： WATANABE YUJI ,  TATEISHI TAKAAKI

IPC: H04L9/08

CPC classification number: H04L9/08 ,  G06F17/30598 ,  H04L9/14 ,  H04L9/3006 ,  H04L63/06 ,  H04L2209/50

Abstract: PROBLEM TO BE SOLVED: To reduce a data amount of a message supplied from a server to a client.SOLUTION: There is provided a server which can be connected to a client and makes the client acquire a message having an index designated by the client from N messages retained by the server, where N is an integer of 2 or more, includes: a classification part for classifies the N messages into M classified messages depending on their contents; a message encryption part for encrypting each of the M classified messages; a message supply part for supplying the M encrypted classified messages to the client; and a key transmission part for transmitting a message key for decrypting a classified message corresponding to a message having an index designated by the client to the client by using oblivious transfer.

Abstract translation: 要解决的问题：减少从服务器向客户端提供的消息的数据量。 解决方案：提供一种服务器，其可以连接到客户端，并且使得客户端从由服务器保留的N个消息中获取具有由客户端指定的索引的消息，其中N是2或更大的整数，包括 ：根据其内容将N条消息分类为M个分类消息的分类部分; 消息加密部分，用于加密每个所述M个分类的消息; 用于向客户端提供M个加密分类消息的消息提供部分; 以及密钥传输部件，用于通过使用遗漏传送来向客户端发送用于解密与客户端指定的索引相对应的分类消息的消息密钥。 版权所有（C）2013，JPO＆INPIT

公开(公告)号：JP2012113693A

公开(公告)日：2012-06-14

申请号：JP2011199060

申请日：2011-09-13

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： TATEISHI TAKAAKI ,  MARCO PISTOIA ,  OMAR TRIPP ,  RYAN JAMES BERG ,  ROBERT WEINER

IPC: G06F21/22 ,  G06F11/36

CPC classification number: G06F21/50 ,  G06F21/563

Abstract: PROBLEM TO BE SOLVED: To provide a process, a system, and a computer program for determining whether a method of a computer program is a validator.SOLUTION: The computer program which has an illegal pattern and the method is received (102). The target method is normalized so that respective return statements related to the illegal pattern return a constant Boolean value (104). A first path condition and a second path condition for one or a plurality of corresponding paths are determined so that one or a plurality of corresponding basic blocks return a constant true Boolean value for the first path condition and a constant false Boolean value for the second path condition (106, 114). When unsatisfiability of both the path conditions is false, it is reported that the method is not a validator (110, 118). When the unsatisfiability of both the path conditions is true, it is reported that the method is a validator (112, 120).

Abstract translation: 要解决的问题：提供一种用于确定计算机程序的方法是否是验证器的过程，系统和计算机程序。

解决方案：接收到具有非法模式的计算机程序和方法（102）。 目标方法被归一化，使得与非法模式相关的各个返回语句返回一个常量布尔值（104）。 确定一个或多个对应路径的第一路径条件和第二路径条件，使得一个或多个对应的基本块返回用于第一路径条件的恒定真布尔值和用于第二路径的恒定假布尔值 条件（106,114）。 当路径条件不满足时，报告该方法不是验证器（110,118）。 当两个路径条件的不满足性都为真时，报告该方法是验证器（112,120）。 版权所有（C）2012，JPO＆INPIT

公开(公告)号：JP2011013810A

公开(公告)日：2011-01-20

申请号：JP2009155705

申请日：2009-06-30

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： TATEISHI TAKAAKI ,  TABUCHI SUNAO ,  PISTOIA MARCO ,  HAVIV YINNON

IPC: G06F11/36 ,  G06F21/22

CPC classification number: G06F21/577 ,  G06F8/43 ,  G06F11/3604 ,  G06F21/563

Abstract: PROBLEM TO BE SOLVED: To determine the validity of a character string generated by a program written in a programming language without executing the program.SOLUTION: The method for determining the validity of a character string generated by a program includes: abstracting a constraint between variables extracted from a source code for a programming language, wherein the variables include a string declaration and the definition of each variable is unique, describing the constraint in M2L, giving a specification to determine whether the character string is safe or unsafe in M2L, and evaluating the validity of the character string on an M2L solver on the basis of the constraint on the variables and the specification to determine whether the string is safe or unsafe.

Abstract translation: 要解决的问题：确定由编程语言编写的程序生成的字符串的有效性，而不执行程序。解决方案：用于确定程序生成的字符串的有效性的方法包括：在变量之间抽象约束 从编程语言的源代码提取，其中变量包括字符串声明，并且每个变量的定义是唯一的，描述了M2L中的约束，给出了在M2L中确定字符串是安全还是不安全的规范，以及评估 在M2L求解器上的字符串的有效性基于对变量的约束和规范来确定字符串是否安全或不安全。

公开(公告)号：JP2007279795A

公开(公告)日：2007-10-25

申请号：JP2006101584

申请日：2006-04-03

Applicant: Ibm Japan Ltd ,  日本アイ・ビー・エム株式会社

Inventor： TATEISHI TAKAAKI ,  SAITO ARATA ,  MIYASHITA TAKASHI ,  TABUCHI SUNAO ,  TOZAWA MASAHIKO

IPC: G06F17/21

CPC classification number: G06F11/3604

Abstract: PROBLEM TO BE SOLVED: To decide whether or not a plurality of screens to be successively displayed by the processing of a program satisfy specifications without executing the program. SOLUTION: This system stores a first schemer for deciding the specifications of a first picture, a second schemer for deciding the specifications of a second picture and an event for switching display by a program from the first screen to the second screen. At first, a partial program to be executed according to an event generated during the display of the screen based on the first schemer is extracted from a program based on the first schemer and the event. Then, an intermediate program for searching the set of pictures to be displayed according to the event generated during the display of the screens belonging to the set of the screens based on the first schemer is generated from the set of the screens on the basis of the partial program. Then, it is decided that under such conditions that the first screen is based on the first schemer, and that the set of the screens to be obtained by applying an intermediate program to the first schemer is based on the second schemer, those screens satisfy the specifications. COPYRIGHT: (C)2008,JPO&INPIT

Abstract translation: 要解决的问题：通过程序的处理来确定要连续显示的多个屏幕是否满足规范而不执行该程序。 解决方案：该系统存储用于决定第一图像的规格的第一扫描器，用于决定第二图像的规格的第二扫描器和用于通过程序从第一屏幕切换到第二屏幕的事件。 首先，基于第一扫描器和事件从程序中提取根据基于第一扫描器的屏幕显示期间产生的事件执行的部分程序。 然后，根据基于第一扫描仪的屏幕集合显示属于属于该屏幕组的画面所产生的事件来搜索要显示的画面集合的中间程序， 部分程序。 然后，判定在第一屏幕基于第一扫描仪的条件下，通过将中间程序应用于第一扫描仪而获得的屏幕组是基于第二扫描仪，那些屏幕满足 规格。 版权所有（C）2008，JPO＆INPIT

公开(公告)号：GB2509451A

公开(公告)日：2014-07-02

申请号：GB201406638

申请日：2012-07-12

Applicant: IBM

Inventor： TRIPP OMER ,  TATEISHI TAKAAKI ,  PISTOIA MARCO

IPC: G06F17/30 ,  G06F21/57

Abstract: A method for dynamically selecting string analysis algorithms can begin with the training of the dynamic string analysis handler of a string analysis module to effectively handle a subset of string queries having contextual metadata received from a client application in an instructional environment. The effectiveness of the training module can be based upon feedback from the client application. Upon completion of the training, a string analysis algorithm selection policy can be synthesized. The string analysis algorithm selection policy can correlate a context of a string query in the subset to the usage of a string analysis algorithm. When in the operational environment, the dynamic string analysis handler can dynamically handle string queries having contextual metadata received from the client application in accordance with the string analysis algorithm selection policy. The string analysis algorithm to be used for a string query can be dynamically and independently determined.

公开(公告)号：DE112010003979T5

公开(公告)日：2013-04-25

申请号：DE112010003979

申请日：2010-07-30

Applicant: IBM

Inventor： HAY ROEE ,  PODJARNY GUY ,  SHARABANI ADI ,  TRIPP OMER ,  WEISMAN OMRI ,  HAVIV YINNON ,  PISTOIA MARCO ,  TATEISHI TAKAAKI

IPC: G06F9/44

Abstract: Ein System und ein Verfahren zum statischen Erkennen und Kategorisieren von Herabstufungseinrichtung des Informationsflusses enthalten das Transformieren (502) eines Programms, das in einer Speichereinheit gespeichert ist, durch statisches Analysieren von Programmvariablen, um eine einzige Zuweisung zu jeder Variable in einer Befehlsmenge zu erreichen. Die Befehlsmenge wird in Produktionsregeln mit Zeichenfolgenoperationen übersetzt (504). Eine kontextfreie Grammatik wird aus den Produktionsregeln erzeugt (508), um eine endliche Menge von Zeichenfolgen zu erkennen. Eine Funktion der Herabstufungseinrichtung des Informationsflusses wird durch Vergleichen der endlichen Menge von Zeichenfolgen mit einer oder mehreren Funktionsbeschreibungen erkannt (510).