会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • SOURCE CODE VIOLATION MATCHING AND ATTRIBUTION
    • 源代码违法匹配与引用
    • US20160132326A1
    • 2016-05-12
    • US14988491
    • 2016-01-05
    • SEMMLE LIMITED
    • Anders Starcke HenriksenArthur BaarsPavel AvgustinovJulian TibbleMax SchaeferOege de Moor
    • G06F9/44G06F17/30
    • G06F8/71G06F8/43G06F8/75G06F8/77G06F11/3616G06F17/30106G06Q10/06398
    • Methods, systems, and apparatus, including computer programs encoded on computer storage media, for matching and attributing code violations. One of the methods includes receiving a snapshot S of a code base of source code and a different snapshot T of the code base. Data representing first violations in the snapshot S and second violations in the snapshot Tis received. Pairs of matching violations are determined using performing two or more matching processes, including performing a first matching process, the first matching process determining first pairs of matching violations according to a first matching algorithm and performing a second matching process, the second matching process determining second pairs of matching violations according to a second matching algorithm from violations not matched by the first matching process. The first pairs of matching violations and the second pairs of matching violations are included in the determined pairs of matching violations.
    • 方法,系统和装置,包括在计算机存储介质上编码的计算机程序,用于匹配和归因于代码违例。 其中一种方法包括接收源代码的代码库和代码库的不同快照T的快照S。 表示快照S中第一次违规的数据和快照Tis中的第二次违规。 通过执行两个或更多个匹配过程来确定对匹配违规,包括执行第一匹配处理,第一匹配处理根据第一匹配算法确定第一对匹配违规,并执行第二匹配处理,第二匹配处理确定第二匹配过程 根据不符合第一匹配过程的违规的第二匹配算法对匹配违规。 在确定的匹配违规对中包括第一对匹配违例和第二对匹配违规。
    • 4. 发明申请
    • SOURCE CODE VIOLATION MATCHING AND ATTRIBUTION
    • 源代码违法匹配与引用
    • US20150309790A1
    • 2015-10-29
    • US14696185
    • 2015-04-24
    • SEMMLE LIMITED
    • Anders Starcke HenriksenArthur BaarsPavel AvgustinovJulian TibbleMax SchaeferOege de Moor
    • G06F9/44
    • G06F8/71G06F8/43G06F8/75G06F8/77G06F11/3616G06F17/30106G06Q10/06398
    • Methods, systems, and apparatus, including computer programs encoded on computer storage media, for matching and attributing code violations. One of the methods includes receiving a snapshot S of a code base of source code and a different snapshot T of the code base. Data representing first violations in the snapshot S and second violations in the snapshot T is received. Pairs of matching violations are determined using performing two or more matching processes, including performing a first matching process, the first matching process determining first pairs of matching violations according to a first matching algorithm and performing a second matching process, the second matching process determining second pairs of matching violations according to a second matching algorithm from violations not matched by the first matching process. The first pairs of matching violations and the second pairs of matching violations are included in the determined pairs of matching violations.
    • 方法,系统和装置,包括在计算机存储介质上编码的计算机程序,用于匹配和归因于代码违例。 其中一种方法包括接收源代码的代码库和代码库的不同快照T的快照S。 收到表示快照S中的第一次违规的数据和快照T中的第二次违规。 通过执行两个或更多个匹配过程来确定对匹配违规,包括执行第一匹配处理,第一匹配处理根据第一匹配算法确定第一对匹配违规,并执行第二匹配处理,第二匹配处理确定第二匹配过程 根据不符合第一匹配过程的违规的第二匹配算法对匹配违规。 在确定的匹配违规对中包括第一对匹配违例和第二对匹配违规。
    • 8. 发明授权
    • Recursive aggregates
    • 递归聚合
    • US09015193B1
    • 2015-04-21
    • US14292581
    • 2014-05-30
    • Semmle Limited
    • Oege de Moor
    • G06F17/30
    • G06F17/30513G06F17/30412G06F17/30483G06F17/30595
    • Methods, systems, and apparatus, including computer programs encoded on computer storage media, for expressing and evaluating aggregation functions, including aggregation functions in the context of recursive aggregates, in data languages that implement fixed point semantics. One of the methods includes receiving input specifying, explicitly or implicitly, an aggregation function agg having an input type and an output type, a relation s that has a domain and a range and that represents one or more entities to be aggregated over, and a relation t that is a relation from the range of s to the input type of the aggregation function agg; and evaluating an aggregation construct agg* to calculate a relation between the domain of s and the output type of the aggregation function agg according to agg*(s, t)={(m, agg(n))|∃d: (m,d)εs,nεπ{|t(y)|yεs(m)|}}.
    • 方法,系统和装置,包括在计算机存储介质上编码的计算机程序,用于在实现固定点语义的数据语言中表达和评估聚合函数,包括在递归聚合的上下文中的聚合函数。 一种方法包括接收明确或隐含地指定具有输入类型和输出类型的聚合函数agg的输入,具有域和范围的关系,并且表示要聚合的一个或多个实体,以及 关系t是从s到聚合函数agg的输入类型的关系; 并且根据agg *(s,t)= {(m,agg(n))|∃d:(m)来计算聚合函数agg的域和输出类型之间的关系 ,d)&egr; s,n&egr;&pgr; {| t(y)| y&egr; s(m)|}}。
    • 10. 发明授权
    • Recursive aggregates
    • 递归聚合
    • US09418111B1
    • 2016-08-16
    • US14679759
    • 2015-04-06
    • SEMMLE LIMITED
    • Oege de Moor
    • G06F17/30
    • G06F17/30513G06F17/30412G06F17/30483G06F17/30595
    • Methods, systems, and apparatus, including computer programs encoded on computer storage media, for expressing and evaluating aggregation functions, including aggregation functions in the context of recursive aggregates, in data languages that implement fixed point semantics. One of the methods includes receiving input specifying, explicitly or implicitly, an aggregation function agg having an input type and an output type, a relation s that has a domain and a range and that represents one or more entities to be aggregated over, and a relation t that is a relation from the range of s to the input type of the aggregation function agg; and evaluating an aggregation construct agg* to calculate a relation between the domain of s and the output type of the aggregation function agg according to agg*(s,t)={(m,agg(n))|∃d:(m,d)εs,nεΠ{|t(y)|yεs(m)|}}.
    • 方法,系统和装置,包括在计算机存储介质上编码的计算机程序,用于在实现固定点语义的数据语言中表达和评估聚合函数,包括在递归聚合的上下文中的聚合函数。 一种方法包括接收明确或隐含地指定具有输入类型和输出类型的聚合函数agg的输入,具有域和范围的关系,并且表示要聚合的一个或多个实体,以及 关系t是从s到聚合函数agg的输入类型的关系; 并且根据agg *(s,t)= {(m,agg(n))|∃d:(m)来计算聚合函数agg的域和输出类型之间的关系 ,d)εs,nεΠ{| t(y)|yεs(m)|}}。